7137234
Descrição
Quiz por Mena Sargios, atualizado more than 1 year ago
|
Criado por Mena Sargios
aproximadamente 8 anos atrás
|
|
Questão 1
Questão
What is the purpose of Dijkstra's algorithm (what problem does it solve)?
Responda
-
Dijkstra's finds the shortest path from an initial vertex to all of the other vertices.
-
none of the above
Questão 2
Questão
A common algorithm for finding the shortest path on a graph is ___.
Responda
-
A) Huffman's
-
B) Euler's
-
C) Djikstra's
-
D) Hamiltonian's
Questão 3
Questão
What is used to find the shortest path in a graph?
Responda
-
Dijkstra's Algorithm
-
none of the above
Questão 4
Questão
How would you go about find the shortage path?
Responda
-
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
Questão 5
Questão
Dijkstra's algorithm finds what kind of path between all vertices?
Responda
-
A. Longest Path
-
B. Shortest Path.
-
C. Tallest Path
-
D. None of the above
Questão 6
Questão
Which algorithim finds the shortest path between vertex 0 and all other verticies?
Responda
-
A) Primm's Algotrithim
-
B) Yoo's Algorithim
-
C) Fermi Algorithim
-
D) Dijkstra's Algorithim
Questão 7
Questão
What is used to find the shortest path of one node to all other nodes?
Responda
-
Djikstra's Algorithm
-
none
Questão 8
Questão
What aglorithm is used to find the shorest path between two nodes in a graph?
Responda
-
A. Depth First Search
-
B. Bubble Sort
-
C. Dijkstra's Algorithm
-
D. Prim's Algorithm
Questão 9
Questão
Dijkstra's algorithm finds the shortest path between a vertex and:
Responda
-
A. only one other node
-
B. two other nodes
-
C. all other nodes
-
D. n/a: Dijkstra's algorithm finds the smallest spanning tree.
Questão 10
Questão
What does Dijkstra's algorithm do?
Responda
-
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
Questão 11
Questão
When trying to find the shortest path and you have negative edges in the graph. You can still use Dijkstra’s algorithm?
Responda
- True
- False
Questão 12
Questão
Is the definition of Dijkstra's algorithm true or false?
Find the shortest path between vertex 0 and all other vertices
Responda
- True
- False
Questão 13
Questão
What are the two data structures that Dijkstra's Algorithm uses?
Responda
-
A) Two arrays
-
B) Two sets
-
C) A tree and a set
-
D) A set and an array
Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.