Status 20110906(a)

Finished Chapter 23 and 24.  Finished in my head: 23.1-1,23.1-3. Consciously decided to skip Chapter 19 and 20 Move my reading pointers for 185 pages.  Now at Chapter 25.

Browse reading: 685/1144

Exercises up to 4-4.5

Revisit : 4.2-{3-5}, 4-3.6, 4-4.3 after section 4.5

Checking up to P2.1

Needs write up: 2-3.7 (nice solution using merging), P2.1c, 3-2.4, 3-2.8, P3.1

Exercises checked: 2.1-2, 2.1-3, 2.2-{1,4}, 2.3-{3,7}

Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3, P1-1, The whole Section 4.4 except 4.4-3, 4.5-{1,3}, P4.4(a-c), P4.6b, 5.1-{1,2}, whole Section 6.1, 6.2-{1,2,4,5,6}, 6.3-1, whole Section 7.1, 7.2-{1-3}, whole Section 7.3 and 7.4.3, 10.1-{1-4,6,7}, 10.2-{1,2,6,7}, 12.1-{1,2,3,4} 12.2-{1,2,3,6}, 12.4-4, P12.4(a), 15-1.1, 15.1-3, 15.3-3, 15.5, 17-1.1, 21-1.1, 21-1.2, 22-1.{1-3,7}, 23.1-1 and 23.1-3, A.1-{1,2,3,4,5,7}, C.1-{2,4,5,7,8,9,14}, C.2-{1,2,4,5}, C.3-{1,2,10}, all in D.1. and D.2-2. 

Chapter 23 and Chapter 24

Browsed read both Chapter 23, Minimum Spanning Tree, and Chapter 24, shortest path.  If you don't know, you would think that minimum spanning tree is a tougher problem.  In fact, due the structure of the problem, you can claim it is easier.

The graph chapters seems to be more familiar to me.  I guess that's because I have always working with graphs anyway.

I got to admit though, after the advanced data structure chapters, the book is more like seminar book rather than a text book.   There are multiple topics which are suitable to use in a graduate courses rather than in an undergraduate course.   That makes the original MIT courseware amazing because most of the students are probably in their 20s or even teens when they go through those courses.  From guys of MIT, I heard that it is a very tough course even in MIT.   Though I would say the worst students will probably be some programmers.