cs2223 Classes

cs2223, D97/98 Classes

These are edited class notes. They are not necessarily complete and they are not a substitute for attending each class.

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

Class 5, Thursday 18 March 1998, Exam 1

Class 6, Friday 19 March 1998, Proofs

Class 7, Monday 23 March 1998, Proofs, Solution of Recurrence Relations

Class 8, Tuesday 24 March 1998, Solution of Recurrence Relations

Class 9, Thursday 26 March 1998, Heaps

Class 10, Friday 27 March 1998, More on Heaps, Greedy Algorithms

Class 11, Monday 30 March 1998, Perturbation, Greedy Algorithms, Print Queuing Problem

Class 12, Tuesday 31 March 1998, Scheduling, Minimum Spanning Trees

Class 13, Thursday 02 April 1998, Exam 2

Class 14, Friday 03 April 1998, Divide and Conquer Algorithms

Class 15, Monday 06 April 1998, Analysis of Merge Sort and Quick Sort

Class 16, Tuesday 07 April 1998, Determinant of a Matrix

Class 17, Thursday 09 April 1998, Problems 2 due, N-Digit Multiplication, Efficient Recursion

Class 18, Friday 10 April 1998, Dynamic Programming

Class 19, Monday 13 April 1998, Dynamic Programming

Class 20, Tuesday 14 April 1998, Chained Matrix Multiplication

There is no class on Thursday 16 April 1998 - WPI Project Day

Class 21, Friday 17 April 1998, Exam 3

Class 22, Monday 20 April 1998, Random Number Generators, Probabilistic Algorithms

Class 23, Tuesday 21 April 1998, Probabilistic Algorithms

Class 24, Thursday 23 April 1998, Trees

Class 25, Friday 24 April 1998, Problems 3 due, Random Numbers, Graphs, Graph Traversal

Class 26, Monday 27 April 1998, The N-queens problem

Class 27, Tuesday 28 April 1998, Complexity

Class 28, Thursday 30 April 1998, Exam 4