Quiz 8
CMP 761: Analysis of Algorithms
Lehman College, City University of New York
Fall 2002
The start date for this quiz is Tuesday, 19 November.
The deadline for completing this quiz is 5:30pm, Thursday, 5 December.
Reading: Chapters 22, 23 and 24 (pp 527-551, 561-600): Elementary
Graph Algorithms, Minimum Spanning Trees, and Single-Source Shortest Paths.
Suggested Problems
These are not to be turned in. They are to help you understand
the material, and some will appear on the quiz and exams.
- Exercise 22.1-1, p 530.
- Exercise 22.1-2, p 530.
- Exercise 22.1-5, p 530.
- Exercise 22.2-1, p 538.
- Exercise 22.2-3, p 539.
- Exercise 22.3-1, p 547.
- Exercise 22.3-8, p 548.
- Exercise 22.4-1, p 551.
- Exercise 22.4-2, p 552.
- Problem 22-4, p 559.
- Exercise 23.1-1, p 566.
- Exercise 23.2-1, p 573.
- Exercise 24.1-1, p 591.
- Exercise 24.2-1, p 594.
- Exercise 24.3-1, p 600.