M

Mr. Dubey • 100.69K 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
  • (C) number of vertices – 1
  • (D) number of edges – 1
Share
Explanation by: Mr. Dubey
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. ___________ is an important functional component of the metadata.

Q. Which of the following is true for a thin-client?

Q. Context diagram explains

Q. How will you counter over-fitting in decision tree?

Q. Which of the following schemas defines the stored data structures in terms of the database model used?

Q. What does the acronym ETL stands for?

Q. Identity correct equation of Jacard Coefficient:

Q. ________ represent entity set.

Q. Virtual circuit identifier in frame relay is called _______

Q. _______ is an economic good that acts as a medium of exchange in transaction.

Question analytics