MS12-TB20

# MS12-TB20 - Chapter 20 - 1 20 Minimal Spanning Tree...

This preview shows pages 1–2. Sign up to view the full content.

Chapter 20 - 1 20 Minimal Spanning Tree MULTIPLE CHOICE 1. Consider a minimal spanning tree problem in which pipe must be laid to connect sprinklers on a golf course. When represented with a network, a. the pipes are the arcs and the sprinklers are the nodes. b. the pipes are the nodes and the sprinklers are the arcs. c. the pipes and the sprinklers are the tree. d. each sprinkler must be connected to every other sprinkler. ANSWER: a TOPIC: The minimal spanning tree problem 2. The minimal spanning tree algorithm is considered to be: a. a greedy algorithm. b. an arc algorithm. c. a non-optimal algorithm. d. a non-feasible algorithm. ANSWER: a TOPIC: A minimal spanning tree algorithm 3. The minimal spanning tree algorithm has connected nodes 8 and 9. Node 8 could be connected to nodes 11 (distance 6) and 12 (distance 5) and node 9 could be connected to node 12 (distance 3) and node 13 (distance 2). Which will you do next? a.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/21/2011 for the course ACC 01 taught by Professor El-helbawy during the Spring '11 term at Tanta University.

### Page1 / 5

MS12-TB20 - Chapter 20 - 1 20 Minimal Spanning Tree...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online