Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a
………
A. Static , routing table
B. Dynamic, look-up table
C. Dynamic, routing table
D. Static, look-up table

1 Answer

Answer :

C. Dynamic, routing table

Related questions

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

Description : Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Last Answer : d. all of the mentioned

Description : A ……………………….. is built from the information exchanged by routing protocols. A. static routing table B. dynamic routing table C. both a and b D. neither a nor b

Last Answer : B. dynamic routing table

Description : . A ………………………... is constructed manually by the system administrator using the route command. A. static routing table B. dynamic routing table C. both a and b D. neither a nor b

Last Answer : A. static routing table

Description : The sender is a router thathas receiveda datagram destinedfor a host on anothernetwork. The logicaladdress that must be mapped to aphysical address is ______. A) thedestination IP address in the datagram header ... address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : thedestination IP address in the datagram header

Description : In distance vector routing,each node periodically shares its routing table with_________ and whenever there is achange. A) every other node B) its immediate neighbors C) one neighbor D) none of the above

Last Answer : its immediate neighbors

Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Last Answer : hot potatorouting

Description : Flooding is also a……... algorithm, usually generates ………... of duplicate packets. A. Static, vast number B. dynamic , vast number C. Static, less number D. dynamic , less number

Last Answer : A. Static, vast number

Description : The Dynamic routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Last Answer : B. which is updated automatically

Description : _______ is an implementation of multicast distance vector routing. It is asource-based routing protocol, based on RIP. A) MOSPF B) DVMRP C) CBT D) none of the above

Last Answer : DVMRP

Description : . In _______ routing, the least cost routebetween any two nodes is theroute with the minimum distance. A) path vector B) distancevector C) link state D) none of the above

Last Answer : distancevector

Description : Explain distance vector routing and link state routing

Last Answer : Distance vector routing _ Sharing information _ Routing table _ Creating the table _ Updating the table _ Updating algorithm

Description : Define Routing. What is distance vector routing?

Last Answer : The process by which nodes exchange topological information to build correct forwarding tables. A lowest cost path algorithm used in routing. Each node advertises reachability information and associated costs ... , uses the updates it receives to construct its forwarding table. RIP uses it.

Description : The static routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Last Answer : A. with manual entries

Description : Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm

Last Answer : a. Flow Control Policy

Description : Which one of the following algorithm is not used for congestion control? a. traffic aware routing b. admission control c. load shedding d. routing information protocol

Last Answer : d. routing information protocol

Description : Which of the following routing technique / techniques is / are used in distributed systems ? A. Fixed Routing B. Virtual Routing C. Dynamic Routing a. A Only b. A and B only c. C only d. All A,B,C

Last Answer : a. A Only

Description : Dynamic routing protocol enable routers to a. Dynamically discover and maintain routes b. Distribute routing updates to other routers c. Reach agreement with other routers about the network topology d. All of the above

Last Answer : d. All of the above

Description : The Multicast Open Shortest Path First (MOSPF)protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is basedon _______ routing. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : ________ is an interdomain routingprotocol using path vector routing. A) BGP B) RIP C) OSPF D) none of the above

Last Answer : BGP

Description : In ________ routing, we assume that there is one node (or more) ineach autonomous system that acts on behalf of the entire autonomous system. A) distant vector B) path vector C) link state D) none of the above

Last Answer : path vector

Description : The Open Shortest Path First (OSPF)protocol is an intradomain routing protocolbased on _______ routing. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing. A) distancevector B) link state C) path vector D) none of the above

Last Answer : distancevector

Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Last Answer : A. Flooding

Description : In _______, a tableassociating a logicaladdress with a physical address is updated manually. A) static mapping B) dynamic mapping C) physical mapping D) noneof the above

Last Answer : static mapping

Description : A _______routingtable is updated periodically using one of the dynamic routingprotocols. A) static B) dynamic C) hierarchical D) none of the above

Last Answer : dynamic

Description : A _______routingtable contains information entered manually. A) static B) dynamic C) hierarchical D) none of the above

Last Answer : static

Description : Which type of channel it is where the number of users are stable and the traffic is not bursts? A. static channel B. dynamic channel C. free channel D. both a and c

Last Answer : A. static channel

Description : Explain difference between distance vector and link state routing. 

Last Answer : Distance Vector Routing Link State Routing Routing tables are updated by exchanging information with the neighbours.  Complete topology is distributed to every router to update a routing table. ... Harder to configure Count to infinity problem No count to infinity problem

Description : The sender is a router thathas receiveda datagram destinedfor a host on thesame network. The logical address that mustbe mapped to a physical address is ______. A) thedestination IP address in the datagram ... IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : thedestination IP address in the datagram header

Description : If the sender is a host and wants tosend a packet toanotherhost on another network, the logical address that must be mapped to a physical address is ______. A) thedestination IP address in the datagram ... the IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : the IP address of therouter found inthe routing table

Description : f the sender is a host and wants tosend a packet toanotherhost on the samenetwork, the logical address that must be mapped to a physical address is ______. A) thedestination IP address in the datagram ... the IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : hedestination IP address in the datagram header

Description : In unicast routing,each router in the domain has a table thatdefines a______ path tree to possible destinations. A) average B) longest C) shortest D) none of the above

Last Answer : shortest

Description : The principle of ________ states that the routing table is sorted from the longest mask to the shortest mask. A) first mask matching B) shortest mask matching C) longest mask matching D) none of the above

Last Answer : longest mask matching

Description : The idea of address aggregation wasdesigned to alleviate theincreasein routing table entries when using ________. A) classful addressing B) classless addressing C) both a and b D) none of the above

Last Answer : classless addressing

Description : In _______forwarding, the full IP address of a destination isgiven in the routing table. A) next-hop B) network-specific C) host-specific D) default

Last Answer : host-specific

Description : The limited capability of this routing table is easily verified with the ………………………... command. A. ping B. traceroute C. route D. netstat

Last Answer : A. ping

Description : State weather the following statement is true or false for Hierarchical Routing 1). In hierarchical routing, the routers are divided into regions. 2) Each router is having the idea about internal structure of other regions 3). ... C. 1. false, 2. false, 3. false D. 1. true, 2. false, 3. true

Last Answer : D. 1. true, 2. false, 3. true

Description : LBG algorithm is used to design a _________. a. Quantizer b. Vector c. Codebook d. Index table

Last Answer : c. Codebook

Description : In OSI network architecture, the routing is performed by a. network layer b. data link layer c. transport layer d. session layer e. none of above

Last Answer : network layer

Description : The routing processor of arouter performs the ________ layer functions of therouter. A) physical and data link B) network C) transport D) none of the above

Last Answer : network

Description : Which of the following is not correct in relation to multi-destination routing? a. is same as broadcast routing b. contains the list of all destinations c. data is not sent by packets d. there are multiple receivers

Last Answer : c. data is not sent by packets

Description : In OSI network architecture, the routing is performed by a. network layer b. data link layer c. transport layer d. session layer

Last Answer : a. network layer

Description : A dynamic table is one _______. A) with manual entries B) which isupdated automatically C) either aor b D) none of the above

Last Answer : which isupdated automatically

Description : In ________, eachnode maintains avector (table)of minimum distances to every node. A) path vector B) distancevector C) link state D) none of the above

Last Answer : distancevector

Description : Which of the following is correct? a) The dynamic structure of the Layered style is to partition software units into modular layers b) The static structure of the Layered style is nothing more than ... interactions between layers c) All of the mentioned CSE-R17.BLOGSPOT.COM d) None of the mentioned

Last Answer : None of the mentioned

Description : A static table is one _______. A) with manual entries B) which isupdated automatically C) either aor b D) none of the above

Last Answer : with manual entries

Description : Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate? a. solid bucket algorithm b. spanning tree algorithm c. hocken helm algorithm d. leaky bucket algorithm

Last Answer : d. leaky bucket algorithm

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above