M

Mr. Dubey • 52.30K Points
Coach 

Q. Dijkstra’s Algorithm is the prime example for

(A) greedy algorithm
(B) branch and bound
(C) back tracking
(D) dynamic programming
Correct : Option (A)

Explanation: 
 dijkstra’s algorithm is the prime example for greedy algorithms because greedy algorithms generally solve a problem in stages by doing what appears to be the best thing at each stage.

Share

Discusssion

Login to discuss.

Related MCQs

Q. Types of Zigbee devices are available as follows: i. ZigBee Coordinator ii. ZigBee Router iii. ZigBee End Device iv. ZigBee Accessor

Q. Which among the following is the correct statement

Q. which of the following is NOT present in an Activity Diagram?

Q. Which of the following provides a bridge between a company’s existing network and the AWS cloud?

Q. Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?

Q. The most Flexible way of logging the return addresses of the subroutines is by using

Q. Transmission delay does not depend on _____________

Q. The framework groups Reducer inputs by key in stage.

Q. Choose the incorrect statement:

Q. The offset used in the conditional branching is bit.