Adding an additional edge to a spanning tree would produce

Quiz 8

 

Just $7 Welcome
Order Now

 

 

 

 

Quiz

Top of Form

Question 1 (1.5 points)

 

Saved

A spanning tree for n nodes uses _____ edges.

Question 1 options:

 
1) n-1

 

 
2) n

 

 
3) n+1

 

 
4) n(n-1)

 

Question 2 (1.5 points)

 

Saved

Adding an additional edge to a spanning tree would produce _____.

Question 2 options:

 
1) a loop

 

 
2) a redundant path

 

 
3) a cycle

 

 
4) all of the above

 

Question 3 (1.5 points)

 

Saved

A search which starts at the root of the tree and bears left is the _____ strategy.

Question 3 options:

 
1) preorder

 

 
2) postorder

 

 
3) inorder

 

Question 4 (1.5 points)

 

Saved

A spanning tree must connect nodes _____.

Question 4 options:

 
1) from bottom up

 

 
2) with a minimum number of edges

 

 
3) symmetrically

 

 
4) from top down

 

Question 5 (1.5 points)

 

Saving…

Consider the cities . The costs of the possible roads between cities are given below:

c(C,E)=11

c(C,F)=12

c(C,G)=14

c(D,G)=13

c(E,H)=15

c(F,H)=16

c(G,H)=17

What is the minimum cost to build a road system that connects all the cities?

Question 5 options:

 
1) 65

 

 
2) 61

 

 
3) 66

 

 
4) 63

 

Question 6 (1.5 points)

 

Saving…

Spanning trees are used in computer networks to assure _____.

Question 6 options:

 
1) there are no cycles or loops

 

 
2) all computers are available on the network

 

 
3) a minimum number of links are used

 

 
4) all of the above

 

Question 7 (1.5 points)

 

Saved

Which of the following are trees?

Question 7 options:

 
1)

 

 
2)

 

 
3)

 

 

 

Submit Quiz5 of 7 questions saved

Bottom of Form