Tutorials were supposed to start this week, but there was a change in the schedule so we don't have a quiz this week. I think that also means we will have only 8 quizzes this semester instead of 9. This week we learned Complete Induction. One of the examples that the professor did in class this week was with full binary trees. It's much different, and in a way more complicated I find, proving theories about programming concepts than mathematical concepts. With math it's easier to prove an equation by manipulating the equation, whereas with programming you have to grasp the idea of the programming concept and visualize it, such as in the case of trees.
I'm happy to see proofs about programming concepts, since I did take Computer Science to learn how to program, because it better helps me understand the concepts themselves and I can find an extra use of and benefit from this course.
Back to Complete Induction, although the structure of the theory is quiet different from Mathematical Induction, I think they are actually quiet similar, especially when it comes to proving mathematical equations through algebraic manipulation.
No comments:
Post a Comment