Home > IT Networking > Quizzes > Computer Networks: Network Layer - Delivery, Forwarding, and Routing MCQs
Computer Networks: Network Layer - Delivery, Forwarding, and Routing MCQs
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 23% Most missed: “In a stub link, the link is”
Computer Networks: Network Layer - Delivery, Forwarding, and Routing MCQs
Time left 00:00
25 Questions

1. A routing table for classless addressing has a minimum of
2. Next-Hop Method is used to reduce the contents of a
3. A second technique to reduce the routing table and simplify the searching process is called
4. A multihomed AS has more than one connection to other ASs, but it is still only a source for
5. Reverse Path Forwarding (RPF) eliminates the loop in the
6. If the destination host is not on the same network as the deliverer, the packet is delivered
7. The idea of aggregation is similar to
8. We can create a sense of hierarchy in the routing tables, to solve the problems of
9. Reverse Path Forwarding (RPF) does not guarantees that each network receives
10. RPF stands for
11. Multicast Open Shortest Path First (MOSPF) protocol is an extension of the
12. When the source and destination of the packet are located on the same physical network, then
13. In multicast routing, each involved router needs to construct a shortest path tree for
14. The Routing Information Protocol (RIP) is an intradomain routing protocol used inside an
15. In Multicast Routing Protocol, A message in the data communication can be
16. Protocol Independent Multicast-Sparse Mode (PIM-SM) is used in sparse multicast environment such as
17. In Unicast Routing, link state routing has a different philosophy from that of
18. In periodic update, a node sends its routing table normally after every
19. If the path from A to B is the shortest, then it is also the shortest from
20. In an autonomous system, we are dealing with routers and
21. In shortest path tree method, the tree is a graph of nodes and
22. Multicasting is more efficient than
23. A small local ISP is an example of
24. DVMRP stands for
25. In Unicast Routing, the protocol that is an implementation of the distance vector protocol is called