Time passed so quickly that csc165 is almost come to the end. At the beginning of the course, i thought i would not do well since i was not good at logic. And i also wonder that why we need to write blog each week. However, at this time, my thought totally changes, the blogs not only force me to follow up the lecture material but also help me to review on topics that are important in the final exam. There are some of the parts in the blogs that i want to improve. I think i can write more on my own thought about the course throughout the three months. Therefore, the blogs can keep track of my own feelings , which is what blogs usually do.
I like what Ji Yong Choi has mention about the course " I learned a lot of new information that I can use in my future studies."
(http://165choi.blogspot.ca)
CSC165 serves as a milestone of my CS journey and i really enjoy take such a course.
Good Luck everyone with the final exam and hope to see all of you in CSC236!!
Wednesday, 3 December 2014
Induction--Week 12
This week we learn a proof technique called induction. Induction basically is used to prove something (ex: p(n) ) is true for natural number n. The idea of induction is similar to dominoes. In order to show that all the dominoes fall, we have 2 steps to do. First, we need to show that the first domino falls, and second, we assume the n-th domino fall and we can come to the result that the (n+1)th domino also falls. At first, it may be hard to understand, but students can think through the ideas of dominoes and find that the dominoes affect makes sense and it helps to understand the induction proof. I have read through some of the blogs written by the classmates and pretty agree with what they have said about the induction proof . For instance, Faye has mention the class example of how to induction work.
(http://165slog.blogspot.ca/2014/12/week-12.html)
ex: In order to prove p(n) is true for all natural number .
1. base case: p(0) is True
2.inductive step: assume p(n) is true and p(n+1) is also True
(http://165slog.blogspot.ca/2014/12/week-12.html)
ex: In order to prove p(n) is true for all natural number .
1. base case: p(0) is True
2.inductive step: assume p(n) is true and p(n+1) is also True
That is the way how we prove p(n) is True for all natural number.
Subscribe to:
Posts (Atom)