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

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
by

1 Answer

Answer :

Answer: 3
by

Related questions

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

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

Last Answer : C. Dynamic, routing table

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

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

. 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

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

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

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

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

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

Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Last Answer : B) End to end delivery

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

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

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

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

In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets

Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets 

Last Answer : Answer: 2

The index file in the database is updated automatically - explain. ?

Description : The index file in the database is updated automatically - explain. ?

Last Answer : The data is arranged in a special order so that the user can quickly find any data from the database. Indexing is the process of arranging the records in a database table in such a logical ... to the database file, the index files are automatically updated. This does not change the original file.

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

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

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions (C) It is a chip to map virtual address to physical address (D) It is an algorithm to allocate and deallocate main memory to a process

Description : What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions ... to physical address (D) It is an algorithm to allocate and deallocate main memory to a process 

Last Answer : (C) It is a chip to map virtual address to physical address

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as : (A) Neighbour Set (B) Strong Entity Set (C) Owner entity set (D) Weak Set

Description : For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as : (A) Neighbour Set (B) Strong Entity Set (C) Owner entity set (D) Weak Set

Last Answer : (C) Owner entity set 

When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Description : When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Last Answer : C : No neighbour has higher value

Ingres is a ........................ A) Socket B) Compiler C) Database D) Web server

Description : Ingres is a ........................ A) Socket B) Compiler C) Database D) Web server

Last Answer : C) Database

In order to run JSP .................... is required. A) Mail Server B) Applet viewer C) Java Web Server D) Database connection

Description : In order to run JSP .................... is required. A) Mail Server B) Applet viewer C) Java Web Server D) Database connection

Last Answer : C) Java Web Server

State whether true or false. i) Multithreading is useful for application that perform a number of essentially independent tasks that do not be serialized. ii) An example of multithreading is a database server that listens for and process numerous client request. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : State whether true or false. i) Multithreading is useful for application that perform a number of essentially independent tasks that do not be serialized. ii) An example of multithreading is a database server that listens for ... B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : B) i-True, ii-True

Which of the following is/are the Database server functions? i) Data management ii) Transaction management iii) Compile queries iv) Query optimization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Description : Which of the following is/are the Database server functions? i) Data management ii) Transaction management iii) Compile queries iv) Query optimization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Last Answer : A) i, ii, and iv only

The reasons leading to popularity of client-server systems are: A) More powerful workstations on LANs B) Needed for graphical user interfaces of end users. C) Remove computing load for presentation services from the system managing a shared database resource. D) All

Description : The reasons leading to popularity of client-server systems are: A) More powerful workstations on LANs B) Needed for graphical user interfaces of end users. C) Remove computing load for presentation services from the system managing a shared database resource. D) All

Last Answer : D) All

_______ 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

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

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

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

Explain distance vector routing and link state routing

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

Define Routing. What is distance vector routing?

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.

Explain difference between distance vector and link state routing.

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

Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii

Description : Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii

Last Answer : B) i, and ii only

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

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

In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C) store list of file names plus pointers associated with i-nodes (D) store information entered by a user application program or utility program

Description : In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C ... pointers associated with i-nodes (D) store information entered by a user application program or utility program

Last Answer : (B) provide a mechanism to map physical device to file names 

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

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

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

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

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

The use ofhierarchy in routing tables can ________ the size of the routing tables. A) reduce B) increase C) both a and b D) none of the above

Description : The use ofhierarchy in routing tables can ________ the size of the routing tables. A) reduce B) increase C) both a and b D) none of the above

Last Answer : reduce

Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Last Answer : B) End to end delivery

Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same destination can take different routes in the network c. IP ensures that a packet is discarded if it is unable to reach its destination within a given number of hops d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

Description : Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same ... outgoing packets; the route is determined only by the routing tables in the routers on the way

Last Answer : d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

The use of hierarchy in routing tables can ________ the size of the routing tables A. reduce B. increase C. multiply D. retain

Description : The use of hierarchy in routing tables can ________ the size of the routing tables A. reduce B. increase C. multiply D. retain

Last Answer : A. reduce

Which of the following is not a type of volatile evidence a) Routing Tables b) Main Memory c) Log files d) Cached Data

Description : Which of the following is not a type of volatile evidence a) Routing Tables b) Main Memory c) Log files d) Cached Data

Last Answer : c) Log files

Which of the following is not type of volatile evidence: A)Routing Tables B) Main Memory C)Log Files D) Cached Data

Description : Which of the following is not type of volatile evidence: A)Routing Tables B) Main Memory C)Log Files D) Cached Data

Last Answer : D) Cached Data

Which of the following is not type of volatile evidence: A)Routing Tables B) Main Memory C)Log Files D) Cached Data

Description : Which of the following is not type of volatile evidence: A)Routing Tables B) Main Memory C)Log Files D) Cached Data

Last Answer : D) Cached Data

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

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

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

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

A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Last Answer : a) Feed-forward neural network

In the hypermedia database, information bits are stored in the form of: (A) signals (B) cubes (C) nodes (D) symbols

Description : In the hypermedia database, information bits are stored in the form of: (A) signals (B) cubes (C) nodes (D) symbols

Last Answer : Answer: C Explanation: Hypermedia database model stores chunks of information in the form of nodes connected by links established by the user. The nodes can contain text, graphics, sound, full-motion video, or executable computer programs. 

Mathematical models using linear, dynamic, integer, or algorithm models are considered A. Project selection criteria B. A form of expert judgment C. Project selection methods D. A form of historical information

Description : Mathematical models using linear, dynamic, integer, or algorithm models are  considered  A. Project selection criteria B. A form of expert judgment C. Project selection methods D. A form of historical information

Last Answer : C. Project selection methods

When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as................. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching

Description : When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as................. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching

Last Answer : (A) handoff 

In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B) 12 clusters, 20 regions and 20 routers (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Description : In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B ... (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Last Answer : (D) 15 clusters, 16 regions and 20 routers Rooters minimum, then regions minimum, then clusters minimum.

Which of the following is used in the options field of IPv4 ? (A) Strict source routing (B) Loose source routing (C) time stamp (D) All of the above

Description : Which of the following is used in the options field of IPv4 ? (A) Strict source routing (B) Loose source routing (C) time stamp (D) All of the above

Last Answer : (D) All of the above

Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is ................... (A) 25 (B) 27 (C) 53 (D) 72

Description : Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is ................... (A) 25 (B) 27 (C) 53 (D) 72

Last Answer : Answer: A  Explanation: Each router needs 10 entries for local routers, 8 entries for routing to other regions within its own cluster, and 7 entries for distant clusters, for a total of 25 entries.