This week’s material is
relatively difficult and confusing compare to past weeks. It toke me lots of
time to understand and digest
the materials that were taught in classes. The concept and thinking for writing a recursion function is
very abstract, where I first need to construct a base rule and assumption while
trying to modify it by adding or removing conditions to call a higher order fractal.
Although I was very confused with the materials at first, but after some examples and
exercises we did in class plus the extra reading that was online helped me better
understand recursions.
Recursion
did give me some trouble, but I find it interesting when I can relate computer
science concepts into statistic problems, permutations. When I solve a
permutation question, I can only use factorial to determine number of the
possible combinations there are. However, using the permeation function that we
did in class (def perms (s)) allows me to find the number of combinations and
the list of all different combinations.
As a
build-on course from CSC108, many materials in this course are expansion from
108, i.e. the lab exercise I had this week, inheritance and unittesting. Although it was not too long
ago when I learned about inheritance and unittet, but now, I forgot most of it.
During the lab, I was constantly searching and looking the web to review how
inheritance and unittest work and their base codes. Even though materials are
getting harder every week and more study I required to do to understand the
concepts, but in the end, it makes me feel proud when I am able to use what I learn
to solve some challenging problems.
No comments:
Post a Comment