业主对专有部分的（)，即业主对建筑物内的住宅、经营性用房等专有部分享有所有权，有权对专有部分占

uter from both of these methods. However, when you issue the command"show ip route" you see only the IGRP route, and not the RIP route. Why is this？（）

A. IGRP has a faster update timer.

B. IGRP has a lower administrative distance.

C. RIP has a higher metric value for that route.

D. The IGRP route has fewer hops.

E. The RIP path has a routing loop.

ning IP, IPX, and Appletalk, and you wish to utilize only one routing protocol. Which one would be the best choice？（）

A. OSPF

B. EIGRP

C. RIP v2

D. IGRP

E. RIP v1

A.4to6 routing

B.6to4 routing

C.binary routing

D.dual-stack routing

E.NextGen routing

es are redistributed into the OSPF domain. A second redistribu tion is configured on router R2 using a route map. Based on the configuration on router R2, which EIGRP external routes will be present in the routing table of R1？（）

A. the routes originating from the RIP routing domain

B. the routes originating from the OSPF stub area

C. all OSPF inter and intra - area routes

D. all routes originating from RIP and OSPF routing domains

A. CIDR

B. Split horizon

C. Authentication

D. Classless masking

E. Hold-down timers

F. Multicast routing updates

G. Path Vectoring

A. OSPF

B. RIP version 1

C. RIP version 2

D. IGRP

E. EIGRP

Protocol (RIP). RIP is the canonical example of a routing protocol built on the （71）algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an internetwork, the goal of the routers to forward packets to various （72）.

Routers running RIP send their advertisement about cost every （73） seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.

It is possible to use a range of different metrics or costs for the links in a routing protocol. RIP takes the simplest approach, with all link costs being equal （74）. Thus it always tries to find the minimum hop route. Valid distances are 1 through （75）.This also limits RIP to running on fairly small networks.

（71）

A. distance vector

B. link state

C. flooding

D. minimum spanning tree

（72）

A. computers

B. routers

C. switches

D. networks

（73）

A. 10

B. 30

C. 60

D. 180

（74）

A. 1

B. 15

C. 16

D. length of the link

（75）

A. 6

B. 10

C. 15

D. 16

otocol(RIP)．RIP is the canonical example of a routing protocol built on the (71) algorithm．Routing protocols in internetworks differ slightly from the idealized graph model．In aninternetwork，the goal of the routers to forward packets to various (72) ．

Routers running RIP send their advertisement about cost every (73) seconds．A router also sends an update message whenever an update from another router causes it to change itsrouting table．

It is possible to use a range of different metrics or costs for the links in a routing protocol．RIP takes the simplest approach，with all link costs being equal (74) Thus it always tries tofind the minimum hop route．Valid distances are 1 through (75) ．This also limits RIP torunning on fairly small networks．

（71）

A．distance vector

B．link state

C．flooding

D．minimum spanning tree

otocol(RIP)．RIP is the canonical example of a routing protocol built on the (71) algorithm．Routing protocols in internetworks differ slightly from the idealized graph model．In aninternetwork，the goal of the routers to forward packets to various (72) ．

Routers running RIP send their advertisement about cost every (73) seconds．A router also sends an update message whenever an update from another router causes it to change itsrouting table．

It is possible to use a range of different metrics or costs for the links in a routing protocol．RIP takes the simplest approach，with all link costs being equal (74) Thus it always tries tofind the minimum hop route．Valid distances are 1 through (75) ．This also limits RIP torunning on fairly small networks．

（71）

A．distance vector

B．link state

C．flooding

D．minimum spanning tree

reach the same destination via 6 different paths. All paths have the same metric and administrative distance.With all routers using the default operation,which of the paths will be chosen to reach the destination？（）

A. Only the first two paths that are learned.

B. Four of the paths.

C. All six routes in a routed robin fashion.

D. The oldest two paths in the routing table.

E. The first path learned to the destination network.