🧪 Routing MCQ Quiz Hub

Routing Mcq Question Set 3

Choose a topic to test your knowledge and improve your Routing skills

1. Sending a packet to all destinations simultaneously is called .......




2. A normal Flooding technique is an example of .........




3. In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.




4. The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is .........




5. Sending a message to a well defined group that are numerically large in size but small compared to the network as a whole is called ...........




6. ....... do not base their routing decisions on measurements or estimates of the current traffic and topology.




7. The method of network routing where every possible path between transmitting and receiving DTE is used is called .........




8. In Hierarchical routing, the routers are divided into what is called as ........




9. The regions in Hierarchical routing are grouped in to .........




10. If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as .........




11. In shortest path routing algorithm, the path length is measured based on ........




12. Flooding always choose the ........




13. In military applications where large number of routers may be blown to bits at any instant, we use .........




14. In distributed applications, it is sometimes necessary to update all the databases concurrently, we use .............




15. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .......




16. Adaptive routing algorithms get their information from .............




17. If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as .........




18. In Hierarchical routing for N router subnet, the optimal number of levels is .........




19. The router algorithm takes the decision to changes the route when ......




20. If route from router I to router J is computed on line based on the current statistics, then it is called as .........




21. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.........




22. ............. change their routing decisions to reflect changes in the topology.




23. If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ...........




24. If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ............




25. If a datagram router goes down then ..............




26. In datagram subnet new route is chosen ...........




27. The PSTN is an example of a ..................... network.




28. Each packet is routed independently in ............




29. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?




30. Eight stations are competing for the use of a shared channel using the 'Adaptive tree Walk Protocol'. If the stations 7 and 8 are suddenly become ready at once, how many bit slots are needed to resolve the contention?




31. Which of the following is the address of the router?




32. Establishing a virtual connection is functionally equivalent to




33. Which of the following characteristics is not true of NetBEUI?




34. The Routing Information Protocol (RIP) cannot have more than 15 hops if infinity is defined as




35. In Reverse Path Forwarding (RPF), the router receives a packet and extracts the




36. A routing table for classless addressing has a minimum of




37. Each node uses the shortest path tree protocol to construct its




38. In the Border Gateway Protocol (BGP), the criterion of the policy is set by the




39. A network can receive a multicast packet from a particular source only through a




40. In periodic update, a node sends its routing table normally after every




41. To convert broadcasting to multicasting, the protocol uses




42. The network layer supervises the handling of the packets by




43. The technique to simplify routing is called the




44. The idea of aggregation is similar to




45. Well-known mandatory attributes of Border Gateway Protocol (BGP) is




46. In multicast communication, the relationship is




47. In multiple unicasting, the packets are created with a relative delay in




48. Reverse Path Forwarding (RPF) does not guarantees that each network receives




49. DVMRP stands for




50. The graft message forces the upstream router to resume sending the




51. The telephone line is an example of




52. In the shortest path tree, root of a tree is a




53. In Open Shortest Path First (OSPF) terminology, a connection is called a




54. If the path from A to B is the shortest, then it is also the shortest from