November-December Lectures

Week of November 1-5

Nov 1: Depth-first search (cont.); shortest path.
Nov 3: Single-source shortest path (Dijkstra).
Tutorial: C++: ADTs, classes, objects, class members, I/O, class functions, function calls and instances, variable `this'.

Week of November 8-12

Nov 8: Introduction to simulation: deterministic vs. stochasatic, static vs. dynamic, time-driven vs. event-driven.
Nov 10: Probability, generating random variables, uniform distribution.
Tutorial: C++: constructors and destructors, inline functions, inheritance, virtual functions; random-number generation.

Week of November 15-19

Nov 15: Generating continuous random variables; generating random variables uniformly in [0,1]; exponential distribution.
Nov 17: discrete random variables; comments about assignment 3.
Tutorial: C++: comments on constructors and destructors, virtual functions, etc. All-pairs shortest paths: Floyd's algorithm.

Week of November 22-26

Nov 22: Dynamic programming: world series odds (A4 handed out).
Nov 24: Dynamic programming: matrix chain.
Tutorial: Dynamic programming: knapsack.

Week of November 29 - December 3

Nov 29: Dynamic programming: matrix chain (cont.); comments about assignment 4.
Dec 1: Dynamic programming: binary search trees (introduction only).
Tutorial: Integer representation.

Week of December 6-10

Dec 6: Problems with floating point numbers.
Dec 8: Exam preparation.
Tutorial: no tutorial this day.