CS 542 – Advanced Data Structures and Algorithms
Quiz 1
J
onathan Turne
r
1/26/2010
1. (5 points) Suppose Prim’s algorithm for minimum spanning trees is executed on a graph
with 100 vertices and 2,000 edges and that the implementation uses a d-heap. For each of the
operations listed below, what is the maximum number of times that operation can be
performed, based on the worst-case analysis of Prim’s algorithm?
insert
deletemin
changekey
siftup
2. (5 points) Explain the essential difference between the “labeling method” for the shortest
path problem and the “scanning and labeling method”.
- 1 -