Quiz2

What is the appropriate data structure for Prim's minimum spanning tree?

• Stack

• Linear Queue

• Tree

• Priority Queue

What is represented by asymptotic notation O(1)

• Constant time

• linear time

• time less

• exponential time

what is the appropriate data structure for DFS algorithm?

• queue

• stack

• array

• tree

time complexity for recurrence relation T(n)=2T(n/2)+n

• O(log n)

• O(n log n)

• O(n^2)

• O(2 log n)

Fractional Knapsack is efficiently solved by

• Dynamic programming

• Greedy algorithm

• Divide conquer

• none of these

0/1 knapsack can be solved by greedy algorithm?

• True

• False

which algorithm is used to solve single source shortest path problem in a graph with negative edge?

• dijkstra

• bellman ford

• floyd warshal

• none of these

Kruskal’s algorithm is a ______

• divide and conquer algorithm

• dynamic programming algorithm

• greedy algorithm

• approximation algorithm

Which of the following is false about the Kruskal’s algorithm?

• It is a greedy algorithm

• It constructs MST by selecting edges in increasing order of their weights

• It can accept cycles in the MST

• It uses union-find data structure

What is the running time of Bellmann Ford Algorithm?

• O(V)

• O(V²)

• O(ElogV)

• O(VE)