Tutorial: midterm test.
Lecture: Single-source shortest path (Dijkstra).
Tutorial: C++: ADTs, classes, objects, class members, I/O, class
functions, function calls and instances, variable `this'.
Lecture: Introduction to simulation: deterministic vs. stochasatic,
static vs. dynamic, time-driven vs. event-driven; probability,
generating random variables, uniform distribution.
Tutorial: C++: constructors and destructors, inline functions,
inheritance, virtual functions; random-number generation.
Lecture: Generating continuous random variables; generating random
variables uniformly in [0,1]; exponential distribution;
discrete random variables; discussion of assignment 3.
Tutorial: C++: comments on constructors and destructors, virtual
functions, etc. All-pairs shortest paths: Floyd's algorithm.
Lecture: Dynamic programming: world series odds; matrix chain (A4 handed out).
Tutorial: Dynamic programming: knapsack.
Lecture: Dynamic programming: matrix chain (cont.); binary search
trees (introduction only); comments about assignment 4.
Tutorial: Integer representation.
Lecture: Number representation: floating point numbers.
Exam preparation.