Page contents:
Course Schedule
|
Computing and Software Systems 343, Winter 2003 Mathematical Principles of Computing II
Schedule
Course Schedule
Material covered by schedule subject to change, although midterm & final dates are fixed.
- Week 1 (1/6): Introduction: Analysis, math tools.
Read 1.1-1.4, 1.6. Appendix A.
- Week 2 (1/13): Finish Intro. Start Data structures, sequences and trees.
Read 2.1-2.4, 2.5.1.
- Week 3 (1/20): Finish data structures, priority queues. Binary Search trees. Start sorting.
Read 3.1, 4.1.
- Week 4 (1/27): Divide and Conquer, Recurrence equations, and sorting.
Read 4.1, 5.2, 4.3-4.5.
- Week 5 (2/3): Finish Sorting. Possibly get to sets and selection
Read 4.2, 4.7.
Midterm date: Thursday, February 6th.
- Week 6 (2/10): Dynamic Programming, Greedy algorithms.
Read chapter 5.3, 5.1.
- Week 7 (2/17): Graph Algorithms.
Read chapter 6.
- Week 8 (2/24): More graph algorithms.
Read chapter 7.
- Week 9 (3/3): Text processing.
Read chapter 9.
- Week 10 (3/10): Introduction to NP.
Read 13.1, 13.2.
- Final date: Thursday, March 20th.
|