quiz2 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
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 .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Introduction to Algorithms: 6.006 Massachusetts Institute of Technology April 2, 2008 Professors Srini Devadas and Erik Demaine Handout 9 Quiz 2 Practice Problems 1 True/False Decide whether these statements are True or False . You must briefly justify all your answers to receive full credit. 1. There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case. True False Explain: 2. Heapsort can be used as the auxiliary sorting routine in radix sort, because it operates in place. True False Explain:
Background image of page 2
2 Handout 9: Quiz 2 Practice Problems 3. If the DFS finishing time f [ u ] > f [ v ] for two vertices u and v in a directed graph G , and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth first tree. True False Explain: 4. Let P be a shortest path from some vertex s to some other vertex t in a graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t .
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 7

quiz2 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online