目前钢结构的主要连接方法是（)。A．焊缝连接B．铆钉连接C．普通螺栓连接D．高强螺栓连接

A. OSPF

B. RIP version 1

C. RIP version 2

D. IGRP

E. EIGRP

A.It has the same maximum hop count as version 1

B.It uses broadcasts for its routing updates

C.It is a classless routing protocol

D.It has a lower default administrative distance than RIP version 1

E.It supports authentication

F.It does not send the subnet mask in updates

A.Split horizon is preventing Router2 from receiving routing information from Router1.

B.Router1 is configured for RIP version 2,and Router2 is configured forRIP version 1.

C.Router1 has an ACL that is blocking RIP version 2.

D.There is a physical connectivity problem between Router1 and Router2.

E.Router1 is using authentication and Router2 is not.

WORK 2: 192.168.10.64/27NETWORK 3: 192.168.10.96/27NETWORK 4: 192.168.10.128/30NETWORK 5: 192.168.10.132/30Which of the following routing protocols will support this IP addressing scheme？（）

A. RIP version 1

B. RIP version 2

C. IGRP

D. EIGRP

E. OSPF

F. BGP

rotocol in use on the network and subnet 0 is not being used. What is the maximum number of usable IP addresses that can be supported on each LAN if the organization is using one class C address block？（）

A.8

B.6

C.30

D.32

E.14

F.16

A．IGRP

B． CDP

C． OSPF

D． RIP v1

E． RIP v2

F． EIGRP

A．[Huawei]rip[Huawei-rip-1]version 2[Huawei-rip-1]network 192.168.1.0 255.255.255.0

B．[Huawei]rip[Huawei-rip-1]version 2[Huawei-rip-1]network 192.168.1.0 24

C．[Huawei]rip[Huawei-rip-1]version 2[Huawei-rip-1]network 192.168.1.0 0.0.0.255

D．[Huawei]rip[Huawei-rip-1]version 2[Huawei-rip-1]network 192

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

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