CS570_Midterm_Exam_spr05

CS570_Midterm_Exam_spr05 - CS570 Analysis of Algorithms...

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

View Full Document Right Arrow Icon
CS570 Analysis of Algorithms Spring 2005 Midterm Exam Name: _____________________ Student ID: _________________
Background image of page 1

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

View Full DocumentRight Arrow Icon
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.
Background image of page 2
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-
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

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 Right Arrow Icon
Ask a homework question - tutors are online