Exam1s05 - COT 5405 Analysis of Algorithms On-Campus Exam...

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 2005 On-Campus Exam #1 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 TWO problems. If you attempt more than two problems, we will grade ANY two of OUR choice. 4. Each problem carries 10 points. 5. Total time for the exam is 60 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 #1 Page 1 of 7
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: Solve the recurrence relation ( without using Masters theorem) T ( n ) = 2 T ( n
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 / 7

Exam1s05 - COT 5405 Analysis of Algorithms On-Campus Exam...

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