Module 3: Practice Quiz

Question 1

What does intradomain routing involve?

Answer 1

All nodes and subnets owned and managed by the same organization.

Question 2

What could the weights on the graph edges represent in intradomain routing?

Answer 2

Length of the cable
Time delay to traverse the link
Monetary cost
Business relationships
Link capacity
Current load on the link

Question 3

A packet is _______ when it is moved from a router’s input link to the appropriate link.

Answer 3

Forwarded

Question 4

Which action is network-wide, involving multiple routers?

Answer 4

Routing

Question 5

Intradomain routing must involve multiple administrative domains.

True/False

Answer 5

False

Question 6

In Dijkstra’s algorithm, are all nodes in a network aware of the entire network topology only after the algorithm’s termination?

True/False

Answer 6

False

Question 7

What is the cost to node e from node b using Dijkstra’s algorithm?

Answer 7

8

Question 8

Select the words that can be used to describe the distance vector algorithm.

Answer 8

Distributed
Iterative
Asynchronous

Question 9

Which of the following can cause the count-to-infinity problem?

Answer 9

Routing Loops

Question 10

What type of routing algorithm is Dijkstra’s algorithm?

Answer 10

Global, Link-state

Question 11

The Bellman Ford equation is used by the _______ algorithm.

Answer 11

Distance-vector

Question 12

The Routing Information Protocol (RIP) is an example of what type of algorithm?

Answer 12

A distance vector algorithm
An intradomain routing algorithm

Question 13

There may be multiple egress points from an administrative domain to an external destination.

Answer 13

True

Question 14

Hot potato routing always selects the egress point that is geographically closest to the ingress point.

Answer 14

False