This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS570 Analysis of Algorithms Fall 2008 Exam I Name: _____________________ Student ID: _________________ ____Monday Section ____Wednesday Section ____Friday Section Maximum Received Problem 1 20 Problem 2 10 Problem 3 10 Problem 4 20 Problem 5 20 Problem 6 20 Total 100 2 hr exam Close book and notes 1) 20 pts Mark the following statements as TRUE or FALSE . No need to provide any justification. [ TRUE/FALSE ] Given graph G and a Minimum Spanning Tree T on G , you could find the (weighted) shortest path between arbitrary pair u, v in V(G) using only edges in T . [ TRUE/FALSE ] V 2 log V = θ (E logE 2 ) whether the graph is dense or sparse. [ TRUE/FALSE ] If DFS and BFS returns different trees, then the original graph is not a tree. [ TRUE/FALSE ] An algorithm with the running time of n * 2 min(n log n, 10000) runs in polynomial time. [ TRUE/FALSE ] We may need to run Dijkstra’s algorithm to compute the shortest path on a directed graph, even if the graph doesn't have a cycle. [ TRUE/FALSE ] Given a graph that contains negative edge weights, we can use Dijkstra's algorithm to find the shortest paths between any two vertexes by first adding a constant weight to all of the edges to eliminate the negative weights....
View Full Document
This note was uploaded on 10/08/2010 for the course CS 570 taught by Professor Shahriarshamsian during the Fall '08 term at USC.
- Fall '08