Time management is very much important in IIT JAM. The eduncle test series for IIT JAM Mathematical Statistics helped me a lot in this portion. I am very thankful to the test series I bought from eduncle.
Nilanjan Bhowmick AIR 3, CSIR NET (Earth Science)
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.