1|Page
CS6250 COMPUTER NETWORKS EXAM 2 LATEST 2026-2027 ACTUAL EXAM
WITH COMPLETE QUESTIONS AND CORRECT DETAILED ANSWERS (100%
VERIFIED ANSWERS) |ALREADY GRADED A+| ||PROFESSOR VERIFIED||
||BRANDNEW!!!||
Consider a source and destination host. Before packets leave the
source host, the host needs to define the path over which the
packets will travel to reach the destination host - ANSWER-False
Intradomain routing refers to routing that takes place among
routers that belong to the same administrative domain. In contrast
when routers belong to different administrative domains, we refer
to routing as interdomain routing - ANSWER-True
Consider the link-state routing protocol. The link costs are known
to all nodes - ANSWER-True
Consider the link-state routing protocol. The network topology is
known to all nodes - ANSWER-True
Consider the link-state routing protocol and a node u as our
source node. The goal of the algorithm is to compute the least-
,2|Page
cost paths from the source node u to every other node in the
network - ANSWER-True
Consider the link-state routing protocol with a node u as our
source node. Consider the initialization of the algorithm. We
initialize the least-cost path from node u to directly attached
neighbors to be the cost of the direct links, and for non-directly
attached neighbors we initialize the least-cost path to be infinity -
ANSWER-True
The distance vector (DV) routing algorithm continues iterating as
long as neighbors send new updates to each other - ANSWER-
True
The distance vector (DV) routing algorithm is an example of a
_________________ algorithm - ANSWER-decentralized
The distance vector (DV) routing algorithm requires
synchronization between routers - ANSWER-False
,3|Page
In the distance vector (DV) routing algorithm, each node
maintains and updates its own view of the network - ANSWER-
True
Consider the distance vector (DV) routing algorithm. Which is
used by each node to update the node's distance vector? -
ANSWER-The Bellman Ford equation
The count-to-infinity problem states that good news (e.g., a
decrease in link cost) propagates slowly among nodes in the
network - ANSWER-False
The poison reverse technique solves the count-to-infinity problem
for all network topologies - ANSWER-False
The Routing Information Protocol (RIP) is based on the Distance
Vector protocol - ANSWER-True
Open Shortest Path First (OSPF) is based on the link state
routing algorithm - ANSWER-True
, 4|Page
The number of egress points that a network has is upper
bounded, e.g. two or three egress points per network - ANSWER-
False
Consider a network with multiple egress points. Further consider
that these egress points offer different paths to the same external
destinations. Then these paths must have different costs -
ANSWER-False
According to the hot potato routing technique, it is in a network's
best interest to route the traffic so that it exits the network at the
router geographically closest to the one from which it entered the
network - ANSWER-False
Assume a source and destination host. As packets travel over a
path from the source host to the destination host the packets are
handled by multiple routers over that path. If these routers belong
to different administrative domains, they need to run the same
intradomain routing algorithm, since they are on the same path for
that pair of hosts - ANSWER-False
CS6250 COMPUTER NETWORKS EXAM 2 LATEST 2026-2027 ACTUAL EXAM
WITH COMPLETE QUESTIONS AND CORRECT DETAILED ANSWERS (100%
VERIFIED ANSWERS) |ALREADY GRADED A+| ||PROFESSOR VERIFIED||
||BRANDNEW!!!||
Consider a source and destination host. Before packets leave the
source host, the host needs to define the path over which the
packets will travel to reach the destination host - ANSWER-False
Intradomain routing refers to routing that takes place among
routers that belong to the same administrative domain. In contrast
when routers belong to different administrative domains, we refer
to routing as interdomain routing - ANSWER-True
Consider the link-state routing protocol. The link costs are known
to all nodes - ANSWER-True
Consider the link-state routing protocol. The network topology is
known to all nodes - ANSWER-True
Consider the link-state routing protocol and a node u as our
source node. The goal of the algorithm is to compute the least-
,2|Page
cost paths from the source node u to every other node in the
network - ANSWER-True
Consider the link-state routing protocol with a node u as our
source node. Consider the initialization of the algorithm. We
initialize the least-cost path from node u to directly attached
neighbors to be the cost of the direct links, and for non-directly
attached neighbors we initialize the least-cost path to be infinity -
ANSWER-True
The distance vector (DV) routing algorithm continues iterating as
long as neighbors send new updates to each other - ANSWER-
True
The distance vector (DV) routing algorithm is an example of a
_________________ algorithm - ANSWER-decentralized
The distance vector (DV) routing algorithm requires
synchronization between routers - ANSWER-False
,3|Page
In the distance vector (DV) routing algorithm, each node
maintains and updates its own view of the network - ANSWER-
True
Consider the distance vector (DV) routing algorithm. Which is
used by each node to update the node's distance vector? -
ANSWER-The Bellman Ford equation
The count-to-infinity problem states that good news (e.g., a
decrease in link cost) propagates slowly among nodes in the
network - ANSWER-False
The poison reverse technique solves the count-to-infinity problem
for all network topologies - ANSWER-False
The Routing Information Protocol (RIP) is based on the Distance
Vector protocol - ANSWER-True
Open Shortest Path First (OSPF) is based on the link state
routing algorithm - ANSWER-True
, 4|Page
The number of egress points that a network has is upper
bounded, e.g. two or three egress points per network - ANSWER-
False
Consider a network with multiple egress points. Further consider
that these egress points offer different paths to the same external
destinations. Then these paths must have different costs -
ANSWER-False
According to the hot potato routing technique, it is in a network's
best interest to route the traffic so that it exits the network at the
router geographically closest to the one from which it entered the
network - ANSWER-False
Assume a source and destination host. As packets travel over a
path from the source host to the destination host the packets are
handled by multiple routers over that path. If these routers belong
to different administrative domains, they need to run the same
intradomain routing algorithm, since they are on the same path for
that pair of hosts - ANSWER-False
