Feb 2: C: pointers, structs.
Feb 4: Graphs representations; dynamic allocation of arrays.
Tutorial: C: makefile, program structure, pointers, dynamic allocation.
Feb 9: single-source shortest path (Dijkstra) (A2 handed out).
Feb 11: midterm.
Tutorial: all-pairs shortest path (Floyd).
Feb 23: review Dijkstra and Floyd; comments A2.
Feb 25: transitive closure; comments breadth first search, depth first search.
Tutorial: midterm returned and discussed; C++: ADTs, classes, objects, class members (A2 due).