Schedule for weeks 1 through 17

Wk	Day	Date	Topic	Resources	Events

1	Tue	Jan 10	Introduction to the Course

	Thu	Jan 12	Algorithms and Problem Solving	IDAA 1.1-1.3

	Fri	Jan 13	Arrays Stacks Queues Linked Lists	IDAA 1.4 Data Structures Notes Data Structures Examples	HW 1 due

2	Tue	Jan 17	Graphs	Graphs and Trees Notes

	Thu	Jan 19	Graphs Trees	Graphs and Trees Notes	HW 2 due

	Fri	Jan 20	Trees	Graphs and Trees Notes	Project 1 Due

3	Tue	Jan 24	Analysis of Algorithms Complexity Classes Complexity of Algorithms	IDAA 2.1-2.3 Algorithm Analysis Notes Asymptotic Notation Notes

	Thu	Jan 26	Analysis of Algorithms Complexity Classes Complexity of Algorithms	Asymptotic Notation Examples	HW 3 due

	Fri	Jan 27	Algorithm Analysis		Worksheet 1

4	Tue	Jan 31	Analysis of Recursive Algorithms Recurrence Relations	IDAA 2.4-2.5 IDAA Appendix B Algorithms and Recurrences Examples Recurrence Relations Notes	HW 4 due

	Thu	Feb 02	Solving Recurrence Relations	IDAA Appendix B Solving Recurrence Relations Examples	Worksheet 1.5 (Not graded)

	Fri	Feb 03	Brute Force: Sorting (Selection and Bubble) Searching (Sequential)	IDAA 3.1-3.2	Project 2 Due

5	Tue	Feb 07	Brute Force: Convex Hull, Closest Pair Exhaustive Search	IDAA 3.3-3.4	HW 5 due

	Thu	Feb 09	Recurrences and Analysis Brute Force		Quiz 1

	Fri	Feb 10	Brute Force Algorithms		HW 6 due Worksheet 2

6	Tue	Feb 14	Winter Break		No Class

	Thu	Feb 16	Divide-and-Conquer: Sorting (Quick and Merge) Searching (Binary) Binary Tree Traversal	IDAA 4.1-4.4 Mergesort Notes Quicksort Notes	HW 7 due

	Fri	Feb 17	Divide and Conquer		Worksheet 3

7	Tue	Feb 21	Divide-and-Conquer: Strassen's algorithm and Closest Pair	IDAA 4.5-4.6	HW 8 due

	Thu	Feb 23	Decrease-and-Conquer: Sorting (Insertion) Searching (BFS) Searching (DFS) Sorting (Topological)	IDAA 5.1-5.3 BFS and DFS Notes

	Fri	Feb 24	Decrease-and-Conquer: Constant Factor Variable Size	IDAA 5.5-5.6	HW 9 due

8	Tue	Feb 28	Decrease-and-Conquer		Quiz 2

	Thu	Mar 02	Decrease and Conquer		Worksheet 4 Project 3 Due

	Fri	Mar 03	Everything		Review for Midterm

9	Tue	Mar 07	Everything (IDAA 1-5)		Midterm Exam

	Thu	Mar 09	Transform-and-Conquer: Sorting (pre sorting) Searching (Trees) Heaps and Heapsort	IDAA 6.1 IDAA 6.3-6.4 Heapsort Notes Search Tree Applet Heapsort Applet

	Fri	Mar 10	Transform-and-Conquer: Horner's Rule Binary Exponentiation	IDAA 6.5

10	Tue	Mar 14	Transform-and-Conquer: Reductions	IDAA 6.6	HW 10 due

	Thu	Mar 16	Transform and Conquer		Quiz 3 Project 4 Due

	Fri	Mar 17	Spring Break		No Class

Spring Break Week

11	Tue	Mar 28	Space-Time Tradeoffs: Counting Sort Radix Sort	IDAA 7.1 Radix Sort Notes

	Thu	Mar 30	Space and Time Tradeoffs: Hashing B-Trees	IDAA 7.3-7.4 Hashing Notes	HW 11 due

	Fri	Mar 31	Space and Time Tradeoffs		Worksheet 5

12	Tue	Apr 04	Dynamic Programming: Matrix Chain Multiplication Knapsack Problem	Dynamic Programming Notes IDAA 8.4

	Thu	Apr 06	Dynamic Programming: Warshall's Algorithm Floyd's Algorithm	IDAA 8.2 Warshall's Algorithm Notes Floyd's Algorithm Animation

	Fri	Apr 07	Dynamic Programming:		Worksheet 6

13	Tue	Apr 11	Greedy Technique: Fractional Knapsack Huffman Encoding	IDAA 9.4 Greedy Algorithms Notes

	Thu	Apr 13	Greedy Technique: Prim's Algorithm: Kruskal's Algorithm	IDAA 9.1-9.2 Minimum Spanning Trees Notes Spanning Tree Animations	Project 5 Due

	Fri	Apr 14	Good Friday		No Class

14	Tue	Apr 18	Greedy Technique		Worksheet 7

	Thu	Apr 20	P and NP	IDAA 10.3 P, NP, NP-Complete Notes	Quiz 4

	Fri	Apr 21	NP-Complete	IDAA 10.3 P, NP, NP-Complete Notes

15	Tue	Apr 25	P, NP, NPC		Worksheet 8

	Thu	Apr 27	Review for final		Project 6 Due

	Fri	Apr 28	Review for final

16	Mon	May 01	Final Exam 10:30am		Final Exam