R4RIN
Articles
Java 8
MCQS
Routing MCQ Quiz Hub
Routing Mcq Question Set 4
Choose a topic to test your knowledge and improve your Routing skills
1. In classless addressing, we need at least
Two Columns
Three Columns
Four Columns
Five Columns
2. We can create a sense of hierarchy in the routing tables, to solve the problems of
Gigantic re-allocate tables
Gigantic revolving tables
Gigantic routes
Gigantic routing tables
3. The designated parent router can be the router with the shortest path to the
Source
Network
Destination
Router
4. In Unicast Routing, the first column in Routing Table defines the
Data Address
Network Address
Routing Address
Protocol Address
5. In a stub link, the link is
Bi-directional
One-directional
Omni-directional
All of the Above
6. If the multicast packet has just came from the hop defined in the table, the packet has traveled the
Longest Path
Router Path
IP Path
Shortest Path
7. Reverse Path Broadcasting (RPB) guarantees each network receives a copy of the multicast packet without formation of
Protocol errors
Loops
Address errors
long strings
8. In distance vector routing, each node shares its routing table with its
Immediate neighbors
Next lane neighbors
Distant neighbors
First node neighbors
9. In path vector routing, the Internet is divided into hierarchical domains called
Autonomous networks
Autonomous systems
Autonomous links
Autonomous nodes
10. In Unicast Routing, the timer set for periodic dissemination is normally in the range of
60 Min
70 Min
80 Min
90 Min
11. In Unicast Routing, link state routing has a different philosophy from that of
Distance vector routing
Distance variable router
Distance vector rotator
Distance variable vector
12. Multicast Link State Routing is a direct extension of
Unicast routing
Multicast routing
Multiple unicast routing
Broadcast routing
13. The router sends a prune message to the upstream router so that it can exclude the corresponding
Source
Protocol
Interface
information
14. A dynamic routing table is updated periodically by using one of the dynamic routing protocols such as RIP, OSPF, or
BGP
TCPv6
IPv6
ICMPv6
15. A combination of rules and procedures that lets routers in the internet inform each other of changes, is
Routing protocols
Routing packets
Routing Path
Routing Plan
16. In Unicast Routing, a node sends its two-column routing table to its neighbors anytime there is a change in its table, is known as
Triggered Update
Periodic Update
Minimum Update
Maximum Update
17. To alleviate the problem of time needed for searching the table, the term was designed known as
Imaging
Paging
Aggregation
Congestion
18. To place the packet in its route to its destination, we use
Delayed delivery
Urgent Delivery
Forwarding
Backwarding
19. If the destination host is not on the same network as the deliverer, the packet is delivered
Randomly
Indirectly
Lastly
Direct
20. The final destination of the packet is a host connected to the same physical network as the deliverer in the
Direct Delivery
Indirect Delivery
Urgent Delivery
Delayed Delivery
21. In shortest path tree method, the tree is a graph of nodes and
Nodes of Nodes
Links
DataBits
Packets
22. Protocol Independent Multicast-Sparse Mode (PIM-SM) is similar to Core-Based Tree (CBT), but uses Simpler
Protocols
Paths
Procedures
Switches
23. In Unicast Routing, each node uses the same topology to create a routing table and the routing table for each node is
Reflective
Constant
Unique
Identical
24. RIP stands for
Rotating Information Protocol
Routing Information Path
Routing Information Packet
Routing Information Protocol
25. In RIP, to send a packet to one of the three networks at the far left, router R1 needs to deliver the packet to
R0
R3
R-1
R2
26. In Unicast Routing, the next-node column defines the address of the router to which the packet is to be sent to reach its
Station
Network
Destination
Node
27. The autonomous system has
64 Networks
32 Networks
16 Networks
8 Networks
28. In path vector routing, one node in each autonomous system that acts on behalf of the entire system is the
Header node
Footer node
Speaker node
Silent node
29. In multicast routing, each involved router needs to construct a shortest path tree for
Groups
Stations
Destination
Links
30. Protocol Independent Multicast-Dense Mode (PIM-DM) is used in a dense multicast environment, such as a
WAN
MAN
LAN
Switches
31. In Unicast Routing, a link state packet can carry a large amount of
DataBits
Links
Protocols
Information
32. The routing technique that uses a source-based tree approach is
Unicast distance vector routing
Multicast Distance Vector Routing
Multicast link state routing
Unicast link state routing
33. Reverse Path Broadcasting (RPB) guarantees that the packet reaches every
System ID
Network
Source
Header
34. Geographical Routing is used to decrease the size of
Allocating table
Addressing Table
Routing Table
Re-allocate table
35. A second technique to reduce the routing table and simplify the searching process is called
Network-Specific Method
Network-Specific Movement
Network-Specific Maintainence
Network-Specific Membership
36. In Unicast Routing, the protocol that is an implementation of the distance vector protocol is called
Border Gateway Protocol
Routing Information Protocol
Open Shortest Path First
Reverse Address Resolution Protocol
37. The Routing Information Protocol (RIP) is an intradomain routing protocol used inside an
Stable system
Autonomous system
Reversed system
Poison system
38. In the updating process of distance vector routing, the new route has distance
Zero
Minimum
Maximum
Infinity
39. In distance vector routing, sharing of information in the routing table means sharing
the whole table
only one column
Two columns
Three columns
40. Next-Hop Method is used to reduce the contents of a
Content table
Rotating Table
Routing Table
Re-allocate table
41. Border Gateway Protocol (BGP) first time appeared in
1989
1979
1969
1959
42. In path vector routing, we can divide autonomous systems into
One category
Two categories
Three categories
Four categories
43. A multihomed AS has more than one connection to other ASs, but it is still only a source for
Data sending
Data receiving
Information
Data traffic
44. In Multicast Routing Protocol, A message in the data communication can be
Unicast
Multicast
Broadcast
All of the given
45. A small local ISP is an example of
Multihomed AS.
Stub AS
Transit AS.
None of the given
46. Flooding is the technique of the
Multicast distance vector routing
Unicast distance vector routing
Multicast link state routing
Unicast link state routing
47. In Unicast Routing, the disadvantage of the distance vector routing is
Stability
Instability
Split horizon
Infinite route distance
48. In Unicast Routing, we use the shortest path tree method for finding the shortest path of the
Frames
Nodes
Packets
Networks
49. In distance vector routing, the least-cost route between any two nodes is the route with
Minimum cost
Zero distance
Maximum distance
Minimum distance
50. LMM stands for
Longest Mask Matching
Largest Mask Maintainence
Loop Mask Matching
Longest Mask Method
Submit