Test
15. Graph Spanning Tree
Preguntas del test (12)
1How do you know if a connected undirected graph does not contain a cycle?
- AA connected undirected graph that has EXACTLY n-1 edges, with n being the number of nodes in the graph, cannot contain a cycle.
- Bnone
2A connected undirected graph with 17 nodes has 20 edges.
Is it a spanning tree? If so, why?
- AA) No.
- BB) Not enough information is presented to reach a conclusion.
- CC) Yes; any connected but undirected graph is a spanning tree.
- DD) Yes; a spanning tree is a connected graph with at least (N + 1)
edges.
3How do you get the minimum spanning tree?
- APrim's Algorithm
- Bnone
4What is a spanning tree?
- AA.graph that has two cycles
- BB.graph that has one cycle
- CC.graph that has no cycle
- DD.none of the above
5What is a Spannning three?
- AA. Connected graph
- BB. Undirected graph without cycles
- CC. All the above.
6What results from a Depth-First Search?
- AA) 2-3 Tree
- BB) Binary Tree
- CC) Balanced Binary Tree
- DD) Spanning Tree
7A connected __ digraph with n vertices and ___ n-1 degrees ___ a cycle
- Aa.directed, exactly, must contain ;undirected, more than, cannot contain
- Bb.undirected, more than, must contain ;undirected, exactly, cannot contain
- Cc.undirected, exactly, cannot contain ;directed, more than, must contain
- Dd.directed, more than, must contain ;directed, exactly, cannot contain
- Ee. None of the above
8What aglorithm is used to find the minimum spanning tree for a graph?
- AA. Depth First Search
- BB. Bubble Sort
- CC. Dijkstra's Algorithm
- DD. Prim's Algorithm
9Which of the following is NOT a way to find a spanning tree?
- AA. DFS
- BB. BFS
- CC. Prim's
- DD. Dijkstra's
10Which of the following are correct concerning spanning trees?
- AA. all trees are graphs, but not all graphs are trees, and it is a connected, undirected graph without cycles
- BB. all trees are not graphs, but all graphs are trees, and it is a connected, undirected graph without cycles
- CC. all trees are graphs, but not all graphs are trees, and it is an unconnected, undirected graph without cycles
- DD. all trees are not graphs, but all graphs are trees, and it is an unconnected, undirected graph without cycles
11A graph with that is not connected will not have a spanning tree?
- AVerdadero
- BFalso
12A connected undirected graph that has n vertices and exactly n - 1 edges must contain at least one cycle.
- AVerdadero
- BFalso
Información
- Descripción
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Idioma
- English
- Visitas
- 66
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test