Class participation grades will be based on presentation of homework problems.
Homework Assignments will be assigned on the Thursday every 2 weeks and are due on the Thursday 2 weeks later at 2359 hours in hardcopy AND in Laulima. The homework assignments must be typeset in LaTeX with the homework number and your name displayed clearly on the front page. Please use one of the algorithms latex package (see wikibook) to typeset pseudocode (algorithmic.sty is recommended).
Week  Date  Topic  Readings  Videos  Exercises 

1  Tue Aug 25  Course Organization  Ch 1. 
Asymptotics 
Problem 23. 
1  Thu Aug 27  Sorting  Ch 24 
SelectionSort InsertionSort MergeSort Reccurences 
Problem 22. Problem 24. hw01 (pdf). (tex). 
2  Tue Sep 1  No class  
2  Thu Sep 3  No class  
3  Tue Sep 8  Sorting  Ch 6 
Heaps Heapsort 
Problem 63. 
3  Thu Sep 10  Sorting  Ch 7 
Quicksort Worst Case Analysis Average Case Analysis 
Problems 75. Problem 76. 
4  Tue Sep 15  Sorting  Ch 8 
Lower Bounds Counting Sort Radix Sort Bucket Sort 
Problem 83. 
4  Thu Sep 17  Order Statistics & Binary Search Trees  Ch 9,12 
Order Stats 1 Min Max Order Stats 2 Median of Medians Order Stats 3 Quicksort Binary Search Trees 
Problem 91. Problem 123. hw02 (pdf). (tex). 
5  Tue Sep 22  Redblack Trees & Interval Trees  Ch 13,14 
Red Black Trees Order Statistics Red Black Trees Interval Trees 
Problem 142. 
5  Thu Sep 24  Amortized Analysis  Ch 17 
Amortized A.  Agg. Mtd Amortized A.  Binary Cnt. Eg. Amortized A.  Acc. Mtd Amortized A.  Pot. Mtd Amortized A.  Dyn. Tables 
Problem 171. 
6  Tue Sep 29  Amortized Analysis  Ch 17  Problem 172.  
6  Thu Oct 1  Binomial Heaps  Ch 19 in 2nd ed (pdf) 
Binomial Heaps 1 Binomial Heaps 2 Binomial Heaps 3 
Notes (pdf). Problem (2e) 191. 
7  Tue Oct 6  Fibonacci Heaps  Ch 19 
Fibonacci Heaps 1 Fibonacci Heaps 2 Fibonacci Heaps 3 Fibonacci Heaps 4 Fibonacci Heaps 5 
Problem 191. 
7  Thu Oct 8  Fibonacci Heaps  Ch 19  Problem 193.  
8  Tue Oct 13  B Trees, B+ Trees, Parallel Disk Model  Ch 18, Vitter's IO Book (pdf) Ch. 1,2.  External Sorting  
8  Thu Oct 15  Midterm Exam  
9  Tue Oct 20  Post Midterm Debrief  Project Proposals due!  
9  Thu Oct 22  Dynamic Programming  Ch 15 
Dynamic Programming 1 Dynamic Programming 2 Dynamic Programming 3 
Problem 152 
10  Tue Oct 27  Proposal Presentation  
10  Thu Oct 29  Greedy Algorithms  Ch 16 
Greedy Algo 1 Greedy Algo 2 Greedy Algo 3 
Problem 161. hw03 (pdf).(tex). 
11  Tue Nov 3  Hashing  Ch 11 
Hashing 1 Hashing 2 Hashing 3 Hashing 4 Hashing 5 
Problem 111. 
11  Thu Nov 5  Graph Algo:BFS,DFS,SCC,MST  Ch 2223 
BFS DFS SCC MST 
Problem 222. 
12  Tue Nov 10  Graph Algo:SSSP,APSP  Ch 2425 
Bellman Ford Dijkstra Constraints All Pairs Shortest Path Floyd Warshall Johnson 
Problem 222. 
12  Thu Nov 12  NPCompleteness  Ch 34 
Decision Problems Encoding Languages NP NPC 

13  Tue Nov 17  NPCompleteness  Ch 34 
DTM NTM SAT to 3SAT 
Cook's Theorem. 
13  Thu Nov 19  NPCompleteness  Ch 34 
SAT to 3SAT proof 3SAT to VC 3SAT to VC Proof 

14  Tue Nov 24  NPCompleteness  Ch 34  Problem 342.  
14  Thu Nov 26  Thanksgiving Holiday  
15  Tue Dec 1  Guest Lecture by Nodari  
15  Thu Dec 3  Approximation Algo  Ch 35 
Approx Algo VC Approx Algo 3SAT 
Problem 351 
16  Tue Dec 8  Project Presentations  
16  Thu Dec 10  Project Presentations 