Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 Professors Srini Devadas and Erik Demaine April 2, 2008 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: 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 tr...
View Full Document

Ask a homework question - tutors are online