Schedule for weeks 1 through 16

Wk	Day	Date	Topic	Resources	Events

1	Wed	Sep 02	Introduction to the Course Algorithms and Problem Solving	HW 1 Project 1 Data Structures Visualization Applet

	Fri	Sep 04	Basic Data Structures	IDAA 1.1-1.4 Data Structures Notes Data Structures Examples

2	Mon	Sep 07	Graphs	Graphs and Trees Notes	HW 1 due

	Wed	Sep 09	Graphs Trees	Graphs and Trees Notes	HW 2 due

	Fri	Sep 11	Combinatorics Subsets Permutations	IDAA 5.4 Induction Notes Project 2	Project 1 due

3	Mon	Sep 14	Analysis of Algorithms Growth Rates Summations		Worksheet 0

	Wed	Sep 16	Analysis of Algorithms Asymptotic Notation	IDAA 2.1-2.3 Algorithm Analysis Notes Asymptotic Notation Notes Asymptotic Notation Examples	HW 3 due

	Fri	Sep 18	Analysis of Algorithms Asymptotic Notation		Worksheet 1

4	Mon	Sep 21	Algorithm Analysis		HW 4 due Worksheet 1

	Wed	Sep 23	Analysis of Recursive Algorithms Recurrence Relations Forward Substitution Backward Substitution Recurrence Trees	IDAA 2.4-2.6 IDAA Appendix B Algorithms and Recurrences Examples Recurrence Relations Notes

	Fri	Sep 25	Master Theorem Recursion Trees	IDAA Appendix B Solving Recurrence Relations Examples	HW 5 due Worksheet 2

5	Mon	Sep 28	Wrap up Recurrences		Project 2 due

	Wed	Sep 30	Brute Force: Sorting (Selection and Bubble) Searching (Sequential) Convex Hull, Closest Pair	IDAA 3.1-3.3 Basic Sorting Notes	HW 6 due

	Fri	Oct 02	Exhaustive Search	IDAA 3.4

6	Mon	Oct 05	Brute Force Algorithms		HW 7 due Worksheet 3

	Wed	Oct 07	CIS		No Class

	Fri	Oct 09	Divide-and-Conquer: Sorting (Quick and Merge) Searching (Binary) Binary Tree Traversal	IDAA 4.1-4.4 Binary Search Analysis Mergesort Notes Quicksort Notes Sorting Worst Case	Project 3 plan due

7	Mon	Oct 12	Divide and Conquer		HW 8 due Worksheet 4

	Wed	Oct 14	Divide-and-Conquer: Strassen's Algorithm Convex Hull Closest Pair	IDAA 4.5-4.6 Strassen's Algorithm Notes Quickhull Applet	HW 9 due

	Fri	Oct 16	Decrease-and-Conquer: Sorting (Insertion) Searching (BFS) Searching (DFS) Sorting (Topological)	IDAA 5.1-5.3 BFS and DFS Notes

8	Mon	Oct 19	Fall Break		No Class

	Wed	Oct 21	Review		Project 3 due

	Fri	Oct 23	Everything (IDAA 1-4)	Pencil Brainz	Midterm Exam

9	Mon	Oct 26	Decrease-and-Conquer: Constant Factor Variable Size	IDAA 5.5-5.6	HW 10 due

	Wed	Oct 28	Decrease-and-Conquer		Project 4a due Worksheet 5

	Fri	Oct 30	Transform-and-Conquer: Sorting (pre sorting) Gaussian Elimination	IDAA 6.1-6.3 Gaussian Elimination Applet Gaussian Elimination Applet #2

10	Mon	Nov 02	Transform-and-Conquer: Searching (Balanced Trees) Heaps and Heapsort Horner's Rule Binary Exponentiation Reductions	IDAA 6.4-6.6 Heapsort Notes Heapsort Applet Search Tree Applet Data Structure Visualization Applet Some Cool Problems	Project 4b due

	Wed	Nov 04	Transform-and-Conquer Dynamic Programming: Warshall's Algorithm Floyd's Algorithm	IDAA 8.1-8.2 Read Warshall's Algorithm Notes Floyd's Algorithm Animation

	Fri	Nov 06	Dynamic Programming: Matrix Chain Multiplication Knapsack Problem	Read Dynamic Programming Notes IDAA 8.4	HW 11 due

11	Mon	Nov 09	Dynamic Programming Graph Pebbling	Read Graph Pebbling Read Class 0

	Wed	Nov 11	Graph Pebbling	Read Pebbling Handout Pebbling Algorithms in Diameter Two Graphs (optional reading) Graph 1 Graph 2 Graph 3 Graph 4 Graph 5	HW 12 due

	Fri	Nov 13	Human Computing	Human Computation Talk (video) Designing Games With a Purpose (paper)	Project 5 due

12	Mon	Nov 16	Space-Time Tradeoffs: Counting Sort Radix Sort Hashing	IDAA 7.1, 7.3 Radix Sort Notes Hashing Notes

	Wed	Nov 18	Space and Time Tradeoffs: B-Trees	IDAA 7.4	HW 13 due

	Fri	Nov 20	Space/Time Tradeoffs Dynamic Programming		Worksheet 6

13	Mon	Nov 23	Greedy Technique: Fractional Knapsack Huffman Encoding	IDAA 9.4 Greedy Algorithms Notes	HW 14 due

	Wed	Nov 25	Greedy Technique: Prim's Algorithm: Kruskal's Algorithm	IDAA 9.1-9.2 Minimum Spanning Trees Notes Spanning Tree Animations	Project 6 due

	Fri	Nov 27	Thanksgiving Break		No Class

14	Mon	Nov 30	Greedy Technique		Worksheet 7

	Wed	Dec 02	P and NP	IDAA 11.3 P, NP, NP-Complete Notes Halting Problem Notes Read NP Complete Notes Reduction Examples	HW 15 due

	Fri	Dec 04	NP-Complete	IDAA 11.3

15	Mon	Dec 07	P, NP, NPC		Worksheet 8

	Wed	Dec 09	Quantum Computing	An Introduction to Quantum Computing (Pages 1-17) Quantum Computing Notes

	Fri	Dec 11	Review for final		Project 7 due

Ex	Tue	Dec 15	Final Exam 12:30pm		Final Exam