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
Unformatted text preview: CS174 Final Exam Spring 99 J. Canny May 19 This is a closed-book exam with 6 questions. You have 3 hours. All questions are worth equal points, so be sure to budget 30 minutes per question. You are allowed to use the 4 sides of notes you brought with you. No other notes are allowed. No calculators please. Write all your answers in this booklet. Good luck! NAME SID Number NOTE: Please print your name and SID CLEARLY. We can’t be responsible for scores for exams without a legible name. 1 1. Suppose you scheduled speakers to give training talks on a Monday. Before each speaker gives their talk, they are wrapped up in last-minute preparation, so they always miss the talk of the speaker before them. Now suppose you want to schedule the same talks for the next day (Tuesday), but you want to make sure that no speaker follows the speaker that they followed on Monday. That way, every speaker can listen to every other speaker’s talk on one of the two days. (a) Suppose you made a random permutation of the talks on Monday to get the order for Tuesday. What is the probability that no speaker on Tuesday follows the speaker that they followed on Monday? Assume is large.is large....
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.
- Spring '98
- Computer Science