DAA_QUIZ_2

Which of the following is not a greedy method

• Kruskal

• Bellman

• Prims

• Dijkstra

Which of the following is an example of a problem that can be solved using a greedy algorithm?

• Finding Time complexity

• Sorting Numbers

• The coin exchange problem

• GCD of two numbers

Greedy Algorithms have following characteristic.

• Objective function

• Feasible solution

• Selection function

• All of these

Dijkstra algorithm is also called the …………………. shortest path problem.

Fractional knapsack is based on which method ?

• Greedy

• Dynamic Programming

• Transform and Conquer

• Branch n Bound

Which of the following is a Divide and Conquer algorithm?

• Bubble Sort

• Selection Sort

• Quick Sort

• Merge Sort

. 

Identify the slowest sorting technique among the following

• Merge Sort

• Bubble Sort

• Quick Sort

• Heap Sort

Heap is a _____________?

• Tree

• Binary Tree

• Complete Binary Tree

• None of the above

Prim’s algorithm starts constructing a minimum spanning tree from ___

• An arbitary root vertex

• The shortest arc

• The left most vertex

• The right most vertex

In ___, one begins at the root of the tree and then explores along each branch.

• Topological sorting

• Breadth-first search

• Depth-first search

• Insertion Sort