{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Computer Science 174 - Spring 2001 - Canny - Final Exam

# Computer Science 174 - Spring 2001 - Canny - Final Exam -...

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

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

View Full Document
(e) (4 points) Suppose we create a random graph on vertices by adding one edge at a time, selecting and independently and uniformly at random from , discarding self-loops. Let be the number of edges added until the graph is connected. What is in terms of (you can give a big-O bound)? Answer: From class, using epochs, the expected number of edges is . 2. Let be a random permutation of . Suppose the elements are inserted in that order into an initially-empty binary search tree. (a) (6 points) What is the expected height of the final tree in terms of ?
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

Computer Science 174 - Spring 2001 - Canny - Final Exam -...

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

View Full Document
Ask a homework question - tutors are online