{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Exams1s04

# Exams1s04 - COT 5405 Analysis of Algorithms Spring 2004...

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

COT 5405 Analysis of Algorithms Spring 2004 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 problems of OUR choice 4. Each problem carries 10 points 5. Total time for the exam is 50 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 2004 On-Campus Exam #1 Page 1 of 8

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

View Full Document
Analysis of Algorithms Spring 2004 On-Campus Exam #1 Page 2 of 8
Question 1: Solve the recurrence relation without using Master’s theorem: 2 ) (log 2 2 ) ( N N N T N T + = Derive a Theta expression for T ( N ).

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

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

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

View Full Document
Ask a homework question - tutors are online