Schedule for weeks 1 through 16

Wk	Day	Date	Topic	Resources	Events

1	Mon	Aug 27	No class yet. Duh.

	Wed	Aug 29	Introduction	AIDMA "How To" AIDMA Ch 1

	Fri	Aug 31	Proofs	AIDMA 2.1-2.3 xkcd: Proofs

2	Mon	Sep 03	Proofs	AIDMA 2.4-2.8	HW 1 due

	Wed	Sep 05	Programming Fundamentals Algorithms	AIDMA 3.1-3.6

	Fri	Sep 07	Propositional Logic	AIDMA 4.1-4.2	HW 2 due

3	Mon	Sep 10	Predicates Quantifiers Normal Forms Bitwise Operations	AIDMA 4.3-4.5	HW 3 due

	Wed	Sep 12	Sets	AIDMA 5.1-5.2

	Fri	Sep 14	Functions Partitions Equivalence Relations	AIDMA 5.3-5.4	HW 4 due

4	Mon	Sep 17	Sequences	AIDMA 6.1

	Wed	Sep 19	Summations Products	AIDMA 6.2	HW 5 due

	Fri	Sep 21	Asymptotic Notation	AIDMA 7.1

5	Mon	Sep 24	Growth Rates Algorithm Analysis	AIDMA 7.2-7.3	HW 6 due

	Wed	Sep 26	Algorithm Analysis

	Fri	Sep 28	Mathematical Induction	AIDMA 8.1 XKCD Induction	HW 7 due

6	Mon	Oct 01	Recursion Solving Recurrence Relations	AIDMA 8.2-8.3.3	HW 8 due

	Wed	Oct 03	Analysing Recursive Algorithms	AIDMA 8.3.4-8.4

	Fri	Oct 05	Basic Counting	AIDMA 9.1-9.2	HW 9 due

7	Mon	Oct 08	No Class		Fall Recess

	Wed	Oct 10	Catch up/review

	Fri	Oct 12	AIDMA 1-8		Midterm Exam

8	Mon	Oct 15	Permutations Combinations	AIDMA 9.3

	Wed	Oct 17	Binomial Theorem Inclusion-Exclusion	AIDMA 9.4-9.5	HW 10 due

	Fri	Oct 19	Graphs	AIDMA 10	HW 11 due

9	Mon	Oct 22	Algorithms	Algorithms Chapter 0 See/answer Reading Questions

	Wed	Oct 24	Algorithms with Numbers	Algorithms 1.1-1.2	HW 12 due

	Fri	Oct 26	Primality Testing	Algorithms 1.3

10	Mon	Oct 29	Cryptography	Algorithms 1.4

	Wed	Oct 31	Divide-and-conquer	Algorithms 2.1-2.3 Sorting Worst Case Merge Sort Notes	HW 13 due

	Fri	Nov 02	Divide-and-conquer	Algorithms 2.4-2.5 Strassen's Algorithm Slides Quicksort Notes

11	Mon	Nov 05	Graphs Depth-First Search	Algorithms 3.1-3.2 BFS and DFS Notes (pages 9-20 are DFS) Data Structure Visualizations DFS Demo

	Wed	Nov 07	Connected Components	Algorithms 3.3-3.4 Topological Sort Demo (DFS) Topological Sort Demo (indegree)	HW 14 due

	Fri	Nov 09	Breadth-First Search Shortest Paths	Algorithms 4.1-4.3 BFS and DFS Notes (pages 1-8 are BFS) BFS Demo

12	Mon	Nov 12	Dijkstra's Algorithm Priority Queues	Algorithms 4.4-4.5 Heapsort Notes Dijkstra's Algorithm Demo Algoraph	HW 15 due

	Wed	Nov 14	More Shortest Paths	Algorithms 4.6-4.7 Bellman-Ford Demo

	Fri	Nov 16	2-SAT Algorithm

13	Mon	Nov 19	Greedy Algorithms Minimum Spanning Trees	Algorithms 5.1 MST Notes

	Wed	Nov 21	Bolschitz Algorithm		HW 16 due (No late!)

	Fri	Nov 23	No Class		Thanksgiving Break

14	Mon	Nov 26	Greedy Algorithms Huffman Encoding	Algorithms 5.2 Greedy Algorithms Notes

	Wed	Nov 28	Dynamic Programming Edit Distance	Algorithms 6.1-6.3

	Fri	Nov 30	Dynamic Programming Chain Matrix Multiplication	Algorithms 6.5 (Note: out of order!) Dynamic Programming Notes (esp. Pages 19-29)	HW 17 due

15	Mon	Dec 03	Dynamic Programming Knapsack	Algorithms 6.4

	Wed	Dec 05	Quantum Computing	Quantum Computing Notes Quantum Computation Introduction (A little more in depth)

	Fri	Dec 07	Review

Ex	Mon	Dec 10	Everything		Final Exam 3-5 pm