Week 6: Trees

This week we learned about trees and their terminology. This kind of Abstract Data Type was one of the most interesting ones that we have dealt with so far. Being able to recursively use one procedure on every node in a tree is a really useful method to deal with the entire tree. I also really enjoyed the different type of traversals that we did in class. At first, I didn't know what traversing through a tree means, but after research a bit more about it and re-reading the posted codes, I saw that it is just going through every element of a tree in a certain way and that was when I really got what was happening in in-order, pre-order and post-order traversals. I also finished Assignment 1 which was actually harder that what expected after doing some parts of it. I had never worked with this many different files which all work together at once, and I can say that was a bit of a struggle for me but I manage to work it out by re-reading the codes over and over and also talking to Danny. The main disappointment for me was not being able to figure out the bonus function, but other than that, I have a strong feeling that the rest were fine.

Week 5: Assignment 1

We are getting closer and closer to the assignment 1, and with the first look that we had this week at the Tower of Hanoi game and how the cheeses should move, I started to get afraid of it. I stayed in the library for a few hours and tried to just code it, but it didn't really work. After a while, I made a couple of cheeses our of paper and drew the 4 stool and a paper and tried to do it by hand to get a better understanding of the algorithm goes. That really helped me and when I started to code again, it was way more easier. This week's lab was really long, and unfortunately we didn't get to finish all of it, even though it was pretty understandable and easy, we didn't have enough time to finish it. My main concern for now is assignment one and I still haven't finished it yet, but I will keep you updated on the later blogs.

Week 4: Start of Recursion

This week, we took our first steps in recursion. I have only worked with recursion problems once before and that was in a function which was basically the power function, but the level of recursion problems that we are having in this course is way higher. At first, this concept was a little confusing for me, but as we went through more and more problems such as nested_depth and rec_max it become clearer for me. One of the other interesting things that we did this week was the tree_burst function which used the turtle module in order the draw and create shapes. I found this week's lab and exercise pretty easy and straight forward but the upcoming assignment seems to be pretty difficult and complicated. Hope it won't be that big of a problem and will be manageable to handle.