|
|
Curriculum (Pensum)
The curriculum for the examination in the course "Efficient Algorithms
and Programs" on January 21st, 2002, is:
-
Chapters: 2, 12, 16, 22 to 26, and 36 in
"Introduction to Algorithms" by Cormen, Leiserson, and Rivest,
except:
- 12.4 (Open addressing)
- 16.3 (Longest common subsequence)
- 16.4 (Optimal polygon triangulation)
- 22.4 (Analysis of union by rank with path compression)
- 26.4 (A general framework for solving path problems in directed graphs)
- The BDD note.
|
|
|
|
 |
