CS70_Exam_1__Fall_2006

CS70_Exam_1__Fall_2006 - CS570 Analysis of Algorithms Fall...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
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.
Background image of page 1

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

View Full DocumentRight Arrow Icon
1) 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
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

CS70_Exam_1__Fall_2006 - CS570 Analysis of Algorithms Fall...

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