CS3110 Lecture Readings

Introduction to Algorithms by

Cormen, Leiserson, Rivest, Stein

 

Lecture Topic Reading
1
 Introduction to the analysis of algorithms Chap 1,2
2
 Asymptotic Analysis Chap 3, 7.1-7.2, 28.2
3
 Recurrence Relations Sect 4.1-4.3
4
 Randomized Algorithms Sect 5.1-5.3, 7.3-7.4
5
 Order Statistics Chap 9
6
 Heap Sort, priority queues, dynamic sets Chap 6
7
 Sorting in linear time Chap 8
8
 Data Structures: Hashing Chap 11, excluding 11.5
9
 Data Structures: Binary Search trees Chap 12, excluding 12.4
10
 Data Structures: Red-Black trees Chap 13
11
 Augmented Data Structures Chap 14
12
 Dynamic Programming Chap 15
13
 Greedy Algorithms  Chap 16.1-16.3
14
 Basic Graph Algorithms Chap 22.1-22.4
15
 Graph Algorithms: Spanning trees Chap 23
16
 Structural Complexity Chap 34