Opening the paper…

Computer Networks, End Term

January 2026 term, 10 May 2026, Set 1

Learning mode

Question 1

+1−0Single correct

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

Select one option

A.
It can find shortest path within the same graph data structure
B.
Every time a new node is visited, we choose the node with smallest known distance/cost (weight) to visit first
C.
Shortest path always passes through least number of vertices
D.
The graph needs to have a non-negative weight on every edge

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 21

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 21

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 21

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true? The browser establishes a TCP connection with the server, but displays a blank page or keeps loading indefinitely. What is the MOST likely issue? The server successfully receives and prints the HTTP request, but the browser shows “This site can’t be reached” or keeps loading. What is the most likely reason?