Day	Topic	Textbook Reading	Due Dates
Aug. 22	Course overview, Max subarray lec1.txt	Ch. 1
Aug. 24	Array rotation lec2.txt	Ch. 2	Array rotation*
Aug. 25			Lab 1: Eclipse, Github, and Average Rainfall
Aug. 29	Linked lists lec3.txt	Ch. 4 Sec. 1
Aug. 31	Stacks, Queues, and ADTs lec4.txt	Ch. 4 Sec. 2-4	ArrayStack*
Sep. 1			Lab 2: Doubly Linked Lists and Iterators DList.java
Sep. 2			HW 1
Sep. 5	Labor day
Sep. 7	Time complexity	Ch. 3	BinarySearch*
Sep. 8			Lab 3: work on Flood It project
Sep. 9			Project: Flood it!
Sep. 12	More time complexity lec6.txt
Sep. 14	Binary Search Trees lec7.txt	Ch. 5 Sec. 1-4
Sep. 15			Lab 4: Kth Smallest in a Binary Search Tree BinarySearchTree-1.java, Quiz 1
Sep. 16			HW 2
Sep. 19	Balanced search trees lec8.txt	Ch. 13 Sec. 2
Sep. 21	Balanced trees continued AVLslides.pdf AVLquick-ref.pdf
Sep. 22			Lab 5: work on Segment Intersection project
Sep. 23
Sep. 26	Sorting lec10.txt	Ch. 7 Sec. 1,2,4,5,6
Sep. 28	Linear time sorting lec11.txt	Ch. 7 Sec. 7,8	Sorting in linear time
Sep. 29			Lab 6: Generic Quicksort Main.java
Sep. 30			Project: Segment Intersection and Binary Search Trees BSTImplement-2.java AVLImplement-2.java
Oct. 3	Dynamic programming lec12.txt	Ch. 16 Sec. 1
Oct. 5	Dynamic programming continued lec13-1.txt
Oct. 6			Lab 7: Seam Carving via Dynamic Programming, Quiz 2
Oct. 7	Fall break
Oct. 10	DNA Sequence Alignment lec14-1.txt	Ch. 5 Sec. 5	HW 3
Oct. 12	Heaps, Priority queues lec15.txt	Ch. 5 Sec. 6
Oct. 13			Lab 8: Work on DNA Seq. Align. Project
Oct. 14			Project: DNA Sequence Alignment
Oct. 17	Midterm review lec16.txt
Oct. 19	Midterm exam
Oct. 20
Oct. 24	Greedy algorithms, Huffman codes lec17.txt
Oct. 26	Hash tables lec18.txt	Ch. 9 Sec. 4
Oct. 27			Lab 9: Work on Project
Oct. 28			Project: DNA Compression
Oct. 31	Tries lec19.txt	Ch. 13 Sec. 1
Nov. 2	B-trees lec20.txt	Ch. 10 Sec. 3-5
Nov. 3			Lab 10: BTree split_child, Quiz 3
Nov. 4
Nov. 7	Disjoint sets (union-find) lec21.txt	Ch. 6 Sec. 1-2	HW 4
Nov. 9	Graphs lec22.txt	Ch. 11 Sec. 1-2
Nov. 10			Lab 11: Work on Project
Nov. 11			Project: Hash Tables for Compression
Nov. 14	Topological ordering, Connected components lec23.txt	Ch. 11 Sec. 3
Nov. 16	Depth-first search, Breadth-first search lec24.txt
Nov. 17			Lab 12: Labyrinth (BFS), Quiz 4
Nov. 20-27	Thanksgiving break
Nov. 28	Shortest paths lec25-1.txt	Ch. 11 Sec. 4
Nov. 30	Minimum spanning trees	Ch. 11 Sec. 5	HW 5
Dec. 1			Lab 13: Work on Project
Dec. 2			Project: Routing Wires on a Chip
Dec. 5	Review for final exam lec28.txt
Dec. 7	Review for final exam
See page 2 of the IU schedule	Final exam

*These assignments are due on midnight of the previous day.