This set of Data communication and Networking Multiple Choice Questions and Answers (MCQs) focuses on “Networking and Internetworking Devices – Link State Routing ”.
1. 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
2. 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
3. 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
4. In link state 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
5. In link state routing, the updating packets are sent ________________.
- periodically
- when there is a change
- either a or b
- neither a nor b
6. In link state routing, the routing table for each router is ___________ other routers
- the same as
- different from
- either a or b
- neither a nor b
7. In link state routing, the link state database for each router is ___________ other routers
- the same as
- different from
- either a or b
- neither a nor b
8. If we have to enter the entries in the bridge table manually, the bridge is a ____________ bridge.
- simple
- transparent
- either a or b
- neither a nor b
9. If we do not have to enter the entries in the bridge table manually, the bridge is a ____________ bridge.
- simple
- transparent
- either a or b
- neither a nor b
10. If a bridge is connected to 5 networks, it is called a ___________ bridge.
- complex
- multiport
- either a or b
- neither a nor b
11. The calculation time for the distance vector routing algorithm is _________ the one for the link state routing.
- more than
- less than
- equal to
- none of the above
12. The storage media for the distance vector routing algorithm is _________ the one for the link state routing.
- more than
- less than
- equal to
- none of the above
13. The Dijkstra algorithm is used in ___________ routing to find the shortest path tree.
- distance vector
- link state
- both a and b
- neither a nor b
14. The Dijkstra algorithm finds the shortest path using the ____________ cost.
- absolute
- relative
- cumulative
- cost
15. In the Dijkstra algorithm the process of finding the shortest path starts with a tree with _______ node(s).
- 3
- 2
- 1
- none of the above
16. In the Dijkstra algorithm the shortest path tree has _______ loop(s).
- no
- only one
- an unlimited number of
- none of the above