A ___________is a subset of the network that includes all the routers but contains no loops.Question 2Select one:a.None of theseb.Binary treec.Treed.Spanning treee.Sink tree

______ constructs a tree to eliminate loops on the switching network. A. SPOF B. NAT C. Redundancy D. STP

Any graph is a tree if and only if the graph is.... Question 32Select one: A directed graph Completely connected Contains no cycles

In bridged LANs, the _______ algorithm creates a topology in which each LAN can be reached from any other LAN through one path only.Question 5Select one:a.binary treeb.unary treec.routingd.shortest pathe.spanning tree

In a ____ network topology only key nodes are interconnected. A. Tree B. Partial-mesh C. Star D. Full-mesh

You7. Graph traversal is different from a tree traversal, because….a. trees are not connectedb. graphs may have loopsc. trees have rootd. None of these