 |
1 |  |  A static table is one _______. |
|  | A) | with manual entries |
|  | B) | which is updated automatically |
|  | C) | either a or b |
|  | D) | none of the above |
 |
 |
2 |  |  A dynamic table is one _______. |
|  | A) | with manual entries |
|  | B) | which is updated automatically |
|  | C) | either a or b |
|  | D) | none of the above |
 |
 |
3 |  |  For purposes of routing, the Internet is divided into ___________. |
|  | A) | wide area networks |
|  | B) | autonomous networks |
|  | C) | autonomous systems |
|  | D) | none of the above |
 |
 |
4 |  |  ____________ is a group of networks and routers under the authority of a single administration. |
|  | A) | An autonomous system |
|  | B) | An area |
|  | C) | a and b |
|  | D) | none of the above |
 |
 |
5 |  |  Routing inside an autonomous system is referred to as _______________. |
|  | A) | interdomain routing |
|  | B) | intradomain routing |
|  | C) | both a and b |
|  | D) | none of the above |
 |
 |
6 |  |  Routing between autonomous systems is referred to as ____________. |
|  | A) | interdomain routing |
|  | B) | intradomain routing |
|  | C) | both a and b |
|  | D) | none of the above |
 |
 |
7 |  |  In _______ routing, the least cost route between any two nodes is the route with the minimum distance. |
|  | A) | path vector |
|  | B) | distance vector |
|  | C) | link state |
|  | D) | none of the above |
 |
 |
8 |  |  In ________, each node maintains a vector (table) of minimum distances to every node. |
|  | A) | path vector |
|  | B) | distance vector |
|  | C) | link state |
|  | D) | none of the above |
 |
 |
9 |  |  In distance vector routing, each node periodically shares its routing table with _________ and whenever there is a change. |
|  | A) | every other node |
|  | B) | its immediate neighbors |
|  | C) | one neighbor |
|  | D) | none of the above |
 |
 |
10 |  |  The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing. |
|  | A) | distance vector |
|  | B) | link state |
|  | C) | path vector |
|  | D) | none of the above |
 |
 |
11 |  |  The metric used by _______ is the hop count. |
|  | A) | OSPF |
|  | B) | RIP |
|  | C) | BGP |
|  | D) | none of the above |
 |
 |
12 |  |  In RIP, the ________ timer controls the advertising of regular update messages. |
|  | A) | garbage collection |
|  | B) | expiration |
|  | C) | periodic |
|  | D) | none of the above |
 |
 |
13 |  |  In RIP, the ________ timer is used to purge invalid routes from the table. |
|  | A) | garbage collection |
|  | B) | expiration |
|  | C) | periodic |
|  | D) | none of the above |
 |
 |
14 |  |  In RIP, the ________ timer controls the validity of the route. |
|  | A) | garbage collection |
|  | B) | expiration |
|  | C) | periodic |
|  | D) | none of the above |
 |
 |
15 |  |  RIP uses the services of _______. |
|  | A) | TCP |
|  | B) | UDP |
|  | C) | IP |
|  | D) | none of the above |
 |
 |
16 |  |  The _________ routing uses the Dijkstra algorithm to build a routing table. |
|  | A) | distance vector |
|  | B) | link state |
|  | C) | path vector |
|  | D) | none of the above |
 |
 |
17 |  |  The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing. |
|  | A) | distance vector |
|  | B) | link state |
|  | C) | path vector |
|  | D) | none of the above |
 |
 |
18 |  |  The _______ protocol allows the administrator to assign a cost, called the metric, to each route. |
|  | A) | OSPF |
|  | B) | RIP |
|  | C) | BGP |
|  | D) | none of the above |
 |
 |
19 |  |  In OSPF, a ________ link connects two routers without any other host or router in between. |
|  | A) | point-to-point |
|  | B) | transient |
|  | C) | stub |
|  | D) | none of the above |
 |
 |
20 |  |  In OSPF, a _______ link is a network with several routers attached to it. |
|  | A) | point-to-point |
|  | B) | transient |
|  | C) | stub |
|  | D) | none of the above |
 |
 |
21 |  |  In OSPF, a ________ link is a network is connected to only one router. |
|  | A) | point-to-point |
|  | B) | transient |
|  | C) | stub |
|  | D) | none of the above |
 |
 |
22 |  |  In OSPF, when the link between two routers is broken, the administration may create a _________ link between them using a longer path that probably goes through several routers. |
|  | A) | point-to-point |
|  | B) | transient |
|  | C) | stub |
|  | D) | none of the above |
 |
 |
23 |  |  In OSPF, a ________ defines the links of a true router. |
|  | A) | network link |
|  | B) | router link |
|  | C) | summary link to network |
|  | D) | none of the above |
 |
 |
24 |  |  In OSPF, a ________ defines the links of a network. |
|  | A) | network link |
|  | B) | router link |
|  | C) | summary link to network |
|  | D) | none of the above |
 |
 |
25 |  |  In OSPF, an area border router advertises a ____________ LSA. |
|  | A) | network link |
|  | B) | router link |
|  | C) | summary link to network |
|  | D) | none of the above |
 |
 |
26 |  |  OSPF uses the _______ message to create neighborhood relationships and to test the reachability of neighbors. |
|  | A) | link state request |
|  | B) | database description |
|  | C) | link state update |
|  | D) | none of the above |
 |
 |
27 |  |  In OSPF, the ________ message does not contain complete database information; it only gives an outline, the title of each line in the database. |
|  | A) | link state request |
|  | B) | database description |
|  | C) | link state update |
|  | D) | none of the above |
 |
 |
28 |  |  In OSPF, a _________ message is sent by a router that needs information about a specific route or routes. |
|  | A) | link state request |
|  | B) | database description |
|  | C) | link state update |
|  | D) | none of the above |
 |
 |
29 |  |  In ________ routing, we assume that there is one node (or more) in each autonomous system that acts on behalf of the entire autonomous system. |
|  | A) | distant vector |
|  | B) | path vector |
|  | C) | link state |
|  | D) | none of the above |
 |
 |
30 |  |  ___________ is an interdomain routing protocol using path vector routing. |
|  | A) | BGP |
|  | B) | RIP |
|  | C) | OSPF |
|  | D) | none of the above |
 |
 |
31 |  |  BGP can have two types of sessions: _______ and ________ sessions. |
|  | A) | E-BGP; A-BGP |
|  | B) | I-BGP; C-BGP |
|  | C) | E-BGP; I-BGP |
|  | D) | none of the above |
 |
 |
32 |  |  To create a neighborhood relationship, a router running BGP sends an ________ message. |
|  | A) | open |
|  | B) | update |
|  | C) | keepalive |
|  | D) | none of the above |
 |
 |
33 |  |  In BGP, the _______ message is used by a router to withdraw destinations that have been advertised previously, or to announce a route to a new destination, or both. |
|  | A) | open |
|  | B) | update |
|  | C) | keepalive |
|  | D) | none of the above |
 |
 |
34 |  |  The routers running the BGP protocols exchange _______ messages regularly to tell each other that they are alive. |
|  | A) | open |
|  | B) | update |
|  | C) | keepalive |
|  | D) | none of the above |
 |
 |
35 |  |  In BGP, a _______ message is sent by a router whenever an error condition is detected or a router wants to close the connection. |
|  | A) | open |
|  | B) | update |
|  | C) | keepalive |
|  | D) | none of the above |
 |
 |
36 |  |  BGP messages are encapsulated in _______. |
|  | A) | TCP segments |
|  | B) | UDP user datagrams |
|  | C) | IP datagrams |
|  | D) | none of the above |
 |
 |
37 |  |  An area is _______. |
|  | A) | part of an AS |
|  | B) | composed of at least two ASs |
|  | C) | another term for an AS |
|  | D) | none of the above |
 |