Olete.in – MCQs, Mock Tests & Government Job Prep | Routing Routing Mcq Question Set 3

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

1. Multicasting
2. Unicasting
3. Telecasting
4. Broadcasting

✅ Correct Answer: 4

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

1. Multicasting
2. Unicasting
3. Telecasting
4. Broadcasting

✅ Correct Answer: 4

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

✅ Correct Answer: 1

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

1. Reverse Path forwarding
2. Spanning tree
3. Multidestination
4. Flooding

✅ Correct Answer: 3

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 ...........

1. Unicasting
2. Multicasting
3. Broadcasting
4. None of these

✅ Correct Answer: 2

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

1. Non adaptive algorithms
2. Adaptive algorithms
3. Static algorithms
4. Recursive algorithms

✅ Correct Answer: 1

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

1. Random Routing
2. Packet Flooding
3. Directory Routing
4. Message Switching

✅ Correct Answer: 2

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

1. Zones
2. Cells
3. Regions
4. None of these

✅ Correct Answer: 3

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

1. Clusters
2. Zones
3. Blocks
4. Cells

✅ Correct Answer: 1

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

1. Random flooding
2. Static flooding
3. Selective flooding
4. Early flooding

✅ Correct Answer: 3

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

1. time delay
2. number of hops
3. size of the routers
4. routing table

✅ Correct Answer: 2

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

1. Shortest path
2. First path
3. Last path
4. Largest path

✅ Correct Answer: 1

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

1. Shortest path first
2. First come first serve
3. Forwarding
4. Flooding

✅ Correct Answer: 4

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

1. Shortest path first
2. First come first serve
3. Forwarding
4. Flooding

✅ Correct Answer: 4

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

1. Binary tree
2. Sparse tree
3. Sink tree
4. AVL tree

✅ Correct Answer: 3

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

1. only from local environment
2. only from adjacent routers
3. from locally, adjacent, external routers
4. only from external routers

✅ Correct Answer: 3

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 .........

1. Dynamic routing
2. Session routing
3. Temporary routing
4. Static routing

✅ Correct Answer: 4

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

1. logN
2. log(N -1)
3. lnN
4. ln(N-1)

✅ Correct Answer: 3

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

1. router changes
2. topology changes
3. user changes
4. transmission time does not change

✅ Correct Answer: 2

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

1. Dynamic routing
2. Session routing
3. Temporary routing
4. None of these

✅ Correct Answer: 1

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

1. Session routing
2. Circuit routing
3. Datagram routing
4. Forwarding

✅ Correct Answer: 1

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

1. Nonadaptive algorithms
2. Adaptive algorithms
3. Static algorithms
4. Recursive algorithms

✅ Correct Answer: 2

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 ...........

1. does not exist
2. optimal
3. maximum
4. Constant variables

✅ Correct Answer: 2

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 ............

1. Routing principle
2. Optimality principle
3. Sink tree principle
4. Network principle

✅ Correct Answer: 2

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

1. all packets will suffer
2. only those packets which are queued in the router at that time will suffer
3. only those packets which are not queued in the router at that time will suffer
4. no packets will suffer

✅ Correct Answer: 2

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

1. for every packet sent
2. for all the packet sent
3. only for the first packet
4. for the packet which is not transmitted

✅ Correct Answer: 1

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

1. packet switched
2. circuit switched
3. message switched
4. None of these

✅ Correct Answer: 2

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

1. virtual circuit subnet
2. short circuit subnet
3. datagram subnet
4. ATM subnet

✅ Correct Answer: 3

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

1. flooding
2. delta routing
3. static routing
4. hot potato routing

✅ Correct Answer: 4

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?

1. 3 slots
2. 5 slots
3. 7 slots
4. 9 slots

✅ Correct Answer: 3

Which of the following is the address of the router?

1. The default gateway
2. The TCP address
3. The subnet mask
4. The IP address

✅ Correct Answer: 1

Establishing a virtual connection is functionally equivalent to

1. Connecting as virtual memory
2. Physically connecting a DTE and DCE
3. Placing a modem prior to a conversation
4. Placing a telephone call prior to a conversation

✅ Correct Answer: 4

Which of the following characteristics is not true of NetBEUI?

1. Routable
2. Highly-customizable
3. Little configuration required
4. Fast for small networks to Self-tuning

✅ Correct Answer: 1

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

1. 13
2. 14
3. 15
4. 16

✅ Correct Answer: 4

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

1. Protocol
2. Source Address
3. Destination Address
4. Data Type

✅ Correct Answer: 2

A routing table for classless addressing has a minimum of

1. 5 Columns
2. 6 Columns
3. 3 Columns
4. 4 Columns

✅ Correct Answer: 4

Each node uses the shortest path tree protocol to construct its

1. Connections
2. Routing table
3. Graphs
4. Network principle

✅ Correct Answer: 2

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

1. System
2. User
3. Medium
4. Administrators

✅ Correct Answer: 4

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

1. Designated parent resolver
2. Designated protocol router
3. Designated parent table
4. Designated parent router

✅ Correct Answer: 4

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

1. 10s
2. 20s
3. 30s
4. 40s

✅ Correct Answer: 3

To convert broadcasting to multicasting, the protocol uses

1. Three Procedures
2. Two Procedures
3. One Procedure
4. Multi Procedures

✅ Correct Answer: 2

The network layer supervises the handling of the packets by

1. Physical Networks
2. Data Networks
3. Application Networks
4. Transport Networks

✅ Correct Answer: 1

The technique to simplify routing is called the

1. Network Method
2. Error-Control Method
3. Route Method
4. Default Method

✅ Correct Answer: 4

The idea of aggregation is similar to

1. Supernetting
2. Subnetting
3. Datagram
4. Tunneling

✅ Correct Answer: 2

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

1. AS_PATH
2. ORIGIN
3. NEXT_HOP
4. All of the above

✅ Correct Answer: 4

In multicast communication, the relationship is

1. One to one
2. One to many
3. Many to one
4. many to many

✅ Correct Answer: 2

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

1. Large packet
2. Large networks
3. Large Databits
4. Large nodes

✅ Correct Answer: 1

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

1. One Copy
2. Two Copies
3. Three Copies
4. Four Copies

✅ Correct Answer: 1

DVMRP stands for

1. Distance Vector Multicast Range Protocol
2. Distance Vector Multicast Routing Packet
3. Distance Vector Multicast Routing Path
4. Distance Vector Multicast Routing Protocol

✅ Correct Answer: 4

The graft message forces the upstream router to resume sending the

1. Multicast messages
2. Unicast messages
3. Multiple Unicast messages
4. Protocol messages

✅ Correct Answer: 1

The telephone line is an example of

1. Virtual link
2. Stub link
3. Transient link
4. Point-to-point link

✅ Correct Answer: 4

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

1. Station
2. Addresss
3. Link
4. node

✅ Correct Answer: 4

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

1. Node
2. Station
3. Link
4. Backbone

✅ Correct Answer: 3

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

1. A to C
2. A,B to C
3. B to A
4. B to C

✅ Correct Answer: 3