Week One

Monday,
- - - -- - - Sept. 8/2008

I think that the first impression I had when I entered the class was “oooh… am I in CSC165 again?” Professor Danny, the other CS students, the unique marking scheme, and of course, mathematical induction; it is like nothing has changed. However, the small classroom and Professor Danny's up-to-date stylus helped me realize I am now in a different course.

I am a bit concerned about the large number of problem sets, but having partners for assignments is a relief. My biggest source of concern right now is the conflict I have between CSC236 and ARC213 On Friday’s. Soon, I will have to decide which course has a higher attendance priority. Since CSC236 has three lectures versus one lecture for ARC213 each week, I think that I would be missing Fridays' lectures for this term.

Wednesday,
- - - -- - - Sept. 10/2008

In this lecture we talked about the principle of simple induction. Our main example was to prove that every set of n elements has exactly 2^n subsets. I think we did a similar example in CSC165. The proof was clear but I still do not get why does the number of subsets containing the element x [(n+1) th element] equal the number of subsets that do not include x. I should have asked Professor Danny to clear this point. Well, I guess I should be more initiative next time.

Friday,
- - - -- - - Sept. 12/2008

Of course, I could not make it to class today. But the good news is that I have made my sister take ARC213 with me so that she can attend the lectures and take the notes for me!

I checked the pre-and-post lecture slides and I think they pretty much filled me with today's example about simple induction.