Date: September 17, 2008
Today's lecture covers FBT (Full Binary Tree) and Complete induction. I find that I needed to catch up again with the basic properties of a Full Binary Tree, as I'm not good with this type of question back in CSC165.
Besides the trees, we also did a quite interesting problem with the chocolate bar (that makes me hungry by the way). The problem states: Every chocolate grid of n squares can be broken into seperate squares with n - 1 breaks.
As usual, we have our time to write out our own ideas about this question, which I think I did pretty good on that.
Now, the real challenge for me is to keep this up for every question I've encountered...
Subscribe to:
Post Comments (Atom)
1 comment:
A good exercise is to try to write a better proof than the text, or the guy at the front of the room.
Post a Comment