quiz2-s2011

# quiz2-s2011 - 6.006 Spring 2011 Quiz 2 Introduction to...

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

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

View Full Document
6.006 Quiz 2 Name 2 Problem 1. True or false [24 points] (8 parts) For each of the following questions, circle either T (True) or F (False). Explain your choice. (Your explanation is worth more than your choice of true or false.) (a) T F Instead of using counting sort to sort digits in the radix sort algorithm, we can use any valid sorting algorithm and radix sort will still sort correctly. (b) T F The depth of a breadth-ﬁrst search tree on an undirected graph G = ( V,E ) from an arbitrary vertex v V is the diameter of the graph G . (The diameter d of a graph is the smallest d such that every pair of vertices s and t have δ ( s,t ) d .)
6.006 Quiz 2 Name 3 (c) T F Every directed acyclic graph has exactly one topological ordering. has valid topological orderings [ a,b,c ] or [ a,c,b ] . As another example, G = ( V,E ) = ( { a,b } , {} ) has valid topological orderings [ a,b ] or [ b,c ] .

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

View Full Document
This is the end of the preview. Sign up to access the rest of the 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 / 19

quiz2-s2011 - 6.006 Spring 2011 Quiz 2 Introduction to...

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

View Full Document
Ask a homework question - tutors are online