FREE PRACTICE
Language:
English
हिन्दी
English + हिन्दी
Question 1 of 10
0% complete
Data Communication and Computer Networks
Routing Algorithms
Dijkstra's algorithm computes
A
Shortest paths from a source in a weighted graph under its assumptions
B
TCP retransmission timers
C
CRC values
D
MAC addresses
Check Answer
Free trial • 10 questions • No account required
✦
QuestAce Help
✦
QuestAce Assistant
Self-service help · Always available
↻
×
👋
Welcome to QuestAce!
Your quick guide to MCQ practice, mock tests and your learning account.
What would you like help with?
Automated guidance only. No teacher or immediate callback is promised.
FREE PRACTICEFREE PRACTICE