M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?

  • (A) max priority queue
  • (B) stack
  • (C) circular queue
  • (D) min priority queue
Share
Explanation by: Mr. Dubey
minimum priority queue is the most commonly used data structure for implementing dijkstra’s algorithm because the required operations to be performed in dijkstra’s algorithm match with specialty of a minimum priority queue.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. print z(8)

Q. The address space in ARM is

Q. How many flip-flops are in the 7475 IC?

Q. In operating system, each process has its own

Q. What is the output of this expression, 3*1**3?

Q. What are the three general categories of computer systems that can contain digital evidence?

Q. The following commands gives the output like this #cat file1 file2 #cat: file1: No such file or directory hello If we execute the command “cat f

Q. Which of the following is a not a characteristics of combinational circuits?

Q. An IBM system/38 represents the computer class of:

Q. By collecting ________ during software testing, it is possible to develop meaningful guidelines to halt the testing process.

Question analytics