CS6250 COMPUTER NETWORKS REVIEW
QUIZ 2026 QUESTIONS WITH ANSWERS
GRADED A+
⩥ What is the main idea behind a link state routing algorithm? Answer:
Also called Dijkstra's Algorithm. In link state routing, the link costs and
the network topology are known to all nodes (for example by
broadcasting these values).
⩥ ● What is an example of a link state routing algorithm? Answer: Link
state routing consists of:
Initialization step: All currently known least-cost paths from (u) source
node to its direct attached neighbors.
Loop (Iterations): A loop is executed for every destination to (v) every
other node in the network. During each iteration we're looking for sets of
nodes that are NOT included in the initialization and identify the node
(w) with the least cost path from the previous iteration.
Exit: It exits by returning the shortest paths and their costs from the
source node to every other node in the network.
⩥ ● Walk through an example of the link state routing algorithm.[1] [2]
[3] [4]
I wonder if it's meant for us to go through an iteration instead of giving
the logic behind the algorithm.
Maybe, I wasn't entirely sure how to answer that one.
, I'll post a comment in piazza later today. It would be good to know if we
are going to be given some values and have to go through an iteration.
Did you ever get an answer? Answer: Initialization:
N' (set only including source node u) = {u}
for all nodes v:
If v is a neighbor of u:
Then D(v) = c(u,v)
Else:
D(v) = ∞
Loop:
Find w not in N' such that D(w) is a minimum:
Add w to N'
Update D(v) for each neighbor v of w and NOT in N':
D(v) = min( D(v), D(w) + c(w,v) )
/* new cost to v is either old cost to v or known least path cost to w plus
cost from w to v */
Exit:
Until N' = N
⩥ ● What is the computational complexity of the link state routing
algorithm? Answer: In other words, in the worst case, how many
computations are needed to find the least-cost paths from the source to
QUIZ 2026 QUESTIONS WITH ANSWERS
GRADED A+
⩥ What is the main idea behind a link state routing algorithm? Answer:
Also called Dijkstra's Algorithm. In link state routing, the link costs and
the network topology are known to all nodes (for example by
broadcasting these values).
⩥ ● What is an example of a link state routing algorithm? Answer: Link
state routing consists of:
Initialization step: All currently known least-cost paths from (u) source
node to its direct attached neighbors.
Loop (Iterations): A loop is executed for every destination to (v) every
other node in the network. During each iteration we're looking for sets of
nodes that are NOT included in the initialization and identify the node
(w) with the least cost path from the previous iteration.
Exit: It exits by returning the shortest paths and their costs from the
source node to every other node in the network.
⩥ ● Walk through an example of the link state routing algorithm.[1] [2]
[3] [4]
I wonder if it's meant for us to go through an iteration instead of giving
the logic behind the algorithm.
Maybe, I wasn't entirely sure how to answer that one.
, I'll post a comment in piazza later today. It would be good to know if we
are going to be given some values and have to go through an iteration.
Did you ever get an answer? Answer: Initialization:
N' (set only including source node u) = {u}
for all nodes v:
If v is a neighbor of u:
Then D(v) = c(u,v)
Else:
D(v) = ∞
Loop:
Find w not in N' such that D(w) is a minimum:
Add w to N'
Update D(v) for each neighbor v of w and NOT in N':
D(v) = min( D(v), D(w) + c(w,v) )
/* new cost to v is either old cost to v or known least path cost to w plus
cost from w to v */
Exit:
Until N' = N
⩥ ● What is the computational complexity of the link state routing
algorithm? Answer: In other words, in the worst case, how many
computations are needed to find the least-cost paths from the source to
