Week 6; Self Check 1

Week 6; Self Check 1 - 1. True or False. Atree lsa graph....

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1. True or False. Atree lsa graph. (Points: 1] '§' True False 2. Isthe fpllpwing graph a tree?I / \ t3 True 'é' False C 3. Isthe fpllpuring graph a tree? '1' True False 4. How marry uertices are there in a tree with 15 edges? (Pplnts: t] t 15 C- 15 {-11 C' 13 'l' ane of the above 5. How marry edges are there lFI atree with 15 vertlces? (Pplnts: t] C' 15 C- 15 @11 {'13 '1' ane at the abuse 6. There exists a tree with 5 uertioes in Wl'llCl'l 4vertices have degree 2, and 1 uertioes have degree 1. (Points: 1] . True 0. False 3'. True or False. It is possible to find a spanning tree in the following graph. A 0. False 8. In the following graph, how many spanning trees are there? 6- l C 0.3 .14 . None of the above 9. True or False. Using Breadth-First Search algorithm on the graph shown in question 3, one can obtain the following spanning tree by starting at vertexA and using alphabetical order when there is a choice for a predecessor. A / ¢-c.-e_._._4 C B _ True ? False 1|]. True or False. Using Depth-First Search algorithm on the graph shown in question 8, one can obtain the following spanning tree by starting at vertex A and using alphabetical order when there is a choice for a predecessor. A / ¢-.H_e_._.__, C B 9 True False 11. True or False. Spanning tree 2 is obtained when using the breadth-first search algorithm on Graph Y by starting at vertex A and using alphabetical order Iwhen there is a choice for a predecessor. Tree 2 Graph Y True 9 False 12. True or False. Spanning tree 2 is obtained when using the breadth-first search algorithm on Graph Y by starting at vertex A and using alphabetical order when there is a choice for a predecessor. Tree Z Graph Y 13. Use Prim's algorithm to find a minimal spanning treer starting at A, forthe following weighted graph. IWhat isthe weight of the minimal spanning tree starts at A? B . None of the above 14. Use Prim's algorithm to find a minimal spanning tree, starting at A, forthe following weighted graph. what isthe weight of the minimal spanning tree starts at A? 99 _ None of the above 15. True or False. Spanning tree X is obtained when using the depth-first search algorithm on Graph Y by starting at vertex A and choosing the vertexthat appears first in alphabetical order it there is a Cl'lUlCE of vertices. Tree X Graph Y ...
View Full Document

Page1 / 6

Week 6; Self Check 1 - 1. True or False. Atree lsa graph....

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online