A. Ford and fullman algorithm
B. Bellman €? ford algorithm
C. Ford and fulkerson algorithm
D. Bellman €? fulkerson 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

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

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

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

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

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

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

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

A. True
B. False
C.
D.