Chapter 1: Analyzing Algorithms
Sections 1.4, 1.5, 1.6 (Read section 1.3 - review of mathematical background)[Baase]
(McConnell: sections 1.1-1.6)
Chapter 4: Sorting
Sections 4.1-4.9 [Baase]
(McConnell: 3.1, 3.2, 4.1, 4.6, 4.7, 4.5)
Chapter 3: Recurrence Equations and Recursion Trees
Sections 3.6, 3.7 [Baase]
(McConnell: 2.1, 2.2, 2.6)
Chapter 5: Selection
Sections 5.1, 5.2, 5.4 [Baase]
(McConnell: 3.3)
Chapter 7: Graphs and Graph Traversals
Sections 7.1-7.4 [Baase]
(McConnell: 8.1-8.3)
Chapter 8: Minimum Spanning Trees
Section 8.1-8.4 [Baase]
(McConnell: 8.4-8.6)
Chapter 11: String Matching
Sections 11.1-11.5 [Baase]
(McConnell: 7.1-7.2)
Chapter 13: NP-Completeness
Sections 13.1-13.5, 13.8 [Baase]
(McConnell: 10.5-10.8)
Chapter 14: Parallel Algorithms
(McConnell: 9.1-9.3)