This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CIS 435, Spring 2002 First Midterm Exam Prof. J. Calvin Print Name (last name first): Do not open this exam until instructed to do so. The exam consists of 5 pages, numbered 1 through 5. Before starting to work, make sure that you have all 5 pages. There are four problems, each counting 20 points. Write all answers on the exam. During this exam it is prohibited to: 1. exchange information with any other person in any way, including by talking or exchanging papers or books; 2. use any electronic aid, including calculators; 3. use any books or notes; 4. leave the exam room before you complete and turn in your exam. I have read and understand all of the instructions above. On my honor, I pledge that I have not violated the provisions of the NJIT Academic Honor Code. Signature and Date Stirlings approximation : n ! = 2 n n e n (1 + (1 /n )) . Master Theorem: The solution T ( n ) to the recursion T ( n ) = aT ( n/b )+ f ( n ) can be bounded as follows: 1. If f ( n ) = O ( n log b...
View Full
Document
 Spring '09
 ALEX
 Algorithms

Click to edit the document details