The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to

Home / Engineering / Design and Analysis of Algorithms / Question

Mr. Dubey • 51.17K Points
Coach

Q.) The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to

(A) total number of vertices

(B) total number of edges

(D) number of edges – 1

Correct answer : Option (B) - total number of edges

Explanation:

 if the total number of edges in all adjacency list is e, then there will be a total of e number of iterations, hence there will be a total of at most e decrease key operations.

Discusssion

Related MCQs on Design and Analysis of Algorithms

Q. . …………………… among the following was the first to identify four functions of management.

Q. Which of the following file organization is most efficient for a file with a high degree of file activity?

Q. The navigation buttons enable you to

Q. IC 4116 is organised as

Q. The process wherein the processor constantly checks the status flags is called as

Q. When the page table is placed in the main memory, the is used to store the recently accessed pages.

Q. What are normally the two best measurement units for an evolutionary algorithm? 1. Number of evaluations 2. Elapsed time 3. CPU Time 4. Number of generations

Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5

Q. is the least technical way of collecting data, but it can be difficult and tiring to write and observe at

Q. A computer consists of