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
Unformatted text preview: Introduction to Algorithms Last Problem Set! CS 482 Spring 2006 Due: Friday, May 5 Please hand in each problem on separate sheets with your name and netID on each. If a problem requires multiple sheets, please staple the sheets for that problem together Reading: Chapter 7.6. Not sure how we missed that one. Question 1 Once upon a time, in a far away kingdom, there was a prince. Prince Duane. One day, Duane went to the King and said “look, I’m a prince. So why don’t I have a princess?” Numerous explanations came to the King’s mind immediately, but instead of listing these out loud, the King decided to have some fun with the insolent prince. “Here be the deal,” began the King. “I’m gonna lock you in a tower. Outside of that tower I will randomly line up a thousand princesses from across the kingdom. They will enter the tower one at a time. When a princess enters, she will immediately tell you the number of gold pieces in her dowry....
View Full Document
This homework help was uploaded on 10/17/2007 for the course COM S 482 taught by Professor Wexler during the Spring '06 term at Cornell University (Engineering School).
- Spring '06