Schedule

Note: Projects and homework listed on Tuesdays are due Tuesday at 11pm; those listed on Thursdays are due Friday at 11pm.

	Date	Optional Reading	Topic	Video	Proj Due	HW Due
1	Jan 8	1.1-1.2	Introduction	introduction
2	Jan 10	2.1-2.2	Insertion Sort	correctness efficiency	project18
3	Jan 15	2.3	Merge Sort	merge sort
4	Jan 17	3.1-3.2	Asymptotic Notation Analysis Tools	Big Theta Big O, Big Omega monotonicity floor/ceiling modular arithmetic polynomials exponentials logarithms factorials and funct iteration	project34
5	Jan 22	4.1	Max Subarray	introduction description analysis		hw1
6	Jan 24	4.3	Substitution	introduction example 1 changing variables	project72	hw2 (due 1/25)
7	Jan 29	4.4-4.5	Recursion Trees Master Method	tree height description description		hw3
8	Jan 31	6.1-6.3	Heap Property Heapsort	introduction max-heapify building sorting		hw4
9	Feb 5	6.4-6.5	Priority Queues	priority queue	project157	hw5
10	Feb 7	7.1-7.3	Quicksort	quicksort analysis
11	Feb 12	8.1-8.4	Linear Sorting	comparison bound counting sort radix sort bucket sort	project164	hw6
12	Feb 14	10.1-10.4	Elementary Data Structures	Stacks and queues Linked Lists Trees	project171	hw7
13	Feb 19	11.1-11.2	Hash Tables I	Direct-address tables Hash tables
14	Feb 21	11.3-11.4	Hash Tables II	Hash functions Open addressing	project246
15	Feb 26		C++ Templates	Templates as operators
16	Feb 28		Midterm Exam			hw8
17	Mar 5	12.1-12.3	Binary Search Trees	Introduction Querying Insertion/deletion	project257
18	Mar 7	13.1-13.2	Red-black Trees	Introduction Rotations
19	Mar 12	15.1,15.3-15.4	Dynamic Programming	Motivation Rod cutting DNA sequence alignment Ingredients for DP	project307	hw9
20	Mar 14	16.1-16.3	Greedy	Activity selection Design Huffman codes	project363
22	Mar 26	18.1-18.2	B-Trees	Introduction Operations		hw10
23	Mar 28	17.1-17.3	Amortized Analysis	Aggregate Accounting Potential	project431
24	Apr 2	19.1-19.2	Fibonacci Heaps	Fibonacci intro Operations		hw11
25	Apr 4	21.1-21.3	Disjoint Sets	Introduction Linked lists Forests		hw12
26	Apr 9	22.1-22.3	Graphs I	Introduction Representation Breadth-first search BFS trees Depth-first search		hw13
27	Apr 11	22.4-22.5	Graphs II	Topological sort Strongly connected components	project565
28	Apr 16	23.1-23.2	Spanning Trees	Introduction Kruskal's algorithm Prim's algorithm		hw14
29	Apr 18	24.3,26.1	Paths Flow Networks	Dijkstra's algorithm Introduction	project595	hw15
30	Apr 23	34.1-34.5	NP-Completeness	Introduction
31	Apr 25		Review		project658	hw16
32	May 2		Final Exam @ 7:30am

The schedule is subject to change. The final is Thursday, May 2, 7:30 - 9:30am in our normal classroom. The final is comprehensive.