ps7 - Introduction to Algorithms November 7, 2005...

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: Introduction to Algorithms November 7, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Handout 22 Problem Set 7 MIT students: This problem set is due in lecture on Monday, November 14, 2005. There will be two homework labs for this problem set, one held 68 P . M on Wednesday, November 9, 2005 and one held 24 P . M . on Sunday, November 13, 2005. Reading: Chapter 15, 16.116.3, 22.1, and 23. Problem 7-1 is mandatory. Failure to turn in a solution will result in a serious and neg- ative impact on your term grade! 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 in 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. Please staple and turn in your solutions on 3-hole punched paper . You will often be called upon to give an algorithm to solve a certain problem. Your write-up 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 the essay should provide the following: 1. A description of the algorithm in English and, if helpful, pseudo-code. 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. Full credit will be given only to correct solutions which are described clearly . Convoluted and obtuse descriptions will receive low marks. Exercise 7-1. Do Exercise 15.4-3 on page 356 of CLRS. Exercise 7-2. Do Exercise 16.1-3 on page 379 of CLRS. Exercise 7-3. Do Exercise 16.3-2 on page 384 of CLRS. Exercise 7-4. Do Exercise 22.1-5 on page 530 of CLRS. Exercise 7-5. Do Exercise 23.1-5 on page 566 of CLRS. Exercise 7-6. Do Exercise 23.2-4 on page 574 of CLRS. Exercise 7-7. Do Exercise 23.2-5 on page 574 of CLRS. 2 Handout 22: Problem Set 7 Problem 7-1. Edit distance In this problem you will write a program to compute edit distance. This problem is mandatory. Failure to turn in a solution will result in a serious and negative impact on your term grade! We advise you to start this programming assignment as soon as possible, because getting all the details right in a program can take longer than you think....
View Full Document

This note was uploaded on 02/01/2010 for the course COMPUTERSC 6.046J/18. taught by Professor Erikd.demaineandcharlese.leiserson during the Fall '05 term at MIT.

Page1 / 6

ps7 - Introduction to Algorithms November 7, 2005...

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