Dv Routing Algorithms MCQs

10 MCQs — Computer Networks MCQs

Practice Dv Routing Algorithms MCQs with correct answers and explanations. These questions are from the Computer Networks MCQs section.

Attempt Dv Routing Algorithms Quiz

Computer Networks Subcategories

Access Networks	Acl
Analyzing Subnet Mask	Application Layer
Aptitude Test	Atm Frame Relay
Basics	Bgp
Bluetooth	Broadcast Routing
Campus Interviews	Cidr
Cisco Lan Switches	Computer Network
Computer Network Interview Questions/	Computer Networks
Computer Networks Assessment	Computer Networks Basic
Congestion Control	Cookie
Cryptography	Data Link Layer
Delays Loss	Dhcp
Digital Signatures	Dns
Dv Routing Algorithms	Eigrp 2
Entrance Exams	Error Detection Correction Techniques
Ethernet	Experienced
Firewall	Frame Relay 2
Freshers	Ftp
Hash Functions	Hierarchical Routing
Http	Http Ftp
Icmp	Internet
Internetworking	Ip Routing 2
Ipsecurity	Ipv4
Ipv4 Ipv6 Comparison	Ipv6
Local Area Networks	Ls Routing Algorithms
Mac Address	Mail Access Protocols
Mcqs	Multiple Access Links Protocols
Multiplexing	Network Attacks
Network Layer	Network Management Models
Network Management Standards	Network Node Components
Network Security Encryption	Network Topology Set 2
Network Topology Set 3	Network Utilities
Online Quiz	Online Test
Ospf	Packet Circuit Switching
Physical Layer	Physical Media
Port	Public Key Cryptography
Quiz	Reference Models
Reliable Data Transfer	Remote Network Monitoring
Ripv1	Rmon1
Routers Functionalities Basics	Rpc
Rtp	Security
Security Management	Smtp
Snmp	Snmp Operations
Snmpv2 Protocol	Snmpv3 Features
Snmpv3 User Based Security Model	Sonet
Ssh	Switches Hubs
Symmetric Key Cryptography	System Utilities Management
Tcp	Telnet
Test	Topology
Transport Layer	Udp
Virtual Circuit	Vlan
Web Caching	Wimax
Wireless Lan	World Wide Web

What is the other name for distance vector routing algorithm?

A. Ford and fullman algorithm
B. Bellman ? ford algorithm
C. Ford and fulkerson algorithm
D. Bellman ? fulkerson algorithm

Read more about this MCQ

How tables are updated in the distance vector routing algorithm?

A. Using flooding technique
B. By retrieving the information from all the nodes directly
C. By interchanging the information with neighbour nodes
D. By exchanging the information with a central device

Read more about this MCQ

Which of the following is not a similarity between flooding and distance vector routing?

A. Finding shortest paths
B. Using less setup
C. Using local knowledge
D. Using hop count metric

Read more about this MCQ

Which statement is correct about routing tables in distance vector routing?

A. Routing tables have entry for only immediate neighbouring nodes
B. Routing tables have entry for all the nodes in the network
C. Routing tables have entry for those nodes who have minimum distance
D. Routing tables have entry for those nodes who have maximum distance

Read more about this MCQ

What is the default distance between two nodes in the initial routing table, if these two nodes are not immediate neighbors in distance vector routing?

A. Maximum distance in the routing table of the node
B. Minimum distance in the routing table of the node
C. Infinite distance that is unreachable
D. Total sum of the distances in the routing table

Read more about this MCQ

What update can it be called, if a node sends its routing table to its neighbors if there are any modifications in the routing table?

A. Frequent update
B. Periodic update
C. Triggered update
D. Continuous update

Read more about this MCQ

Which protocols are considered as intra-domain routing protocols?

A. Distance vector and link state routing
B. Distance vector and path vector routing
C. Path vector and link state routing
D. Only a path vector routing

Read more about this MCQ

Which technique can be used in multicast routing to overcome the problem of count-to-infinity which occurs in distance vector routing?

A. Reverse path multi-casting
B. Flooding
C. Reverse path forwarding
D. Reverse path broadcasting

Read more about this MCQ

Which routing does not permit the router to send its routing table to its neighboring nodes?

A. Link state routing
B. Unicast distance vector routing
C. Multicast distance vector routing
D. Multiple routing

Read more about this MCQ

Distance vector routing is a dynamic routing algorithm.

A. True
B. False
C.
D.

Read more about this MCQ

MCQs Menu

Past Papers