Quiz Space

Computer Networks · End Term · 21 Dec 2025 · September 2025 term

Question 31: When using Dijkstra’s algorithm to find shortest path in…

Question 31

+1 markOne correct option

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

  1. A

    It can find shortest path within the same graph data structure

  2. B

    Every time a new node is visited, we choose the node with smallest known distance/cost (weight) to visit first

  3. C

    Shortest path always passes through least number of vertices

  4. D

    The graph needs to have a non-negative weight on every edge

Show answer

Correct answer

  • C

    Shortest path always passes through least number of vertices

See the whole paperTake it as a mock test

Question 31 of 42 in the IIT Madras BS Computer Networks (Computer Networks) End Term paper sat on 21 Dec 2025, in the September 2025 term (Computer Networks 18 Dec 25). It carries 1 mark.

This question was also asked in

More questions from this paper

  1. Q1Assume a host in Mumbai wants to send a packet to a server in Delhi, approximately 1300 km away. If the signal travels …
  2. Q2Assume a host in Mumbai wants to send a packet to a server in Delhi, approximately 1510 km away. If the signal travels …
  3. Q3If the one-way latency between two cities is measured to be 35 ms, the RTT (Round Trip Time) assuming symmetric paths a…
  4. Q4If the one-way latency between two cities is measured to be 15 ms, the RTT (Round Trip Time) assuming symmetric paths a…
  5. Q5A transmitter sends packets of size 2100 bits at a rate of 4 Mbps from node X to node Y. The one-way delay is observed …
  6. Q6A transmitter sends packets of size 2000 bits at a rate of 3 Mbps from node X to node Y. The one-way delay is observed …
  7. Q7In a circuit-switched network, a source communicates with a destination through 10 intermediate switches. Each switch t…
  8. Q8In a circuit-switched network, a source communicates with a destination through 5 intermediate switches. Each switch ta…
  9. Q9Answers Case Sensitive : No
  10. Q10Answers Case Sensitive : No
  11. Q11A TCP connection uses the following identifiers:\ Source IP = 192.168.1.10 • Destination IP = 10.0.0.5 • Source Port = …
  12. Q12A TCP connection uses the following identifiers:\ Source IP = 192.168.1.10 • Destination IP = 10.0.0.5 • Source Port = …
  13. Q13A 20 Mbps link has a propagation delay of 100 μs. The transmitter employs the Stop-and-Wait protocol. Assuming each fra…
  14. Q14A 20 Mbps link has a propagation delay of 400 μs. The transmitter employs the Stop-and-Wait protocol. Assuming each fra…
  15. Q15If you are designing sliding window protocol (assume selective repeat) of 5 Mbps which has one way delay of 1.27 second…
  16. Q16If you are designing sliding window protocol (assume selective repeat) of 7 Mbps which has one way delay of 1.55 second…
  17. Q17In a network with a bottleneck bandwidth of 30 Mbps and a round-trip time of 50 ms,what should be the minimum congestio…
  18. Q18In a network with a bottleneck bandwidth of 25 Mbps and a round-trip time of 400 ms,what should be the minimum congesti…
  19. Q19A TCP flow has a congestion window of 86 KB and an RTT of 450 ms. Calculate the average throughput in Mbps. Note: In tw…
  20. Q20A TCP flow has a congestion window of 54 KB and an RTT of 510 ms. Calculate the average throughput in Mbps. Note: In tw…
  21. Q21In TCP BBR’s bottleneck bandwidth estimation, the ACK arrival rate measured over an epoch gives a delivery rate of 84 M…
  22. Q22In TCP BBR’s bottleneck bandwidth estimation, the ACK arrival rate measured over an epoch gives a delivery rate of 48 M…
  23. Q23A TCP Reno connection detects congestion when CWND = 200 KB. After triple duplicate ACK, CWND is reduced to 1/4, and ad…
  24. Q24A TCP Reno connection detects congestion when CWND = 100 KB. After triple duplicate ACK, CWND is reduced to 3/4, and ad…
  25. Q25An ISP manages a network block of 200.8.0.0/12. it partitions and assigns a customer a smaller block 200.8.4.128/18. Ca…
  26. Q26An ISP manages a network block of 200.8.0.0/10. it partitions and assigns a customer a smaller block 200.8.4.128/22. Ca…
  27. Q27How many distinct prefixes can a /12 block be divided into when it is subnetted up to /16 networks?
  28. Q28How many distinct prefixes can a /10 block be divided into when it is subnetted up to /18 networks?
  29. Q29An organization has 1900 devices connected in a private network. Each NAT router can handle up to 90,000 simultaneous c…
  30. Q30An organization has 2,200 devices connected in a private network. Each NAT router can handle up to 80,000 simultaneous …
  31. Q32When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true?
  32. Q33The browser connects (TCP handshake visible) but the webpage never loads. What is the MOST likely issue?
  33. Q34The browser connects (TCP handshake visible) but the webpage never loads. What is the MOST likely issue?
  34. Q35The server prints the GET request in console but the browser keeps “Waiting for localhost...”.Why?
  35. Q36The server prints the GET request in console but the browser keeps “Waiting for localhost...”. Why?
  36. Q37Figure question
  37. Q38Figure question
  38. Q39Figure question
  39. Q40Figure question
  40. Q41Figure question
  41. Q42Figure question