Exam2s05 - COT 5405 Analysis of Algorithms Spring 2004...

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

View Full Document Right Arrow Icon
COT 5405 Analysis of Algorithms Spring 2004 On-Campus Exam #2 Name: __________________________________________ UFID: ____________ - ____________ E-mail: _________________________________________ 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 On-Campus Exam #2 Page 1 of 9
Background image of page 1

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

View Full DocumentRight Arrow Icon
Question 1: Consider the following algorithm for finding min-cost 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
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

Exam2s05 - COT 5405 Analysis of Algorithms Spring 2004...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online