Routing Protocols Mcqs with answers

Multiple Choice Questions (MCQ) should be practiced to improve the Cyber Security skills required for various Tests like NTS, ECAT, University Entrance Tests and interviews (campus interview, walk-in interview, company interview), placements, entrance exams and other competitive examinations.

1.
The size of an updating packet in distance vector routing is normally ___________ the size of an updating packet in a link state routing.

smaller than

larger than

the same as

none of the above

2.
In distance vector routing, the updating packet conveys the knowledge of the router about ________________.

the whole internetwork

the neighborhood

either a or b

neither a nor b

3.
In distance vector routing, a router sends its updating packet ______________.

only to its neighbors

to every other router in the internetwork (through flooding)

either a or b

neither a nor b

4.
In distance vector routing, the updating packets are sent ________________.

periodically

when there is a change

either a or b

neither a nor b

5.
In distance vector routing, if a router is connected to three networks, its original table contains _________ entries.

no

one

three

none of the above

6.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from C with a route to N as Destination: N, Hop Count: 6. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 7, Next Hop: C

Destination: N, Hop Count: 6, Next Hop: C

none of the above

7.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from C with a route to N as Destination: N, Hop Count: 5. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 6, Next Hop: C

Destination: N, Hop Count: 5, Next Hop: C

none of the above

8.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from C with a route to N as Destination: N, Hop Count: 8. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 8, Next Hop: C

Destination: N, Hop Count: 9, Next Hop: C

none of the above

9.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from B with a route to N as Destination: N, Hop Count: 4. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 4, Next Hop: B

Destination: N, Hop Count: 5, Next Hop: C

none of the above

10.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from B with a route to N as Destination: N, Hop Count: 9. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 9, Next Hop: B

Destination: N, Hop Count: 10, Next Hop: B

none of the above

11.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from C with a route to N as Destination: N, Hop Count: 7. The new route to N should be _______________.

Destination: N, Hop Count: 7, Next Hop: B

Destination: N, Hop Count: 7, Next Hop: C

Destination: N, Hop Count: 6, Next Hop: C

none of the above

12.
In distance vector routing, the routing table for each router is ___________ other routers

the same as

different from

either a or b

neither a nor b

13.
A switch that waits until the whole packet has arrived before making routing decision, is called a _________ switch.

store-and-forward

cut-through

simple

none of the above

14.
In link state routing, the updating packet conveys the knowledge of the router about ________________.

the whole internetwork

the neighborhood

either a or b

neither a nor b

15.
A switch that makes routing decision as soon as the destination address has arrived is called a _________switch.

store-and-forward

cut-through

simple

none of the above

0Shares
0
Scroll to Top