Next:
October 2
Up:
CSC270 Algorithms and Data
Previous:
Floating arithmetic
October lecture summary
Subsections
October 2
Polynomial evaluation
Find roots by bisection
Newton's method
October 4
Numerical integration (aka quadrature)
October 9
But first,
structs
and
malloc
Graph definitions
October 11
Graph isomorphism
Graph representation
Depth-first search (DFS)
Breadth-first search
October 16
Shortest distance
Dijkstra's algorithm
October 18
Floyd-Warshall all-pairs shortest path
October 23
Paradox lost
October 25
CPP macros and conditional compilation
C++ overview
Dynamic allocation
Classes
October 30
Time-driven simulation
Danny Heap 2002-12-16
