Computing and Software Systems 343, Autumn 2003
Mathematical Principles of Computing II

Schedule

Course Schedule

Material covered by schedule subject to change, although midterm & final dates are fixed.

• Week 1 (9/29): Introduction: Analysis, math tools. Data structures: Sequences, trees.
  Read 1.1-1.4, 1.6, Appendix A, 2.1-2.3
• Week 2 (10/6): Data structures: priority queues, binary search trees. Recurrence equations, recursive analysis. Possible merge sort.
  Read 2.4, 2.5.1, 3.1, 4.1
• Week 3 (10/13): More recurrence equations, merge sort, divide and conquer algorithms. Heap sort, bucket sort, radix sort.
  Read 4.1, 5.2, 4.3-4.5.
• Week 4 (10/20): Finish sorting, midterm review. Possibly Sets and selection.
  Read 4.2, 4.7.
  Midterm 1 date: Wednesday, Oct 22nd.
• Week 5 (10/27): Actually finished sorting,big integer multiplication.
• Week 6 (11/3): Dynamic Programming.
  Read chapter 5.3
• Week 7 (11/10): Greedy algorithms. Intro to Graphs and Graph ADT.
  Read chapter 5.1, 6.1-6.2.
• Week 8 (11/17): Graph Algorithms: DFS, BFS.
  Read chapter 6.
  Midterm 2 date: Monday, Nov 17th.
• Week 9 (11/24): More graph algorithms. shortest path, minimum spanning tree.
  Read chapter 7.
• Week 10 (12/1): Least Common Subsequence
  Read chapter 9.4.
• Week 11 (12/8): Introduction to NP.
  Read 13.1, 13.2, review.
• Final date: Wednesday, Dec 17th