q2-s2009 - Introduction to Algorithms Massachusetts...

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 April 15, 2009 Massachusetts Institute of Technology 6.006 Spring 2009 Professors Sivan Toledo and Alan Edelman Quiz 2 Quiz 2 • Do not open this quiz booklet until directed to do so. Read all the instructions on this page. • When the quiz begins, write your name on every page of this quiz booklet. • You have 120 minutes to earn 120 points. Do not spend too much time on any one problem. Read them all through first, and attack them in the order that allows you to make the most progress. • This quiz booklet contains 8 pages, including this one. Two extra sheets of scratch paper are attached. Please detach them before turning in your quiz at the end of the exam period. • This quiz is closed book. You may use two 8 1 2 00 × 11 00 or A4 crib sheet (both sides). No calculators or programmable devices are permitted. No cell phones or other communications devices are permitted. • Write your solutions in the space provided. If you need more space, write on the back of the sheet containing the problem. Pages may be separated for grading. • Do not waste time and paper rederiving facts that we have studied. It is sufficient to cite known results. • Show your work, as partial credit will be given. You will be graded not only on the correct- ness of your answer, but also on the clarity with which you express it. Be neat. • Good luck! Problem Parts Points Grade Grader 1 20 4 2 32 4 3 24 1 4 24 1 5 20 3 Total 120 Name: Friday Recitation: Rishabh 10 AM Rob 12 PM Chieu 1 PM Jason 2 PM Matthew 3 PM 6.006 Quiz 2 Name 2 Problem 1. True or False [20 points] (4 parts) For each of the following questions, circle either T (True) or F (False). Explain your choice. (No credit if no explanation given.) (a) T F Topological sort requires Ω( V lg V ) if the edge weights are unbounded....
View Full Document

This note was uploaded on 01/20/2012 for the course CS 6.006 taught by Professor Erikdemaine during the Fall '08 term at MIT.

Page1 / 10

q2-s2009 - Introduction to Algorithms Massachusetts...

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