status 20110621

Finished reading Chapter 16 on greedy algorithms.  I can understand activity scheduling and the knapsack problems.  It's also very illuminating. But I got to admit relating them with dynamic programming and matroid theory is currently beyond me. 

My conclusion is this - for this chapter and chapter 15 on dynamic programming.  It's very important to understand how the problems are related.  Though I know how to implement the algorithms, without understanding them, it's hard to go beyond the superficial.  

For now, I will leave it to my another reread.

Browse reading: 450/1144
Exercises up to 4-1.3(finished the brute force implementation)

Needs write up: P2.1c, 3-2.4, 3-2.8, P3.1

Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3, P1-1, 4.1-5, 4.2-6, 4.2-7, 4.3-{1,2,4,5,6}, The whole Section 4.4, 4.5-1, 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-6, 10.1-7, 12.1-{1,2,4} 12.2-{2.3}, 12.4-4, P12.4(a), 15-1.1, 15.1-3, 15.3-3, 15.5, 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