Reference
Introduction to Algorithms (2nd Edition) by Cormen, Leiserson,
and Rivest. Study the following chapters:
2NOTE: The students can study the same materials from other textbooks.
3.1
4.1 - 4.3
5.1 - 5.3
6 - 10
11
12.1 - 12.3
13 (or any other balanced tree method; e.g. AVL tree, 2-3 tree,.. etc)
14
15
16.1 - 16.3
17
22
23
24.2
25.2
Last modified: October 13, 1999.
gradrep@cs.nmsu.edu