adplus-dvertising
frame-decoration

Question

Each node uses the shortest path tree protocol to construct its

a.

Connections

b.

Routing table

c.

Graphs

d.

Network

Posted under Networking

Answer: (b).Routing table

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Each node uses the shortest path tree protocol to construct its

Similar Questions

Discover Related MCQs

Q. In the Border Gateway Protocol (BGP), the criterion of the policy is set by the

Q. A network can receive a multicast packet from a particular source only through a

Q. In periodic update, a node sends its routing table normally after every

Q. To convert broadcasting to multicasting, the protocol uses

Q. The network layer supervises the handling of the packets by

Q. The technique to simplify routing is called the

Q. The idea of aggregation is similar to

Q. Well-known mandatory attributes of Border Gateway Protocol (BGP) is

Q. In multicast communication, the relationship is

Q. In multiple unicasting, the packets are created with a relative delay in

Q. Reverse Path Forwarding (RPF) does not guarantees that each network receives

Q. DVMRP stands for

Q. The graft message forces the upstream router to resume sending the

Q. The telephone line is an example of

Q. In the shortest path tree, root of a tree is a

Q. In Open Shortest Path First (OSPF) terminology, a connection is called a

Q. If the path from A to B is the shortest, then it is also the shortest from

Q. In classless addressing, we need at least

Q. We can create a sense of hierarchy in the routing tables, to solve the problems of

Q. The designated parent router can be the router with the shortest path to the