GoConqr has a new look! Let us know what you think.

Sign up free

Quiz

15. Graph Spanning Tree

Mena Sargios 12 questions

Take the quiz

Questions in this quiz (12)

  1. 1How do you know if a connected undirected graph does not contain a cycle?

    1. AA connected undirected graph that has EXACTLY n-1 edges, with n being the number of nodes in the graph, cannot contain a cycle.
    2. Bnone
  2. 2A connected undirected graph with 17 nodes has 20 edges.
    Is it a spanning tree? If so, why?
    1. AA) No.
    2. BB) Not enough information is presented to reach a conclusion.
    3. CC) Yes; any connected but undirected graph is a spanning tree.
    4. DD) Yes; a spanning tree is a connected graph with at least (N + 1)
      edges.
  3. 3How do you get the minimum spanning tree?
    1. APrim's Algorithm
    2. Bnone
  4. 4What is a spanning tree?
    1. AA.graph that has two cycles
    2. BB.graph that has one cycle
    3. CC.graph that has no cycle
    4. DD.none of the above
  5. 5What is a Spannning three?
    1. AA. Connected graph
    2. BB. Undirected graph without cycles
    3. CC. All the above.
  6. 6What results from a Depth-First Search?
    1. AA) 2-3 Tree
    2. BB) Binary Tree
    3. CC) Balanced Binary Tree
    4. DD) Spanning Tree
  7. 7A connected __ digraph with n vertices and ___ n-1 degrees ___ a cycle
    1. Aa.directed, exactly, must contain ;undirected, more than, cannot contain
    2. Bb.undirected, more than, must contain ;undirected, exactly, cannot contain
    3. Cc.undirected, exactly, cannot contain ;directed, more than, must contain
    4. Dd.directed, more than, must contain ;directed, exactly, cannot contain
    5. Ee. None of the above
  8. 8What aglorithm is used to find the minimum spanning tree for a graph?
    1. AA. Depth First Search
    2. BB. Bubble Sort
    3. CC. Dijkstra's Algorithm
    4. DD. Prim's Algorithm
  9. 9Which of the following is NOT a way to find a spanning tree?
    1. AA. DFS
    2. BB. BFS
    3. CC. Prim's
    4. DD. Dijkstra's
  10. 10Which of the following are correct concerning spanning trees?
    1. AA. all trees are graphs, but not all graphs are trees, and it is a connected, undirected graph without cycles
    2. BB. all trees are not graphs, but all graphs are trees, and it is a connected, undirected graph without cycles
    3. CC. all trees are graphs, but not all graphs are trees, and it is an unconnected, undirected graph without cycles
    4. DD. all trees are not graphs, but all graphs are trees, and it is an unconnected, undirected graph without cycles

Information

Description
Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
Language
English
Views
66
Rating
No ratings yet
Rate this quiz
Rate this quiz

Feedback

What is it about?

What do you think of the new look?

How do you like it?