DAA QUIZ

Binary Search Uses

• Decrease and Conquer Design Technique

• Divide Conquer Design Technique

• Greedy Design Technique

• None of these

The data structure used for Depth First Algorithm is

• STACK

• QUEUE

• BOTH STACK & QUEUE

• NONE OF THESE

In linear Search Algorithm basic operation is

• Element Comparison with key Element

• Increment operation

• Decrement Operation

• None of these

Efficiency of an Algorithm is decided by the

• Number of times the basic operation is executed

• Time taken for executing the program

• Number of instructions in the program

• All of these

Worst case efficiency of Binary Search is

• O(n)

• O(n log n)

• O(Log n)

• O(n²)

Which of the following is an example for Decrease and Conquer Design Technique

• Topological Sort

• Fake Coin Problem

• Generating Permutation

• All of these

Heap should satisfy

• Shape Property

• Parental Dominance Property

• Both Shape and Parental Dominance Property

• None of these

Worst Case efficiency of Horspool Algorithm is

• O(n+m)

• O(nm)

• O(n²)

• None of these

__________solves only subproblems that are

necessary and does so only once.

• Dynamic Programming

• Memory Function

• Both Dynamic Programming & Memory Function

• Greedy Approach

Which of the following algorithm does not use greedy technique

• Prims Algorithm-

• Kruskals Algorithm

• Dijkstras Algorithm

• Floyds Algorithm