7137374
Descripción
Test por Mena Sargios, actualizado hace más de 1 año
|
Creado por Mena Sargios
hace más de 7 años
|
|
Pregunta 1
Pregunta
How do you know if a connected undirected graph does not contain a cycle?
Respuesta
-
A connected undirected graph that has EXACTLY n-1 edges, with n being the number of nodes in the graph, cannot contain a cycle.
-
none
Pregunta 2
Pregunta
A connected undirected graph with 17 nodes has 20 edges.
Is it a spanning tree? If so, why?
Respuesta
-
A) No.
-
B) Not enough information is presented to reach a conclusion.
-
C) Yes; any connected but undirected graph is a spanning tree.
-
D) Yes; a spanning tree is a connected graph with at least (N + 1) edges.
Pregunta 3
Pregunta
How do you get the minimum spanning tree?
Respuesta
-
Prim's Algorithm
-
none
Pregunta 4
Pregunta
What is a spanning tree?
Respuesta
-
A.graph that has two cycles
-
B.graph that has one cycle
-
C.graph that has no cycle
-
D.none of the above
Pregunta 5
Pregunta
What is a Spannning three?
Respuesta
-
A. Connected graph
-
B. Undirected graph without cycles
-
C. All the above.
Pregunta 6
Pregunta
What results from a Depth-First Search?
Respuesta
-
A) 2-3 Tree
-
B) Binary Tree
-
C) Balanced Binary Tree
-
D) Spanning Tree
Pregunta 7
Pregunta
A connected __ digraph with n vertices and ___ n-1 degrees ___ a cycle
Respuesta
-
a.directed, exactly, must contain ;undirected, more than, cannot contain
-
b.undirected, more than, must contain ;undirected, exactly, cannot contain
-
c.undirected, exactly, cannot contain ;directed, more than, must contain
-
d.directed, more than, must contain ;directed, exactly, cannot contain
-
e. None of the above
Pregunta 8
Pregunta
What aglorithm is used to find the minimum spanning tree for a graph?
Respuesta
-
A. Depth First Search
-
B. Bubble Sort
-
C. Dijkstra's Algorithm
-
D. Prim's Algorithm
Pregunta 9
Pregunta
Which of the following is NOT a way to find a spanning tree?
Respuesta
-
A. DFS
-
B. BFS
-
C. Prim's
-
D. Dijkstra's
Pregunta 10
Pregunta
Which of the following are correct concerning spanning trees?
Respuesta
-
A. all trees are graphs, but not all graphs are trees, and it is a connected, undirected graph without cycles
-
B. all trees are not graphs, but all graphs are trees, and it is a connected, undirected graph without cycles
-
C. all trees are graphs, but not all graphs are trees, and it is an unconnected, undirected graph without cycles
-
D. all trees are not graphs, but all graphs are trees, and it is an unconnected, undirected graph without cycles
Pregunta 11
Pregunta
A graph with that is not connected will not have a spanning tree?
Respuesta
- True
- False
Pregunta 12
Pregunta
A connected undirected graph that has n vertices and exactly n - 1 edges must contain at least one cycle.
Respuesta
- True
- False
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.