Week 6 of CSC236

Theser recursive functions were always a tad overwhelming , especially ion first year. but after seeing how to unwind them and solve / prove their time complexities , I'm beginning to become a lot of more comfortable with them. The problem set this week wasn't a hard one , but of coarse with the 207 assignment it was eventually started the day before it was due. but of coarse looking at the examples from the class , I began to unwind it , where I saw the familiar summation notation. After rummaging through my old notes I found out the formula to solve the series and then the proof was easy after that. I'd hoped to do a tad better on the first test , but I guess being late even a few minutes has quite an impact on my mark.

Week 5 of CSC236

Structural induction seems very familiar to simple induction that we have done in class. Especially the full binary tree problems and the set theory problems which rely a lot on the structure of the item which we need to prove. It seems odd at first that trees need to be proven without using the number of nodes, but i suppose it is important to prove items with their previous structure intact. The test seemed easily , except maybe the time constraint made it a little difficult to think clearly.The questions did not seem very difficult , but obviously without notes , in the beginning they seemed a little difficult , but as started to write the induction proof structure , the proof came together very nicely. Again maybe a little more time would've helped me to finish the last question.

Week 4 of CSC236

Finishing the first assignment wasn't so bad , except for the last question which was a bit confusing to start with ,but after doing some scratch work i managed to finish all of my assignment at 9:30 pm.

Recursion always gave me some problems when i was programming , but doing recursive problems on paper always cleared things up. Doing these Fibonacci type problems always helped me to solve other recursive problems and I also find that doing induction proofs with recursion is easier since there are always recursive terms left over that can be combined and simplified. Also the time complexity calculations seem to be a lot simpler then last year, perhaps because this will be the second time doing them.
Looking forward to the first term test which I absolutely cannot mess up, for me its important to get a good mark in the beginning of the course as it sets the tone for me for the rest of the courses duration.