- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The maximum number of times the decrease...

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 |

C. | number of vertices – 1 |

D. | number of edges – 1 |

Answer» 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. |

View all MCQs in:
Design and Analysis of Algorithms

- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Cross product is a mathematical operation performed between
- How many times the for loop in the Bellmann Ford Algorithm gets executed?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ