profile-img
Eduncle posted an MCQ
February 22, 2020 • 15:20 pm 0 points
  • UGC NET
  • Computer Science & Applications

When using Dijkstra's algorithm to find shortest path in a graph, which of the following statements is not true?

Choose Your Answer:
0 Attempts Submit Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    Eduncle Best Answer

    Option 1. TRUE : Dijkstra's algorithm always find shortest path with in the same graph data structure. It uses a greedy technique to identify shortest path.
    Option 2 : TRUE: Every time a new node is visited, we choose the node with the smallest known distance/cost (weight) to visit first
    Option 3 : FALSE : It is false because Shortest path can have any number of vertices.
    Option 4 : TRUE : Dijkstra's algorithm will support only positive weight edges.

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers