Week 2 of CSC236

Now onto the second week. Breathing a sigh of relief after finishing the first problem set. But another problem set awaited me after my long journey home. Hopefully it won't be harder than PS 1. To me it was the perfect difficulty for a problem set as it reinforced the material covered during the previous week. Week 2 material seemed a tad weird in the beginning. But after the second lecture of week 2 I really liked the complete induction proofs , they are more or less the same as simple induction , especially the antecedent that's used for both. The consequent part is quite simple , especially if I can make a connection between the current n case to any of the previously assumed cases. The only question that gave me some trouble was the full binary tree example. Most likely because I was late for class , but during the actual proof I could see how using each embedded tree in the left and right node trees can create odd number of nodes.

The stamp problem was nothing new since we did it in CSC165 last year. But using strong induction it seemed a lot easier, the only part that gave me trouble was why we had to start induction after the 11 cent postage , but after attempting problem set 2 and reading the book it became very clear. The book although good for examples , to me doesn't compare to the lectures , because to me it's a lot easier to understand Prof. Heap explain the different cases , and why the base cases are 12 for example in the postage problem.
For the new problem set and assignment i really need to push myself to start early since I'm already swamped with assignments and already a bit behind. Hopefully my assignment proofs will be adequate.

I'll be adding random and weird pictures sometimes to keep you entertained. Hope you enjoy them!