1. Home
  2. Back Today Date :- Friday 6th of March 2026 04:29:56 AM

Routing - Online Exam Test Papers | Routing - MCQs[multiple choice questions and answers ] | Routing - Mock Test Papers | Routing - Practice Papers | Routing - Sample Test Papers |

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

1.Reverse Path forwarding

2. Multidestination

3.Flooding

4.Spanning tree

Posted Date:-2022-02-21 12:09:11

More MCQS Questions and answers

  1. In distributed applications, it is sometimes necessary to update all the databases concurrently, we use .............
  2. In shortest path routing algorithm, the path length is measured based on ........
  3. ....... do not base their routing decisions on measurements or estimates of the current traffic and topology.
  4. ............. change their routing decisions to reflect changes in the topology.
  5. A network can receive a multicast packet from a particular source only through a
  6. A normal Flooding technique is an example of .........
  7. A routing table for classless addressing has a minimum of
  8. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?
  9. Adaptive routing algorithms get their information from .............
  10. DVMRP stands for
  11. Each node uses the shortest path tree protocol to construct its
  12. Each packet is routed independently in ............
  13. 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?
  14. Establishing a virtual connection is functionally equivalent to
  15. Flooding always choose the ........
  16. If a datagram router goes down then ..............
  17. If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as .........
  18. If route from router I to router J is computed on line based on the current statistics, then it is called as .........
  19. 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 ............
  20. 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 ...........
  21. If the path from A to B is the shortest, then it is also the shortest from
  22. 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 .........
  23. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.........
  24. In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.
  25. In datagram subnet new route is chosen ...........
  26. In Hierarchical routing for N router subnet, the optimal number of levels is .........
  27. In Hierarchical routing, the routers are divided into what is called as ........
  28. In military applications where large number of routers may be blown to bits at any instant, we use .........
  29. In multicast communication, the relationship is
  30. In multiple unicasting, the packets are created with a relative delay in
  31. In Open Shortest Path First (OSPF) terminology, a connection is called a
  32. In periodic update, a node sends its routing table normally after every
  33. In Reverse Path Forwarding (RPF), the router receives a packet and extracts the
  34. In the Border Gateway Protocol (BGP), the criterion of the policy is set by the
  35. In the shortest path tree, root of a tree is a
  36. Reverse Path Forwarding (RPF) does not guarantees that each network receives
  37. 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 ...........
  38. Sending a packet to all destinations simultaneously is called .......
  39. The graft message forces the upstream router to resume sending the
  40. The idea of aggregation is similar to
  41. The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is .........
  42. The method of network routing where every possible path between transmitting and receiving DTE is used is called .........
  43. The network layer supervises the handling of the packets by
  44. The PSTN is an example of a ..................... network.
  45. The regions in Hierarchical routing are grouped in to .........
  46. The router algorithm takes the decision to changes the route when ......
  47. The Routing Information Protocol (RIP) cannot have more than 15 hops if infinity is defined as
  48. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .......
  49. The technique to simplify routing is called the
  50. The telephone line is an example of
  51. To convert broadcasting to multicasting, the protocol uses
  52. Well-known mandatory attributes of Border Gateway Protocol (BGP) is
  53. Which of the following characteristics is not true of NetBEUI?
  54. Which of the following is the address of the router?
Search