# mt2(3) - CS 373 Midterm 2 Questions (November 5, 2002) Fall...

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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 373 Midterm 2 Questions (November 5, 2002) Fall 2002 Write your answers in the separate answer booklet. This is a 90-minute exam. The clock started when you got the questions. 1. Professor Quasimodo has built a device that automatically rings the bells in the tower of the Cath´ edrale de Notre Dame de Paris so he can finally visit his true love Esmerelda. Every hour exactly on the hour (when the minute hand is pointing at the 12), the device rings at least one of the n bells in the tower. Specifically, the i th bell is rung once every i hours. For example, suppose n = 4. If Quasimodo starts his device just after midnight, then his device rings the bells according to the following twelve-hour schedule: 1 2 2 4 1 3 1 1 1 2 3 1 2 1 3 1 1 4 1 2 3 1 2 4 1 1:00 2:00 3:00 4:00 5:00 6:00 7:00 8:00 9:00 10:00 11:00 12:00 What is the amortized number of bells rung per hour, as a function of n ? For full credit, give an exact closed-form solution; a correct Θ() bound is worth 5 points....
View Full Document

## This note was uploaded on 12/15/2009 for the course 942 cs taught by Professor A during the Spring '09 term at University of Illinois at Urbana–Champaign.

### Page1 / 2

mt2(3) - CS 373 Midterm 2 Questions (November 5, 2002) Fall...

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

View Full Document
Ask a homework question - tutors are online