Routing/Routing Mcq Question Set 4 Sample Test,Sample questions

Question:
A combination of rules and procedures that lets routers in the internet inform each other of changes, is

1.Routing protocols

2.Routing packets

3. Routing Path

4.Routing Plan


Question:
A dynamic routing table is updated periodically by using one of the dynamic routing protocols such as RIP, OSPF, or

1.BGP

2. TCPv6

3.IPv6

4.ICMPv6


Question:
A multihomed AS has more than one connection to other ASs, but it is still only a source for

1.Data sending

2.Data receiving

3. Information

4.Data traffic


Question:
A second technique to reduce the routing table and simplify the searching process is called

1.Network-Specific Method

2.Network-Specific Movement

3.Network-Specific Maintainence

4.Network-Specific Membership


Question:
A small local ISP is an example of

1.Multihomed AS.

2.Stub AS

3.Transit AS.

4.None of the given


Question:
Border Gateway Protocol (BGP) first time appeared in

1. 1989

2. 1979

3.1969

4.1959


Question:
Flooding is the technique of the

1.Multicast distance vector routing

2.Unicast distance vector routing

3.Multicast link state routing

4.Unicast link state routing


Question:
Geographical Routing is used to decrease the size of

1. Allocating table

2.Addressing Table

3.Routing Table

4.Re-allocate table


Question:
If the destination host is not on the same network as the deliverer, the packet is delivered

1.Randomly

2.Indirectly

3.Lastly

4.Direct


Question:
If the multicast packet has just came from the hop defined in the table, the packet has traveled the

1.Longest Path

2.Router Path

3.IP Path

4.Shortest Path


Question:
In a stub link, the link is

1.Bi-directional

2. One-directional

3.Omni-directional

4. All of the Above


Question:
In classless addressing, we need at least

1.Two Columns

2. Three Columns

3.Four Columns

4.Five Columns


Question:
In distance vector routing, each node shares its routing table with its

1.Immediate neighbors

2.Next lane neighbors

3.Distant neighbors

4.First node neighbors


Question:
In distance vector routing, sharing of information in the routing table means sharing

1.the whole table

2. only one column

3.Two columns

4.Three columns


Question:
In distance vector routing, the least-cost route between any two nodes is the route with

1. Minimum cost

2. Zero distance

3.Maximum distance

4.Minimum distance


Question:
In Multicast Routing Protocol, A message in the data communication can be

1.Unicast

2. Multicast

3.Broadcast

4.All of the given


Question:
In multicast routing, each involved router needs to construct a shortest path tree for

1.Groups

2.Stations

3.Destination

4.Links


Question:
In path vector routing, one node in each autonomous system that acts on behalf of the entire system is the

1.Header node

2.Footer node

3.Speaker node

4.Silent node


Question:
In path vector routing, the Internet is divided into hierarchical domains called

1. Autonomous networks

2.Autonomous systems

3.Autonomous links

4.Autonomous nodes


Question:
In path vector routing, we can divide autonomous systems into

1.One category

2.Two categories

3.Three categories

4.Four categories


Question:
In RIP, to send a packet to one of the three networks at the far left, router R1 needs to deliver the packet to

1. R0

2.R3

3. R-1

4.R2


Question:
In shortest path tree method, the tree is a graph of nodes and

1. Nodes of Nodes

2.Links

3.DataBits

4.Packets


Question:
In the updating process of distance vector routing, the new route has distance

1. Zero

2.Minimum

3.Maximum

4. Infinity


Question:
In Unicast Routing, a link state packet can carry a large amount of

1.DataBits

2.Links

3.Protocols

4. Information


Question:
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

1.Triggered Update

2.Periodic Update

3. Minimum Update

4.Maximum Update


Question:
In Unicast Routing, each node uses the same topology to create a routing table and the routing table for each node is

1.Reflective

2.Constant

3.Unique

4.Identical


Question:
In Unicast Routing, link state routing has a different philosophy from that of

1.Distance vector routing

2.Distance variable router

3.Distance vector rotator

4.Distance variable vector


Question:
In Unicast Routing, the disadvantage of the distance vector routing is

1.Stability

2. Instability

3.Split horizon

4.Infinite route distance


Question:
In Unicast Routing, the first column in Routing Table defines the

1.Data Address

2.Network Address

3.Routing Address

4.Protocol Address


Question:
In Unicast Routing, the next-node column defines the address of the router to which the packet is to be sent to reach its

1.Station

2.Network

3.Destination

4.Node


Question:
In Unicast Routing, the protocol that is an implementation of the distance vector protocol is called

1.Border Gateway Protocol

2. Routing Information Protocol

3.Open Shortest Path First

4.Reverse Address Resolution Protocol


Question:
In Unicast Routing, the timer set for periodic dissemination is normally in the range of

1.60 Min

2. 70 Min

3.80 Min

4.90 Min


Question:
In Unicast Routing, we use the shortest path tree method for finding the shortest path of the

1.Frames

2.Nodes

3.Packets

4.Networks


Question:
LMM stands for

1.Longest Mask Matching

2.Largest Mask Maintainence

3.Loop Mask Matching

4.Longest Mask Method


Question:
Multicast Link State Routing is a direct extension of

1.Unicast routing

2.Multicast routing

3. Multiple unicast routing

4.Broadcast routing


Question:
Next-Hop Method is used to reduce the contents of a

1.Content table

2.Rotating Table

3.Routing Table

4.Re-allocate table


Question:
Protocol Independent Multicast-Dense Mode (PIM-DM) is used in a dense multicast environment, such as a

1.WAN

2.MAN

3. LAN

4.Switches


Question:
Protocol Independent Multicast-Sparse Mode (PIM-SM) is similar to Core-Based Tree (CBT), but uses Simpler

1.Protocols

2.Paths

3.Procedures

4.Switches


Question:
Reverse Path Broadcasting (RPB) guarantees each network receives a copy of the multicast packet without formation of

1.Protocol errors

2.Loops

3.Address errors

4. long strings


Question:
Reverse Path Broadcasting (RPB) guarantees that the packet reaches every

1. System ID

2.Network

3.Source

4.Header


Question:
RIP stands for

1.Rotating Information Protocol

2.Routing Information Path

3.Routing Information Packet

4.Routing Information Protocol


Question:
The autonomous system has

1.64 Networks

2.32 Networks

3.16 Networks

4.8 Networks


Question:
The designated parent router can be the router with the shortest path to the

1.Source

2. Network

3. Destination

4.Router


Question:
The final destination of the packet is a host connected to the same physical network as the deliverer in the

1.Direct Delivery

2.Indirect Delivery

3.Urgent Delivery

4.Delayed Delivery


Question:
The router sends a prune message to the upstream router so that it can exclude the corresponding

1.Source

2. Protocol

3.Interface

4.information


Question:
The Routing Information Protocol (RIP) is an intradomain routing protocol used inside an

1.Stable system

2.Autonomous system

3. Reversed system

4.Poison system


Question:
The routing technique that uses a source-based tree approach is

1.Unicast distance vector routing

2.Multicast Distance Vector Routing

3.Multicast link state routing

4.Unicast link state routing


Question:
To alleviate the problem of time needed for searching the table, the term was designed known as

1. Imaging

2.Paging

3. Aggregation

4. Congestion


Question:
To place the packet in its route to its destination, we use

1.Delayed delivery

2. Urgent Delivery

3. Forwarding

4. Backwarding


Question:
We can create a sense of hierarchy in the routing tables, to solve the problems of

1.Gigantic re-allocate tables

2.Gigantic revolving tables

3.Gigantic routes

4.Gigantic routing tables


More MCQS

  1. Routing Mcq Question Set 1
  2. Routing Mcq Question Set 2
  3. Routing Mcq Question Set 3
  4. Routing Mcq Question Set 4
  5. Routing Mcq Question Set 5
  6. Routing Mcq Question Set 6
  7. Routing Mcq Question Set 7
Search
Olete Team
Online Exam TestTop Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Testwebsite is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!