Computer Science 170 - Fall 1997 - Papadimitriou - Midterm 1

Computer Science 170 - Fall 1997 - Papadimitriou - Midterm...

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 Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 170 - Midterm 1 - Fall 1997 CS 170, Fall 1997 First Midterm Professor Papadimitriou Problem #1 (15 points) What are the strongly connected components of the directed graph shown below? (Just circle them). ● Which is the strongly connected component that will be discovered first by our algorithm (first do DFS on the reverse graph, then on the graph)? Which one will be discovered last? As always, when DFS has a choice, it visits the lexicographically smallest node. ● Give the DAG of the strongly connected components. Give a topological sorting of this DAG. Problem #2 file:///C|/Documents%20and%20Settings/Jason%20Rafte...20Fall%201997%20-%20Papadimitriou%20-%20Mid%201.htm (1 of 5)1/27/2007 5:32:58 PM CS 170 - Midterm 1 - Fall 1997 2. (15 points) Give a linear algorithm which, given a connected undirected graph, returns a node whose deletion would not disconnect the graph. A. Brief Description or pseudocode B. Justification of correctness. C. Running time and justification....
View Full Document

{[ snackBarMessage ]}

Page1 / 5

Computer Science 170 - Fall 1997 - Papadimitriou - Midterm...

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