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: Introduction to Algorithms October 30, 2002 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Handout 19 Problem Set 6 This problem set is due in lecture on Wednesday, November 13. Reading: 33.3; Chapter 15; 16.116.3; Chapter 23 Both exercises and problems should be solved, but only the problems should be turned in. Exercises are intended to help you master the course material. Even though you should not turn in the exercise solutions, you are responsible for material covered by the exercises. Mark the top of each sheet with your name, the course number, the problem number, your recitation section, the date, and the names of any students with whom you collaborated. Each problem should be done on a separate sheet (or sheets) of threehole punched paper. You will often be called upon to give an algorithm to solve a certain problem. Your writeup should take the form of a short essay. A topic paragraph should summarize the problem you are solving and what your results are. The body of your essay should provide the following: 1. A description of the algorithm in English and, if helpful, pseudocode. 2. At least one worked example or diagram to show more precisely how your algorithm works. 3. A proof (or indication) of the correctness of the algorithm. 4. An analysis of the running time of the algorithm. Remember, your goal is to communicate. Graders will be instructed to take off points for convo luted and obtuse descriptions. Exercise 61. Do Exercise 33.33 on page 956 of CLRS. Exercise 62. Do Exercise 15.44 on page 356 of CLRS. Exercise 63. Do Exercise 15.53 on page 363 of CLRS. Exercise 64. Do Exercise 16.25 on page 384 of CLRS. Exercise 65. Do Exercise 16.34 on page 392 of CLRS. Exercise 66. Do Exercise 23.13 on page 566 of CLRS. Exercise 67. Do Exercise 23.23 on page 573 of CLRS. 2 Handout 19: Problem Set 6 Problem 61. In this problem, we will use hashing to modify the van Emde Boas data structure presented in lecture in order to reduce its space usage. The following material (through part (a) ) is a review of the lecture on van Emde Boas structures; then we consider some changes....
View
Full
Document
This note was uploaded on 01/01/2011 for the course CS 5503 taught by Professor Charlese.leiserson during the Fall '01 term at MIT.
 Fall '01
 CharlesE.Leiserson
 Algorithms

Click to edit the document details