CS570_Midterm_Exam_spr05

# CS570_Midterm_Exam_spr05 - CS570 Analysis of Algorithms...

This preview shows pages 1–4. Sign up to view the full content.

CS570 Analysis of Algorithms Spring 2005 Midterm Exam Name: _____________________ Student ID: _________________

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1) 12 pts Considering an undirected graph G=(V, E), are the following statements true or false? Provide a brief explanation. The space provided should suffice. A- Suppose all edge weights are different. Then the shortest edge must be in the minimum spanning tree. B- Suppose all edge weights are different. Then the longest edge cannot be in the minimum spanning tree. C- Suppose all edge weights are different. Then the minimum spanning tree is unique. D- Suppose all edge weights are different. Then the shortest path from A to B is unique.
2) 9 pts Considering amortized and actual cost analysis of heap operations {insert, extract- min, union, decrease-key, delete-key} on heap data structures we have studied. are the following statements true or false? Provide a brief explanation. The space provided should suffice. A-

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

CS570_Midterm_Exam_spr05 - CS570 Analysis of Algorithms...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online