Schedule for weeks 1 through 16

Wk	Day	Date	Topic	Resources	Events

1	Mon	Aug 26	No class yet. Duh.

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

	Fri	Aug 30	Proofs	AIDMA 2.1-2.3 xkcd: Proofs

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

	Wed	Sep 04	Programming Fundamentals Algorithms	AIDMA 3.1-3.6

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

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

	Wed	Sep 11	Sets	AIDMA 5.1-5.2

	Fri	Sep 13	Functions Partitions Equivalence Relations	AIDMA 5.3-5.4 Attempt these exercises: 5.7, 5.9, 5.13, 5.14, 5.15abde	HW 4 due No class due to inauguration

4	Mon	Sep 16	Sequences	AIDMA 6.1

	Wed	Sep 18	Summations Products	AIDMA 6.2	HW 5 due

	Fri	Sep 20	Asymptotic Notation	AIDMA 7.1

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

	Wed	Sep 25	Algorithm Analysis

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

6	Mon	Sep 30	Recursion Solving Recurrence Relations	AIDMA 8.2-8.3.3	HW 8 due

	Wed	Oct 02	Analysing Recursive Algorithms	AIDMA 8.3.4-8.4

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

7	Mon	Oct 07	No Class		Fall Recess

	Wed	Oct 09	Catch up/review

	Fri	Oct 11	AIDMA 1-8		Midterm Exam

8	Mon	Oct 14	Permutations Combinations	AIDMA 9.3

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

	Fri	Oct 18	Graphs	AIDMA 10	HW 11 due

9	Mon	Oct 21	Algorithms	Algorithms Chapter 0 (Link to reading questions)

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

	Fri	Oct 25	Primality Testing	Algorithms 1.3

10	Mon	Oct 28	Cryptography	Algorithms 1.4 Intro to Cryptography notes

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

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

11	Mon	Nov 04	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 06	Connected Components	Algorithms 3.3-3.4 Topological Sort Demo (DFS) Topological Sort Demo (indegree)	HW 14 due

	Fri	Nov 08	Women in STEM		Field Trip! Go to the talk in Graves Hall instead of coming to class (Required!)

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

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

	Fri	Nov 15	More Shortest Paths	Algorithms 4.6-4.7 Bellman-Ford Demo

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

	Wed	Nov 20	Greedy Algorithms Huffman Encoding	Algorithms 5.2 Greedy Algorithms Notes	HW 16 due

	Fri	Nov 22	Dynamic Programming Edit Distance	Algorithms 6.1-6.3

14	Mon	Nov 25	Dynamic Programming Chain Matrix Multiplication	Algorithms 6.5 (Note: out of order!) Dynamic Programming Notes (esp. Pages 19-29)

	Wed	Nov 27	Bolschitz Algorithm		HW 17 due

	Fri	Nov 29	No Class		Thanksgiving Break

15	Mon	Dec 02	Dynamic Programming Knapsack	Algorithms 6.4

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

	Fri	Dec 06	Review

Ex	Tue	Dec 10	Everything		Final Exam 12:30-2:30 pm