CMSC 441 Design & Analysis of Algorithms, Section 01, Class Schedule
		In-class lecture topics	Asynchronous lecture topics	Textbook Reading	HW Assigned	HW Due
	Thu Aug 27	Introduction, Asymptotic notation	Math review, Strassen's algorithm	1.1-3.2, A.1-A.2
	Tue Sep 01	Recurrence relations, Substitution, Iteration	More iteration & substitution examples	4.1-4.2	HW1
	Thu Sep 03	Master Theorem	More Master Theorem examples	4.3-4.4
	Tue Sep 08	Heapsort	Heapsort lower bound	6.1-6.5	HW2	HW1
	Thu Sep 10	Quicksort	Quicksort proof & alternate proof	7.1-7.4
	Tue Sep 15	Lower bounds on sorting	Counting sort, Radix sort	8.1-8.4	HW3	HW2
	Thu Sep 17	Linear-time Select	Randomized Select	9.1-9.3
	Tue Sep 22	Greedy: Activity Selection	detailed proof	16.1-16.2	HW4	HW3
	Thu Sep 24	Quiz 1: recurrence relations	Huffman codes	16.3
	Tue Sep 29	Greedy: shoemaker & elves	Coin changing		HW5	HW4
	Thu Oct 01	Quiz 2: divide & conquer	Fractional Knapsack
	Tue Oct 06	Dynamic Programming: knapsack	Matrix multiplication	15.1	HW6	HW5
	Thu Oct 08	Make-up Quiz A	Rod Cutting	15.2-15.3
	Tue Oct 13	DP: longest common subsequence	Optimum binary search trees	15.4-15.5	HW7	HW6
	Thu Oct 15	Quiz 3: greedy
	Tue Oct 20	Graphs Intro	BFS Intro, BFS proof	22.1-22.2	HW Break	HW7
	Thu Oct 22	Make-up Quiz B	DFS intro, White Path theorem, Topological Sort	22.3
	Tue Oct 27	Strongly-connected components	SCC Proof	22.4-22.5	HW8
	Thu Oct 29	Quiz 4: dynamic programming		21.1-21.3
	Tue Nov 03	MST Intro, Prim's Algorithm	Disjoint Set Union, Kruskal's	23.1-23.2	HW9	HW8
	Thu Nov 05	Make-up Quiz C
	Tue Nov 10	Shortest paths: Dijkstra (with proof)		24.3	HW10	HW9
	Thu Nov 12	Make-up Quiz D	Shortest paths in DAGS, Floyd-Warshall	24.2, 25.2
	Tue Nov 17	Shortest paths: Bellman Ford	Bellman-Ford proof, Arbitrage	24.1	HW11	HW10
	Thu Nov 19	Quiz 5: graphs 1
	Tue Nov 24	Network flow	Max Flow Min Cut Theorem	26.1-26.3	HW Break	HW11
	Thu Nov 26	Thanksgiving Break
	Tue Dec 01	Network flow applications	Edmonds-Karp		HW12
	Thu Dec 03	Quiz 6: graphs 2	More network flow applications
	Tue Dec 08	NP-completeness	NP-completeness examples	34.1-34.5		HW12
	Thu Dec 10	10:30am Make-up Quiz E, 11:30am Make-up Quiz F (Final Exam time slot)
							xxx