Olete.in
Articles
Mock Tests
🧪 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 .......
Multicasting
Unicasting
Telecasting
Broadcasting
2. A normal Flooding technique is an example of .........
Multicasting
Unicasting
Telecasting
Broadcasting
3. In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.
Reverse Path forwarding
Multidestination
Flooding
Spanning tree
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 .........
Reverse Path forwarding
Spanning tree
Multidestination
Flooding
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 ...........
Unicasting
Multicasting
Broadcasting
None of these
6. ....... do not base their routing decisions on measurements or estimates of the current traffic and topology.
Non adaptive algorithms
Adaptive algorithms
Static algorithms
Recursive algorithms
7. The method of network routing where every possible path between transmitting and receiving DTE is used is called .........
Random Routing
Packet Flooding
Directory Routing
Message Switching
8. In Hierarchical routing, the routers are divided into what is called as ........
Zones
Cells
Regions
None of these
9. The regions in Hierarchical routing are grouped in to .........
Clusters
Zones
Blocks
Cells
10. If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as .........
Random flooding
Static flooding
Selective flooding
Early flooding
11. In shortest path routing algorithm, the path length is measured based on ........
time delay
number of hops
size of the routers
routing table
12. Flooding always choose the ........
Shortest path
First path
Last path
Largest path
13. In military applications where large number of routers may be blown to bits at any instant, we use .........
Shortest path first
First come first serve
Forwarding
Flooding
14. In distributed applications, it is sometimes necessary to update all the databases concurrently, we use .............
Shortest path first
First come first serve
Forwarding
Flooding
15. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .......
Binary tree
Sparse tree
Sink tree
AVL tree
16. Adaptive routing algorithms get their information from .............
only from local environment
only from adjacent routers
from locally, adjacent, external routers
only from external routers
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 .........
Dynamic routing
Session routing
Temporary routing
Static routing
18. In Hierarchical routing for N router subnet, the optimal number of levels is .........
logN
log(N -1)
lnN
ln(N-1)
19. The router algorithm takes the decision to changes the route when ......
router changes
topology changes
user changes
transmission time does not change
20. If route from router I to router J is computed on line based on the current statistics, then it is called as .........
Dynamic routing
Session routing
Temporary routing
None of these
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.........
Session routing
Circuit routing
Datagram routing
Forwarding
22. ............. change their routing decisions to reflect changes in the topology.
Nonadaptive algorithms
Adaptive algorithms
Static algorithms
Recursive algorithms
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 ...........
does not exist
optimal
maximum
Constant variables
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 ............
Routing principle
Optimality principle
Sink tree principle
Network principle
25. If a datagram router goes down then ..............
all packets will suffer
only those packets which are queued in the router at that time will suffer
only those packets which are not queued in the router at that time will suffer
no packets will suffer
26. In datagram subnet new route is chosen ...........
for every packet sent
for all the packet sent
only for the first packet
for the packet which is not transmitted
27. The PSTN is an example of a ..................... network.
packet switched
circuit switched
message switched
None of these
28. Each packet is routed independently in ............
virtual circuit subnet
short circuit subnet
datagram subnet
ATM subnet
29. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?
flooding
delta routing
static routing
hot potato routing
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?
3 slots
5 slots
7 slots
9 slots
31. Which of the following is the address of the router?
The default gateway
The TCP address
The subnet mask
The IP address
32. Establishing a virtual connection is functionally equivalent to
Connecting as virtual memory
Physically connecting a DTE and DCE
Placing a modem prior to a conversation
Placing a telephone call prior to a conversation
33. Which of the following characteristics is not true of NetBEUI?
Routable
Highly-customizable
Little configuration required
Fast for small networks to Self-tuning
34. The Routing Information Protocol (RIP) cannot have more than 15 hops if infinity is defined as
13
14
15
16
35. In Reverse Path Forwarding (RPF), the router receives a packet and extracts the
Protocol
Source Address
Destination Address
Data Type
36. A routing table for classless addressing has a minimum of
5 Columns
6 Columns
3 Columns
4 Columns
37. Each node uses the shortest path tree protocol to construct its
Connections
Routing table
Graphs
Network principle
38. In the Border Gateway Protocol (BGP), the criterion of the policy is set by the
System
User
Medium
Administrators
39. A network can receive a multicast packet from a particular source only through a
Designated parent resolver
Designated protocol router
Designated parent table
Designated parent router
40. In periodic update, a node sends its routing table normally after every
10s
20s
30s
40s
41. To convert broadcasting to multicasting, the protocol uses
Three Procedures
Two Procedures
One Procedure
Multi Procedures
42. The network layer supervises the handling of the packets by
Physical Networks
Data Networks
Application Networks
Transport Networks
43. The technique to simplify routing is called the
Network Method
Error-Control Method
Route Method
Default Method
44. The idea of aggregation is similar to
Supernetting
Subnetting
Datagram
Tunneling
45. Well-known mandatory attributes of Border Gateway Protocol (BGP) is
AS_PATH
ORIGIN
NEXT_HOP
All of the above
46. In multicast communication, the relationship is
One to one
One to many
Many to one
many to many
47. In multiple unicasting, the packets are created with a relative delay in
Large packet
Large networks
Large Databits
Large nodes
48. Reverse Path Forwarding (RPF) does not guarantees that each network receives
One Copy
Two Copies
Three Copies
Four Copies
49. DVMRP stands for
Distance Vector Multicast Range Protocol
Distance Vector Multicast Routing Packet
Distance Vector Multicast Routing Path
Distance Vector Multicast Routing Protocol
50. The graft message forces the upstream router to resume sending the
Multicast messages
Unicast messages
Multiple Unicast messages
Protocol messages
51. The telephone line is an example of
Virtual link
Stub link
Transient link
Point-to-point link
52. In the shortest path tree, root of a tree is a
Station
Addresss
Link
node
53. In Open Shortest Path First (OSPF) terminology, a connection is called a
Node
Station
Link
Backbone
54. If the path from A to B is the shortest, then it is also the shortest from
A to C
A,B to C
B to A
B to C
Submit