M

Mr. Dubey • 52.74K Points
Coach 

Q. Which one of the following routing algorithm can be used for network layer design?

(A) shortest path algorithm
(B) distance vector routing
(C) link state routing
(D) all of the above
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related Posts

Q. The PDU of network layer is

Q. In _______ forwarding, the routing table holds the address of just the next hop instead of complete route information.

Q. Multi-destination routing

Q. _______ are special-interest groups that quickly test, evaluate, and standardize new technologies.

Q. In _______ forwarding, the mask and destination addresses are both 0.0.0.0 in the routing table.

Q. ________ means to prove the identity of the entity that tries to access the system's resources.

Q. "BAUD" rate means

Q. Bit stuffing means adding an extra 0 to the data section of the frame when there is a sequence of bits with the same pattern as the ________.

Q. In the sending computer, UDP sends a data unit to the _______ layer.

Q. IGMP is _______ protocol.

View All Posts

Question analytics