Tuesday, 18 February 2014

The Tree of 148



Tree is one of the most interesting topics I have learned in CSC 148. Although there are many new terminologies, operations, and traversals relating to trees, but I still find it easy to understand compare to recursion. At first, there is a little confusion with the all-different types of traversals: preorder, inorder, and postorder. However, after going through few explanations and examples of traversals, organization of trees seems to be much reasonable and clear. Personally, I find the two representation methods we talked about in class, list of lists and nodes and references (class) are easy to master, which gives the trees complexity in code but simplicity in content. In addition, the Mystery Traversal Code, from the past year’s midterm, that we did on Friday is a petty sick question that combined most of the materials we did so far. It requires me to take some times to go through the code and follows the loops, while tracing the treelist and its organization. Hopefully, the midterm test next will not have questions that are harder then this. The goal for this reading week is to complete the A1, review the materials we learned, and do the past tests to prepare myself for the up coming midterm.

Thursday, 13 February 2014

Recursion isn't that Bad


   The second week of recursion seems not too bad compared to the week before. The materials covered last week were understandable and easier to master. I like the tracing of recursion, it’s petty fun to start from the base case and go through the ‘loop’ stage by stage, until you finally get to the stage you wanted (don’t think it will fun if the recursion undergoes more the 10 loops). Another thing I like in last week’s lectures is the Guessing Number activity. It makes recursion more connecting to personal experience and interesting compare to the Binary Search exercise; where idea of searching through a sorted list makes me feel like doing extra complicated and unnecessary works.

   The recursion lab was not too bad except the SearchLists function. I spent a lot of time to figure out how to implement the function - what is base case, how to call and return recursion, what to do with ‘None’…. But after all those trying and failing of different methods and ways to develop the function, I learn quite a bit of recursion, where it allows me to have a better understand of recursion structure and function. The physical implementation and developing functions really allows me to apply what I learned, and in doing so, it gives me a visual and procedures of function structures that would better sticks in my mind. Sometimes, I find it is valuable to learn through self develop examples and exercises rather then look through codes other people wrote.

   Right now, my major concern about CSC 148 is A1. Just reading through the assignment itself overwhelms me, there’s so many things going on in is assignment – so many files, implementations, terminologies… (took me some times to understand the assignment). I know what am I going to do during my reading week, A1 and A1, and more A1.

Sunday, 2 February 2014

The Confusing Week of Recursion - Week Four

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.





Sunday, 26 January 2014

On the Third Week: The Week of Exception

Begin in the class for the third week, everything seems to be going in the right direct, nothing is too difficult or confusing. The course load is fair, understandable, and not too heavy, where I am able to go through each lecture and review the material weekly. The materials that were covered this week are very interesting. Personally it is believed that, having the knowledge about Exception will really help me with programming and function developing in the future, where not only allows me to know the different kinds of the exceptions, but also, how to use the exceptions to help me improve my coding skills.

One of the things that I liked about this course is the structure of the classes. Because I learn better from illustrating through examples, the course structure where we spend some times on understanding the materials and working on examples help me a lot in the mastering the materials. For example, the Month and Tooth classes we worked Wednesday is a good example that I’m able to connect and apply me prior knowledge to develop the basis functions while adding the new Exception materials learned in class.

There is not something especially challenged this week. However, the efficiency activity in this week’s lab is little frustrating, where I spend a lot of time trying to find an efficient way that will make a Queue ADT run faster.


Overall, this is an educational week where I learned many new and interesting things about Python, and I’m looking forward to next week.