{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ex3 - A.V.Gerbessiotis Exam 3 CIS 435 Fall 2002 Exam 3 Name...

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

A.V.Gerbessiotis CIS 435 Fall 2002 Exam 3 12-13-2002 Exam 3 Name: ................................................................. ID Number: ....................... Section Number: ....................... Grade: 1: . ... 2: . ... 3: . ... 4: . ... 5: . ... 6: . ... 7: . ... 8: . ... Total: . .... Final Exam Sections 435-001 and 435-003 There are 6 (SIX) pages this page included Duration: 2hours30minutes 8 problems; 400 points total Read the Problems CAREFULLY! Solve the problems in the space provided. Do not open the EXAM until YOU ARE TOLD to do so Read and Sign the statement below at the end of the exam Unsigned exams will be marked with grade 0 (zero). STATEMENT On my honor, I pledge that I have not violated the provision of the NJIT Student Honor Code. Sign below at the end of the exam Signature . ...................................

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

View Full Document
Problem 1 (80 points) 1. Give an asymptotically tight solution for the recurrence: T ( n ) = 2 T ( n/ 2) + n 3 . 2. Solve exactly the recurrence T ( n ) = 2 T ( n/ 2) + n , where T (4) = 2. Problem 2 (50 points) In an empty red-black tree insert 200, then 100, then 50, then 70, and ﬁnally 30. Show the tree being formed at every step of the insertion.
Problem 3 (45 points) Consider inserting keys 1, 2, 32, 16, 23, 24, 45, 56 into a hash table of length m = 11 using open addressing with the primary hash function

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 / 6

ex3 - A.V.Gerbessiotis Exam 3 CIS 435 Fall 2002 Exam 3 Name...

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

View Full Document
Ask a homework question - tutors are online