<1998 (CSC2040, K.M.)<
The best laid plans of mice and men...
- admin, lectures,
labs (see prac #1), assessment,
www, Linux / Unix, C.
The idea of an `abstract data type' (ADT),
e.g. int, stack, queue, binary tree.
Tree traversals, recursive prefix, infix & postfix, and breadth-first
(probably run into L2).
e.g. Fibonacci, exponential-, linear- & log-time, non-recursive.
Towers of Hanoi.
- Binary tree, binary search tree, insertion, deletion.
Parse tree, parser, recursive descent.
- Dynamic Programming (~2)
- Sorting (~4)
- Tables and searching (~4)
inc' AVL and other balanced trees
- Numerical (~2)
- Graphs (~5)
- Applications of A's + DS's (~3)
e.g. polygon fitting?
- Revision (1)
NB. Subject to change without notice!
L.Allison, 1st semester 1999,
School of Computer Science and Software Engineering,
Monash University, Australia.