CS570
Analysis of Algorithms
Fall 2006
Exam 1
Name: _____________________
Student ID: _________________
Maximum
Received
Problem 1
20
Problem 2
10
Problem 3
10
Problem 4
10
Problem 5
10
Problem 6
20
Problem 7
20
Note: The exam is closed book closed notes.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document1)
20 pts
Mark the following statements as
TRUE
or
FALSE
. No need to provide any
justification.
[ TRUE/FALSE ]
If T(n) is both
O
(f(n)) and
Ω
(f(n)), then T(n) is
Ө
(f(n)) .
[ TRUE/FALSE ]
For a graph G and a node v in that graph, the DFS and BFS trees of G rooted at v
always contain the same number of edges
[ TRUE/FALSE ]
Complexity of the “Decrease_Key” operation is always O(lgn) for a priority
queue.
[ TRUE/FALSE ]
For a graph with distinct edge weights there is a unique MST.
[ TRUE/FALSE ]
Dynamic programming considers all the possible solutions.
[ TRUE/FALSE ]
Consider an undirected graph G=(V, E) and a shortest path P from s to t in G.
Suppose we add one 1 to the cost of each edge in G. P will still remain as a
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '06
 Shamsian
 Algorithms, Graph Theory, shortest path, undirected graph G=, G. Suppose

Click to edit the document details