Date 

Class 

Chapter 

Topic 

T 1/16 

1 

1 

introduction 

Th 1/18 

2 

2 

data structures  

T 1/23 

3 

3

analysis of sequential algorithms 
Opening Convocation

Th 1/25 

4 

3 

complexity 

T 1/30 

5 

tools for analysis 

Th 2/1 

6 

4 

sequential sorting 

T 2/6 

7 

4 

sequential sorting 

Th 2/8 

8 

5 

parallel architectures 

T 2/13 

9 

5 

parallel searching 

Th 2/15 

10 

6 

parallel sorting: PRAMs  

T 2/20  

11 

6 

parallel sorting: interconnection networks 

T 2/27 

13 

8

graphs: BFS, DFS 

Th 3/1 

14 

8 

graphs: toplogical sort, shortest path 

T 3/6 

15 

8 

graphs: disjoint sets 

Th 3/8 

16 

12 

greedy methods: knapsack, Huffman codes  

T 3/13 

17 

12 

greedy methods: MST, Kruskal, Prim  

T 3/27 

18 

12 

greedy methods: Dijkstra 

Th 3/29 

19 

12 

parallel greedy methods 

T 4/3 

20 

13 

divide and conquer: kth smallest 

Th 4/5 

21 

13 

divide and conquer: matrix multiplication 

Th 4/12 

23 

14 

dynamic programming: optimal binary search trees

T 4/17 

24 

14 

dynamic programming: all pairs shortest path, tsp 

Th 4/19 

25 

15 

backtracking 

T 4/24  

26 

15 

branch and bound 

Th 4/26 

27 

16 

heuristic search: A*,game trees 

T 5/1 

28 

20 

np-complete problems