Date	Topic	Reference	Slides	Link
First Class (Aug 2)	Introduction+Logistics	None	Slides	Aug 2
Week 1	Program Correctness, Hoare Logic	James Aspnes Lecture Notes	Slides	Aug 3
				Aug 4
				Aug 6
				Aug 9
Week 2	Running time analysis (Complexity)	Chapter 2 (Weiss book)	Slides	Aug 10
				Aug 11
				Aug 13
Week 3	Running time analysis (continued)	Chapter 2 (Weiss book)	Slides	Aug 17
Week 3	Running time analysis (continued)	Chapter 2 (Weiss book)	Slides	Aug 18
Week 4	Introduction to ADTs, List ADT.	Chapter 3 (Weiss book) Linked List code Array Based List code	Slides	Aug 23
				Aug 24
				Aug 25
Week 5	Writing recurrence relations. More on List ADT Stack ADT	Chapter 2+3 (Weiss book) recursive max (2 ways) Doubly Linked List Infix to Postfix using Stack	Slides-1 Slides-2	Aug 30
				Aug 31 (Part1)
				Aug 31 (Part2)
				Sept 1
				Sept 3
Week 6	Quiz 1 Discussion	None	None	Sept 6
Week 7	Queue ADT	Chapter 3 (Weiss book) Queue with wraparound Call Center Simulation Call Center Sample Input	Slides	Sept 13
				Sept 14
				Sept 15
Week 8	Trees, Binary Trees Binary Search Trees	Chapter 4 (Weiss book)	Slides (Trees) Slides (BST) Binary Search Tree code BST code for visualizer	Sept 18
				Sept 20
				Sept 21
				Sept 22
				Sept 24
				Sept 27
Week 9	Balanced Binary Search Trees (AVL trees)	Chapter 4 (Weiss book)	Slides-Part1 Slides Part2 Code for AVL	Sept 28
				Sept 29
				Oct 4
				Oct 5
Week 10	Priority Queue (ADT)	Chapter 6 (Weiss book)	Slides Part1 Slides Part2 Slides Part3	Oct 6
				Oct 8
				Oct 11
				Oct 12
				Oct 12 (short supplement)
Week 12	Sorting Algorithms	Reference Quick Sort code Merge Sort code	Slides part 1. Slides part 2.	Oct 13
				Oct 22
				Oct 25
				Oct 26
Week 13	Hashing		Slides Part 1 Slides Part 2 Slides Part 3	Oct 27
				Oct 29
				Nov 1
				Nov 2
Week 14 & 15	Graphs		Slides Part 1 Slides Part 2	Nov 3
				Nov 5
				Nov 8
				Nov 9
				Nov 10
				Nov 12