7137234
Descripción
Test por Mena Sargios, actualizado hace más de 1 año
|
Creado por Mena Sargios
hace alrededor de 8 años
|
|
Pregunta 1
Pregunta
What is the purpose of Dijkstra's algorithm (what problem does it solve)?
Respuesta
-
Dijkstra's finds the shortest path from an initial vertex to all of the other vertices.
-
none of the above
Pregunta 2
Pregunta
A common algorithm for finding the shortest path on a graph is ___.
Respuesta
-
A) Huffman's
-
B) Euler's
-
C) Djikstra's
-
D) Hamiltonian's
Pregunta 3
Pregunta
What is used to find the shortest path in a graph?
Respuesta
-
Dijkstra's Algorithm
-
none of the above
Pregunta 4
Pregunta
How would you go about find the shortage path?
Respuesta
-
A.use the path that is not being used
-
B.you add up the path weights between the two points and which ever is smallest
-
C.find the longest path between to points
-
D.none of the above
Pregunta 5
Pregunta
Dijkstra's algorithm finds what kind of path between all vertices?
Respuesta
-
A. Longest Path
-
B. Shortest Path.
-
C. Tallest Path
-
D. None of the above
Pregunta 6
Pregunta
Which algorithim finds the shortest path between vertex 0 and all other verticies?
Respuesta
-
A) Primm's Algotrithim
-
B) Yoo's Algorithim
-
C) Fermi Algorithim
-
D) Dijkstra's Algorithim
Pregunta 7
Pregunta
What is used to find the shortest path of one node to all other nodes?
Respuesta
-
Djikstra's Algorithm
-
none
Pregunta 8
Pregunta
What aglorithm is used to find the shorest path between two nodes in a graph?
Respuesta
-
A. Depth First Search
-
B. Bubble Sort
-
C. Dijkstra's Algorithm
-
D. Prim's Algorithm
Pregunta 9
Pregunta
Dijkstra's algorithm finds the shortest path between a vertex and:
Respuesta
-
A. only one other node
-
B. two other nodes
-
C. all other nodes
-
D. n/a: Dijkstra's algorithm finds the smallest spanning tree.
Pregunta 10
Pregunta
What does Dijkstra's algorithm do?
Respuesta
-
A. it finds the longest path between vertex 0 and all other vertices
-
B. it finds the shortest path between vertex v and all other vertices
-
C. it finds the longest path between vertex v and all other vertices
-
D. it finds the shortest path between vertex 0 and all other vertices
Pregunta 11
Pregunta
When trying to find the shortest path and you have negative edges in the graph. You can still use Dijkstra’s algorithm?
Respuesta
- True
- False
Pregunta 12
Pregunta
Is the definition of Dijkstra's algorithm true or false?
Find the shortest path between vertex 0 and all other vertices
Respuesta
- True
- False
Pregunta 13
Pregunta
What are the two data structures that Dijkstra's Algorithm uses?
Respuesta
-
A) Two arrays
-
B) Two sets
-
C) A tree and a set
-
D) A set and an array
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.