This preview shows pages 1–3. Sign up to view the full content.
COT 5405
Analysis of Algorithms
Spring 2004
OnCampus Exam #2
Name: __________________________________________
UFID: ____________  ____________
Email: _________________________________________
Instructions:
1. Write neatly and legibly
2. While grading, not only your final answer but also your
approach to the problem will be evaluated
3. You have to attempt only THREE problems. If you
attempt more than three problems, we will grade any two of
them of OUR choice.
4. Each problem carries 10 points
5. Total time for the exam is 120 minutes
6. You are not allowed to use a calculator for this exam
I have read carefully, and have understood the above
instructions. On my honor, I have neither given nor received
unauthorized aid on this examination.
Signature: _____________________________________
Date: ____ (MM) / ____ (DD) / ___________ (YYYY)
Analysis of Algorithms Spring 2005
OnCampus Exam #2
Page 1 of 9
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentQuestion 1:
Consider the following algorithm for finding mincost spanning tree:
Suppose the graph has vertices numbered
1
…
n
. Start with a forest containing
n
trees, each
consisting of a single vertex.
Repeat the following until a single tree remains. For each vertex
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '08
 UNGOR
 Algorithms

Click to edit the document details