When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true?
It can find shortest path within the same graph data structure
Every time a new node is visited, we choose the node with smallest known distance/cost (weight) to visit first
Shortest path always passes through least number of vertices
The graph needs to have a non-negative weight on every edge
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 did not call listen()
The HTTP response is missing proper headers (e.g., Content-Type or Content- Length)
The client used IPv6 instead of IPv4
The socket buffer size is too small
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?
The server did not call bind()
The server did not send an HTTP response back to the client
The browser used HTTPS instead of HTTP
The request buffer size was too small
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Computer Networks (Computer Networks) End Term paper sat on 10 May 2026, in the January 2026 term: 22 questions for 50 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Computer Networks End Term 10 May 2026 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Computer Networks |
| Course code | BSCS4024 |
| Questions | 22 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 6 |
| Numerical | 15 |
| Written | 1 |
| Official paper | Computer Networks 06 May 26 |
| Negative marking | No negative marking. |
| Updated |
