Week 3

Tutorials started this week, and with the first quiz out of the way, we're moving on to well-ordering. I found the quiz easy, and I like that we take the time to go over the tutorial problems and answer questions before we right the quiz.

I missed parts of lecture this week because I showed up late to class, so I don't fully understand well-ordering. The theory seems simple but I have not practiced any problems with well-ordering myself, so I will be sure to do that next week. We also did more examples with mathematical induction this week.

What I find interesting is that many problems, including some on the assignment, can be solved using either complete induction or mathematical induction, or even some other form of induction according to the professor. At first I thought each theory only worked for certain types of problems, but in the end they are all following the same basic concept (induction) with a different approach and equation.

I'm also happy about the fact that all of the formulas we learned so far are not hard at all to remember. I find it helpful to understand what the formula actually means or is trying to prove as a way of remembering it.

Week 2

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. 

Introductory Week

I was going into CSC236, feeling skeptical about how well I would do in this course and how much I would enjoy all of the rigorous proofs where great portions of the proof seem redundant. But after the first lecture and taking a look at the course outline and marking scheme, I have a good feeling about this course.

The first concept we learned this week was Simple Induction (aka Mathematical Induction), and it holds true to its name because it is simple. I must admit I like algebra, so a lot of the proofs we do with Mathematical Induction I actually find enjoyable. I never though I'd say this about any kind of proofs. I'm actually looking forward to next week's tutorial and quiz, and it doesn't hurt that we don't have lecture on Wednesday.