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

Schedule

Course Schedule

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

  • Week 1 (4/1): Introduction: Analysis, math tools. Data structures: Sequences, trees.
    Read 1.1-1.4, 1.6, Appendix A, 2.1-2.3
  • Week 2 (4/8): 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 (4/15): 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 (4/22): Finish sorting, midterm review. Possibly Sets and selection.
    Read 4.2, 4.7.
    Midterm 1 date: Thursday, April 24th.
  • Week 5 (4/29): Dynamic Programming.
    Read chapter 5.3
  • Week 6 (5/6): Greedy algorithms. Start Graph algorithms (Graph ADT).
    Read chapter 5.1, 6.1
  • Week 7 (5/13): Graph Algorithms: DFS and BFS.
    Read chapter 6.2-6.5.
    Midterm 2 date: Thursday, May 15th.
  • Week 8 (5/20): More graph algorithms. shortest path, minimum spanning tree.
    Read chapter 7.
  • Week 9 (5/27): Least Common Subsequence
    Read chapter 9.4.
  • Week 10 (6/3): Introduction to NP.
    Read 13.1, 13.2.
  • Final date: Thursday, June 12th

Send mail to: edhong
Last modified: 4/1/2003 9:59 am