Schedule of topics and readling list

Book Chapters

• Week 1:
• Wednesday, August 22nd: Chapter 2, sections 2.1, 2,2, and 2.3, and Chapter 3, sections 3.1 and 3.2 (O(), Ω() Θ())
• Week 2:
• Monday, August 27th Chapter 4, section 4.3, 4.4, 4.5 (Substitution Method, Recursion Trees, Master Method)
• Wednesday, August 29th Chapter 5, sections 5.1 - 5.3 (Hiring Problem, Indicator Variables, Randomized Algorithms and Chapter 6: Complete (Heapsort)
• Week 3:
• Monday, September 4th Labor Day (no class)
• Wednesday, September 6th: Chapter 7 Complete (Quicksort) and Chapter 8 (Non-comparison sorting)
• Friday, September 8th: Census date
• Week 4:
• Monday, September 11th Chapter 9: Selection, Chapter 13 Complete (Red-Black Trees)
• Wednesday, September 13th: Chapter 13 / Chapter 14: Complete (Red-Black Trees, Modifying Data Structures)
• Week 5:
• Monday, September 18th: Chapter 13 / Chapter 14: Complete (Red-Black Trees, Modifying Data Structures)
• Wednesday, September 20st: Chapter 15, Section 15.1-15.4 (Dynamic Programming)
• Week 6:
• Monday, September 25th: Chapter 16, Sections 16.1-16.2 (Greedy)
• Wednesday, September 27th: Chapter 16, Sections 16.3-16.4 (Greedy)
• Week 7:
• Monday, October 2nd: Midterm Review
• Wednesday, October 4th: Midterm
• Week 8:
• Monday, October 9th: Chapter 18, Sections 18.1-18.3 (B-Trees), Chapter 17, Sections 17.1-17.2 (Amoritized Analysis)
• Wednesday, October 11th: Chapter 17, Sections 17.3 - 17.4 (Amortized Analysis) and Chapter 19 (Fibonacci Heaps)
• Week 9:
• Monday, October 16th: Fall Break
• Wednesday, October 19th: Chapter 21 (Disjoint Sets) and Chapter 22, Sections 22-1-22.3 (Basic Graphs, connected components)
• Week 10:
• Monday, October 23rd: Chapter 22, Sections 22-1-22.3 (Basic Graphs, connected components)
• Wednesday, October 25th: Chapter 22, Section 22.4, Chapter 23, Section 23.1 (Minimum Cost Spanning Trees) and Chapter 24 (Shortest Paths algorithms)
• Week 11:
• Monday, October 30st: Chapter 25, Sections 25.1-25.2 (All Pairs Shortest Paths)
• Wednesday, November 1st: Chapter 26 (Flow Networks)
• Friday, November 4th: Last Day to Drop Courses or Withdraw
• Week 12:
• Monday, November 6th: Chapter 33 (Computational Geometry)
• Wednesday, November 8th: Chapter 32 (String Matching)
• Week 13:
• Monday, November 13th: Midterm 2 review
• Wednesday, November 15th: Midterm 2
• Week 14:
• Monday, November 20st: Chapter 34 (NP-Completeness)
• Wednesday, November 22nd: Chapter 35 (Apporixmation Algorithms)
• Week 15:
• Monday, November 27st: Chapter 35 (Apporixmation Algorithms)
• Wednesday, November 29th: Compression (not in textbook)
• Week 16:
• Monday, Dec 5th: Review
• Wednesday, Dec 7th: Review
• Saturday, December 9th: Final exam from 5:30-7:30pm