Computer Science 174 - Spring 1998 - Canny - Final Exam

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

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS174 Final Exam Spring 98 J. Canny May 20 This is a closed-book exam with 6 questions. The marks for each question are shown in parenthe- ses, and the total is 120 points. Make sure you allocate enough time to attempt all the questions. You are allowed to use the formula sheet that will be handed out with the exam. No other notes are allowed. Calculators are OK. Write all your answers in this booklet. Good Luck! NAME SID Number 1 1. Recall that in the stable marriage algorithm, males and females have preference lists, and each male proposes to his most-preferred female who has not rejected him yet. Each female accepts unless she is married to a more-preferred partner. Let be the number of people. Assume the rank lists are random permutations of . (a) What is the expected number of proposals that a male makes? (note that this is the same as the expected number of proposals that each female receives) (b) What is the expected rank of each males final wife?...
View Full Document

This test prep was uploaded on 04/20/2008 for the course CS 174 taught by Professor Canny during the Spring '98 term at University of California, Berkeley.

Page1 / 7

Computer Science 174 - Spring 1998 - Canny - Final 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