Question 1

If a datagram router goes down then …………..
A)all packets will suffer
B)only those packets which are queued in the router at that time will suffer
C)only those packets which are not queued in the router at that time will suffer

Accepted Answer

Only the packets that are queued in the router at the time it goes down will suffer because they cannot be forwarded to their destination. Packets not yet arrived at the router or being routed through different paths are unaffected.

Question 2

In datagram subnet new route is chosen …………………
A)for every packet sent
B)for all the packet sent
C)only for the first packet

Accepted Answer

In a datagram subnet, a new route can be chosen for every packet sent, allowing for dynamic routing decisions to be made for each individual packet. This contrasts with virtual circuit approaches where the route is determined only once for the entire session.

Question 3

For a connection oriented service, we need a ……………
A)virtual circuit subnet
B)short circuit subnet
C)datagram subnet

Accepted Answer

C

Question 4

In ………………, each packet of a message follows the same path from sender to receiver.
A)circuit switching
B)message switching
C)virtual approach to packet switching

Accepted Answer

In circuit switching, a dedicated communication path between two stations is established (like a circuit) for the duration of the transmission. All packets (or data) follow this same path, ensuring a consistent and exclusive route for the duration of the call or data session.

Question 5

A permanent virtual circuit involves ……………..
A)connection establishment
B)data transfer
C)connection release

Accepted Answer

The answer of A permanent virtual circuit involves ……………..
A)connection establishment
B)data...

Question 6

The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as ……………..
A)binary tree
B)sparse tree
C)sink tree

Accepted Answer

A sink tree is a tree structure where all paths lead to a single destination node, making it the optimal structure for representing routes from all sources to a given destination in a rooted tree.

Question 7

Adaptive routing algorithms get their information from ………….
A)only from local environment
B)only from adjacent routers
C)from locally, adjacent, external routers

Accepted Answer

Adaptive routing algorithms adjust their routing decisions based on changes in the network topology. They can gather information from a variety of sources, including the local environment, adjacent routers, and external routers, to make informed decisions about the best paths for data packets. This allows for more flexible and efficient routing compared to static routing methods.

Question 8

In Hierarchical routing for N router subnet, the optimal number of levels is …………..
A)log n
B)log(n -1)
C)ln n

Accepted Answer

The answer of In Hierarchical routing for N router subnet,...

Question 9

The router algorithm takes the decision to changes the route when ……………..
A)router changes
B)topology changes
C)user changes

Accepted Answer

The router algorithm decides to change the route primarily when the network topology changes. This could be due to various reasons such as a new router being added, an existing router failing, or changes in the network links (e.g., a link going down or coming up). These changes affect the path that data packets take to reach their destination, necessitating a route update.

Question 10

If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..
A)dynamic routing
B)session routing
C)temporary routing

Accepted Answer

Dynamic routing involves routers determining the best path between any two networks based on the current network conditions, such as traffic load or link failures. This process is done in real-time or "on the line," making adjustments as network conditions change.

Question 11

If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..
A)session routing
B)circuit routing
C)datagram routing

Accepted Answer

The answer of If the subnet uses virtual circuits internally,...

Question 12

…………….. change their routing decisions to reflect changes in the topology.
A)nonadaptive algorithms
B)adaptive algorithms
C)static algorithms

Accepted Answer

Adaptive algorithms change their routing decisions based on changes in the network topology, such as link failures or congestion, to find the most efficient route.

Question 13

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 ………………..
A)routing principle
B)optimality principle
C)sink tree principle

Accepted Answer

The optimality principle states that if router J is on the optimal path from router I to router K, then the optimal path from J to K must also follow the same route. This principle is fundamental in the design and operation of routing algorithms in networks.

Question 14

……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.
A)non adaptive algorithms
B)adaptive algorithms
C)static algorithms

Accepted Answer

Non-adaptive algorithms do not consider current traffic conditions or network topology changes when making routing decisions.

Question 15

The method of network routing where every possible path between transmitting and receiving DTE is used is called ……………
A)random routing
B)packet flooding
C)directory routing

Accepted Answer

Packet flooding is a routing technique where every incoming packet is sent through every outgoing line except the one it arrived on. It ensures that the packet will reach its destination by exploring all possible paths.

Question 16

In Hierarchical routing, the routers are divided into what is called as ……………..
A)zones
B)cells
C)regions

Accepted Answer

In hierarchical routing, routers are divided into regions to manage routing more efficiently by reducing the size of routing tables and limiting the scope of route advertisements.

Question 17

The regions in Hierarchical routing are grouped in to ……………..
A)clusters
B)zones
C)blocks

Accepted Answer

Hierarchical routing often involves grouping nodes into clusters to manage routing more efficiently and to reduce the size of routing tables.

Question 18

The Clusters in Hierarchical routing are grouped in to ………………
A)clusters
B)zones
C)blocks

Accepted Answer

In hierarchical routing, clusters are typically grouped into zones to manage the network more efficiently and to facilitate scalable routing strategies.

Question 19

If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as ……………..
A)random flooding
B)static flooding
C)selective flooding

Accepted Answer

This behavior is known as selective flooding. In selective flooding, a router forwards packets only through the paths that are heading towards the packet's destination, rather than broadcasting the packet on all paths. This approach reduces network congestion and improves efficiency by avoiding unnecessary duplication of packets.

Question 20

To do multicast routing, each router computes a …………………
A)binary tree
B)avl tree
C)spanning tree

Accepted Answer

For multicast routing, routers compute a spanning tree to efficiently route packets to multiple destinations within a network. This approach ensures that packets are delivered to all members of a multicast group through the most efficient path without unnecessary duplication.

Quiz 1: Routing and Subnetting

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

In datagram subnet new route is chosen …………………

For a connection oriented service, we need a ……………

In ………………, each packet of a message follows the same path from sender to receiver.

A permanent virtual circuit involves ……………..

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

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

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

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

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

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

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

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

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

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

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

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

The Clusters in Hierarchical routing are grouped in to ………………

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

To do multicast routing, each router computes a …………………