CS 6250 EXAM 1 | COMPUTER NETWORK
EXAM 1 | QUESTIONS AND ANSWERS
RATED A+ | 2025/2026 GUIDE
T/F: the count-to-infinity problem states that good news propagates
slowly among nodes in the network - Correct Answer - false
T/F: the poison reverse technique solves the count-to-infinity problem for
all network topologies - Correct Answer - false
T/F: the routing information protocol (RIP) is based on the distance
vector protocol - Correct Answer - true
T/F: open shortest path first (OSPF) is based on the link state routing
algorithm - Correct Answer - true
T/F: the number of egress points that a network has is upper bounded -
Correct Answer - false
T/F: consider a network with multiple egress points. further consider that
these egress points offer different paths to the same external conditions.
then these paths must have different costs - Correct Answer - false
,T/F: 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 form which it entered the network -
Correct Answer - false
T/F: assume a source and destination host. as packets travel over a path
from the source 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 intra-domain routing
algorithm, since they are on the same path for that pair of hosts - Correct
Answer - false
a packet is _____ when it is moved from a router's input link to the
appropriate link - Correct Answer - forwarded
which action is network-wide? (involving multiple routers) - Correct
Answer - routing
T/F: intra-domain routing involves multiple administrative domains -
Correct Answer - false
T/F: upon termination of Dijkstra's algorithm, all nodes in a network are
aware of the entire network topology - Correct Answer - true
select the terms describing the distance vector algorithm:
, - distributed
- centralized
- iterative
- asynchronous
- synchronous
- non-terminating - Correct Answer - distributed, iterative, asynchronous
what can cause the count-to-infinity problem? - Correct Answer - routing
loops
Dijkstra's algorithm is a _____ algorithm, also referred to as a _____
algorithm - Correct Answer - global, link-state
the bellman-ford equation is used by the _____ algorithm - Correct
Answer - distance vector
the Routing Information Protocol (RIP) is an example of:
- a link-state algorithm
- a distance-vector algorithm
- poison reverse
- an inter-domain routing algorithm
- an intra-domain routing algorithm - Correct Answer - - a distance vector
algorithm
EXAM 1 | QUESTIONS AND ANSWERS
RATED A+ | 2025/2026 GUIDE
T/F: the count-to-infinity problem states that good news propagates
slowly among nodes in the network - Correct Answer - false
T/F: the poison reverse technique solves the count-to-infinity problem for
all network topologies - Correct Answer - false
T/F: the routing information protocol (RIP) is based on the distance
vector protocol - Correct Answer - true
T/F: open shortest path first (OSPF) is based on the link state routing
algorithm - Correct Answer - true
T/F: the number of egress points that a network has is upper bounded -
Correct Answer - false
T/F: consider a network with multiple egress points. further consider that
these egress points offer different paths to the same external conditions.
then these paths must have different costs - Correct Answer - false
,T/F: 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 form which it entered the network -
Correct Answer - false
T/F: assume a source and destination host. as packets travel over a path
from the source 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 intra-domain routing
algorithm, since they are on the same path for that pair of hosts - Correct
Answer - false
a packet is _____ when it is moved from a router's input link to the
appropriate link - Correct Answer - forwarded
which action is network-wide? (involving multiple routers) - Correct
Answer - routing
T/F: intra-domain routing involves multiple administrative domains -
Correct Answer - false
T/F: upon termination of Dijkstra's algorithm, all nodes in a network are
aware of the entire network topology - Correct Answer - true
select the terms describing the distance vector algorithm:
, - distributed
- centralized
- iterative
- asynchronous
- synchronous
- non-terminating - Correct Answer - distributed, iterative, asynchronous
what can cause the count-to-infinity problem? - Correct Answer - routing
loops
Dijkstra's algorithm is a _____ algorithm, also referred to as a _____
algorithm - Correct Answer - global, link-state
the bellman-ford equation is used by the _____ algorithm - Correct
Answer - distance vector
the Routing Information Protocol (RIP) is an example of:
- a link-state algorithm
- a distance-vector algorithm
- poison reverse
- an inter-domain routing algorithm
- an intra-domain routing algorithm - Correct Answer - - a distance vector
algorithm
