two more classes?

YEAH!!December is coming!!Christmas is coming!!
 BUT!!!All the finals are coming too. :(


 I think we still have two more classes to go. A3 is due this Friday. I'm working on it.
 BTW i found a previous 236 students blog accidentally. It's pretty interesting reading it. It seems like we r doing almost the same thing in 2008.

 Here's the link.
 http://nm236.blogspot.ca/2008/12/weekthirteen.html good luck on finals!!!

Pics in today's lecture

The last five minutes of today's lecture was kind of confusing. The first pic is the one Sasha corrected Prof Heap. The second pic is the one Prof gave us at first. We need to figure it out ourselves.

Oops..Forget the SLOG thing in several weeks

It has been a really really busy month.None of the courses i'm taking is a easy course. Each week i had quizzes and assignments due.But it's almost done.Yeah!! One more month to go.
 My last post was talking about merge sort.Then we learned divide and conquer and using the Master Theorem which were in the second midterm. And i think i didn't do well on the midterm. There was only two questions, but every question takes a lot of work to complete. I need to do more practice questions to improve my speed.
 Then it's the binary search with the pre-condition,loop invariant and post-condition. Moreover, we learned the proof of correctness of MergeSort(A,b,e) by induction on n=e-b+1 for all arrays of size n and (pre-condiction+execution)->(termination+post-condition).

merge sort review

merge sort review http://en.wikipedia.org/wiki/Merge_sort "

In sorting n objects, merge sort has an average and worst-case performance of O(n log n). If the running time of merge sort for a list of length n is T(n), then the recurrence T(n) = 2T(n/2) + n follows from the definition of the algorithm (apply the algorithm to two lists of half the size of the original list, and add the n steps taken to merge the resulting two lists). The closed form follows from the master theorem. In the worst case, the number of comparisons merge sort makes is equal to or slightly smaller than (n ⌈lg n⌉ - 2⌈lg n⌉ + 1), which is between (n lg n - n + 1) and (n lg n + n + O(lg n)).[3]For large n and a randomly ordered input list, merge sort's expected (average) number of comparisons approaches α·n fewer than the worst case where"

 3 assignments due next week.. year 2 is much intenser compare to year 1.

After mid term

I know it's two days after the mid term, but i still feeling bad being not familiar how to do the third question during the test. I didn't do much practice on well-ordering and structure induction, so when i saw the third question i was kind of panic.I hope i got the first two question completely right which can give me at least 10 out of 15. Structure induction is much hard than the other methods of proof i think.Maybe i need to spend more time on it before it's too late.

 BTW just finished csc207 A1, feeling good.But i have 2 quiz and 4 tests next week.It's suck when u have all the stuff coming at the same time.Good luck to myself.

A1 ing~

I got a 236 quiz on Monday, a mat223 quiz on Tuesday and a csc207 quiz on Wednesday. So I just started A1 this morning.For question #1, i find out we might use the summation notations. I googled it. It's kind of review of high school math. There are some formulas i feel they might be useful in the future. Here is the link. http://en.wikipedia.org/wiki/Summation

236

hello world!