ads

Solved MCQ on Routing algorithm in computer networks set-2


1) Alternate and adaptive routing algorithm belongs to ..........

A. static routing

B. permanent routing

C. standard routing

D. dynamic routing


2) .......... protocol is a popular example of a link state routing protocol.

A. SPF

B. BGP

C. RIP

D. OSPF


3) An example of routing algorithm is ...

A. TELNET

B. TNET

C. ARPANET

D. ARNET


4) The Enhanced Interior Gateway Routing Protocol(EIGRP) is categorized as a ........

A. Distance vector routing protocols

B. Link state routing protocols

C. Hybrid routing protocols

D. Automatic state routing protocols


5) In .......... routing, the routing table hold the address of just the next hop instead of complete route information.

A. next-hop

B. host-specific

C. network-specific

D. default


6) .......... was originally developed to provide a loop-free method of exchanging routing information between autonomous systems.

A. OSPF

B. EIGRP

C. BGP

D. RIP


7) In ............ routing, the destination address is a network address in the routing tables.

A. next-hop

B. host-specific

C. network-specific

D. default


8) Logical partitioning of the network, authentication and faster convergence rate are the advantages of ....

A. OSPF

B. EIGRP

C. BGP

D. RIP


9) The .......... flag indicates the availability of a router.

A. up

B. host specific

C. gateway

D. added by redirection


10) The types of autonomous system defined by BGP is/are ..

A. Stub

B. Multi-homed

C. Transit

D. All of the above


11) For a direct deliver, the ........ flag is on.

A. up

B. host specific

C. gateway

D. added by redirection


12) A .......... AS has connections to two or more autonomous systems and carries both local and transit traffic.

A. Stub

B. Multi-homed

C. Transit

D. All of the above


13) In unicast routing, each router in the domain has a table that defines a ......... path tree to possible destinations.

A. average

B. longest

C. shortest

D. very longest


14) .............. supports the simultaneous use of multiple unequal cost paths to a destination.

A. OSPF

B. EIGRP

C. BGP

D. RIP


15) In multicast routing, each involved router needs to construct a ......... path tree for each group.

A. average

B. longest

C. shortest

D. very longest


16) Which of the following is/are the benefits provided by EIGRP?

i) Faster convergence

ii) partial routing updates

iii) High bandwidth utilization

iv) Route summarization

A. i, iii and iv only

B. i, ii and iii only

C. ii, iii and iv only

D. i, ii and iv only


17) In OSPF, a .......... link is a network is connected to only one router.

A. point-to-point

B. transient

C. stub

D. multipoint


18) ......... is the process of consolidating multiple contiguous routing entries into a single advertisement.

A. Faster convergence

B. Partial routing updates

C. Route summarization

D. Multiple protocols


19) 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. multipoint


20) ........... is the process of introducing external routers into an OSPF network.

A. Route redistribution

B. Route summarization

C. Route reintroducing

D. Route recreation


Answers:

1) D. dynamic routing
2) D. OSPF
3) C. ARPANET
4) C. Hybrid routing protocols
5) A. next-hop
6) C. BGP
7) C. network-specific
8) A. OSPF
9) D. added by redirection
10) D. All of the above
11) C. gateway
12) C. Transit
13) C. shortest
14) B. EIGRP
15) C. shortest
16) D. i, ii and iv only
17) C. stub
18) C. Route summarization
19) D. multipoint
20) A. Route redistribution



Related Posts:

For more MCQ's on Computer Networks: Click Here