adplus-dvertising
frame-decoration

Question

The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .................

a.

Binary tree

b.

Sparse tree

c.

Sink tree

d.

AVL tree

Posted under Routing Networking

Answer: (c).Sink tree

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .................

Similar Questions

Discover Related MCQs

Q. Adaptive routing algorithms get their information from .............

Q. If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ...................

Q. In Hierarchical routing for N router subnet, the optimal number of levels is ..............

Q. The router algorithm takes the decision to changes the route when .................

Q. If route from router I to router J is computed on line based on the current statistics, then it is called as ....................

Q. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.................

Q. ................. change their routing decisions to reflect changes in the topology.

Q. If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ..................

Q. If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ....................

Q. If a datagram router goes down then ..............

Q. In datagram subnet new route is chosen .....................

Q. The PSTN is an example of a ..................... network.

Q. Each packet is routed independently in ...................

Q. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?

Q. Eight stations are competing for the use of a shared channel using the 'Adaptive tree Walk Protocol'. If the stations 7 and 8 are suddenly become ready at once, how many bit slots are needed to resolve the contention?

Q. Which of the following is the address of the router?

Q. Establishing a virtual connection is functionally equivalent to

Q. Which of the following characteristics is not true of NetBEUI?

Q. The Routing Information Protocol (RIP) cannot have more than 15 hops if infinity is defined as

Q. In Reverse Path Forwarding (RPF), the router receives a packet and extracts the