[WPI] [cs2223] [cs2223 text] [News] 

cs2223, D97/98 Syllabus

Week 1

Reading: Chapters 1, 2, Sections 3.1, 3.2

Problems 1 Assigned

Class 1 - Introduction, First Algorithm

Class 2 - Recurrence Relations, N-Digit Addition.

Class 3 - Measuring Computation Times and Operations

Class 4 - Numerical Simulations, Summations, Averages

Week 2

Reading: Chapter 4, Recurrence Relations Notes

Class 5 - Exam 1, Big O(), Recurrence Relations

Class 6 - Proofs

Class 7 - Proofs, Solution of Recurrence Relations

Class 8 - Solution of Recurrence Relations

Week 3

Reading: Section 5.7, Chapter 6

Problems 2 Assigned

Class 9 - Problems 1 due, Heaps

Class 10 - More on Heaps, Greedy Algorithms

Class 11 - Perturbation, Greedy Algorithms, Print Queuing Problem

Class 12 - Scheduling, Minimum Spanning Trees

Week 4

Reading: Chapter 7

Class 13 - Exam 2, Proofs, Heaps, Scheduling (Greedy Algorithms)

Class 14 - Divide and Conquer Algorithms

Class 15 - Analysis of Merge Sort and Quick Sort

Class 16 - Determinant of a Matrix

Week 5

Reading: Chapter 8

Problems 3 Assigned

Class 17 - Problems 2 due, N-Digit Multiplication, Efficient Recursion

Class 18 - Dynamic Programming

Class 19 - Dynamic Programming

Class 20 - Chained Matrix Multiplication

Week 6

Reading: Chapter 10 through Section 10-6, Chapter 9 (scan only)

Class 21 - Exam 3, Divide and Conquer, Dynamic Programming, Recurrence Relations

Class 22 - Random Number Generators, Probabilistic Algorithms

Class 23 - Probabilistic Algorithms

Class 24 - Trees

Week 7

Reading: Chapter 9 (scan only), Section 12.5 (scan only)

Class 25 - Problems 3 due, Random Numbers, Graphs, Graph Traversal

Class 26 - The N-queens problem

Class 27 - Complexity

Class 28 - Exam 4, Probabilistic Algorithms, N-Queens, Tree Searching

[cs2223 text] [News]

Contents ©1994-1998, Norman Wittels
Updated 01May98
Updated 29Apr98