Tentative lecture topics for CSC270, Spring 97-98
** Subject to change **


Numerical methods

Jan 5    course intro, C: Unix intro
Jan 7    C: editing, compiling, variables, basic types
Jan 9    C: numeric expressions, assignment, printf

Jan 12   integration methods (A1 handed out)
Jan 14   integration analysis       
Jan 16   C: logical expressions, conditionals, loops

Jan 19   C: functions
Jan 21   C: more functions
Jan 23   C: scanf, conditional expressions, inc/dec

Jan 26   root finding methods       
Jan 28   root finding analysis      
Jan 30   C: type conversion, arrays, switch (--- A1 due ---)

Graphs

Feb 2    C: pointers, structs, dynamic allocation
Feb 4    graph representations
Feb 6    C: makefiles, multi-file program organization

Feb 9    single-source shortest path (Djikstra) (A2 handed out)
Feb 11   (--- midterm ---)
Feb 13   all-pairs shortest path (Floyd)

Feb 16   reading week
Feb 18   reading week
Feb 20   reading week

Feb 23   breadth-first search, depth first search
Feb 25   C++: ADTs, classes, objects, class members
Feb 27   midterm returned, transitive closure (--- A2 due ---)

Simulation

Mar 2    simulations, event-driven, time-driven (A3 handed out)
Mar 4    structure of a simulation
Mar 6    C++: discussion of the A3 skeleton code

Mar 9    probability, generating random variables
Mar 11   C++: `this', inheritance
Mar 13   C++: I/O, operator functions

Mar 16   generating random variables uniformly in [0,1]
Mar 18   Poisson process
Mar 20   C++: templates (--- A3 due ---)

Optimization

Mar 23   dynamic programming, knapsack (A4 handed out)
Mar 25   matrix chain
Mar 27   optimal BST

Mar 30   linear programming
Apr 1    floating point numbers  
Apr 3    floating point examples (--- A4 due ---)

Apr 6    problems with floating point numbers
Apr 8    exam preparation