Posted by hussein on July 30, 1999 at 16:12:10:
hi
the test on tuesday next week will cover the following sections :
huffman trees, BST, heaps/priority queues
General trees - implementations, uses
Graphs - concepts, traversals, algorithms
Sorting - 8 algorithms
in general ... ch5 (5.4) - ch8 ... but i could ask relevant questions from stuff we've already covered, though nothing u should have to study for ...
i dont expect you to memorize Dijkstra/Floyd/Prim/Kruskal (or any other complex/optimized algorithm) ... but you should know the basic concepts of how they work, and how to apply them manually ...
i also dont expect you to remember any proofs i did in class ... as long as you remember the conclusions ...
i do expect you to know how the data structures work, how to apply the sorting algorithms, peculiarities, time complexities ... ie why one algorithm/structure is better than another ...
---
hussein