(A) Breadth first search is shortest path algorithm that works on un-weighted graphs
(B) Breadth first search is shortest path algorithm that works on un-weighted graphs
(C) Both of above are true
(D) None of above are true
Tag: Fundamentals of Algorithms
Which statement is true?
(A) If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal
(B) If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal
(C) both of above
(D) none of above
Merge sort is stable sort, but not an in-place algorithm?
(A) True
(B) False
(C) NA
(D) NA
After partitioning array in Quick sort, pivot is placed in a position such that?
(A) Values smaller than pivot are on left and larger than pivot are on right
(B) Values larger than pivot are on left and smaller than pivot are on right
(C) Pivot is the first element of array
(D) Pivot is the last element of array
Shortest path problems can be solved efficiently by modeling the road map as a graph?
(A) True
(B) False
(C) NA
(D) NA
Although it requires more complicated data structures, Prim’s algorithm for a minimum spanning tree is better than Kruskal’s when the graph has a large number of vertices?
(A) True
(B) False
(C) NA
(D) NA
What general property of the list indicates that the graph has an isolated vertex?
(A) There is Null pointer at the end of list
(B) The Isolated vertex is not handled in list
(C) Only one value is entered in the list
(D) There is at least one null list
__ gives total view of an organization?
(A) OLTP
(B) OLAP
(C) Data warehousing
(D) Database