This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . Introduction to Algorithms: 6.006 Massachusetts Institute of Technology March 29, 2008 Professors Srini Devadas and Erik Demaine Handout 8 Problem Set 4 This problem set is due Thursday April 10 at 11:59PM . Solutions should be turned in through the course website in PDF form using L A T E X or scanned handwritten solutions. A template for writing up solutions in L A T E X is available on the course website. Remember, your goal is to communicate. Full credit will be given only to the correct solution which is described clearly. Convoluted and obtuse descriptions might receive low marks, even when they are correct. Also, aim for concise solutions, as it will save you time spent on write ups, and also help you conceptualize the key idea of the problem. Exercises are for extra practice and should not be turned in. Exercises: • CLRS 22.23 (page 539) • CLRS 22.28 (page 539) • CLRS 22.39 (page 548) • CLRS 22.310 (page 549) 1. (7 points) Connected Components An undirected...
View
Full Document
 Spring '08
 ErikDemaine
 Algorithms, Graph Theory, Massachusetts Institute of Technology Professors

Click to edit the document details