{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

q2-f2008

# q2-f2008 - 6.006 Fall 2008 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. BFS/DFS [10 points] (2 parts) Give the visited node order for each type of graph search, starting with s , given the following ad- jacency lists and accompanying figure: adj ( s ) = [ a, c, d ] , adj ( a ) = [ ] , adj ( c ) = [ e, b ] , adj ( b ) = [ d ] , adj ( d ) = [ c ] , adj ( e ) = [ s ] . s a e c b d (a) Breadth First Search (b) Depth First Search
6.006 Quiz 2 Name 3 Problem 2. Miscellaneous True/False [30 points] (10 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 While running DFS on a directed graph, if from vertex u we visit a finished vertex v , then the edge ( u, v ) is a cross-edge.

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.

{[ snackBarMessage ]}

### Page1 / 15

q2-f2008 - 6.006 Fall 2008 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