Hi , I got some multple choice questions that I need some help with. I appreciat
ID: 3722088 • Letter: H
Question
Hi , I got some multple choice questions that I need some help with. I appreciate the assistance
1) Which of the following traversals is best in terms of time and finding the optimal path?
None of these
A*
Breadth First Search
Greedy First Search
2) What data structure does Dijkstra's algorithm use to help it choose which vertex in a graph to visit next?
a stack
a queue
an array
a priority queue
3) Which type of traversal guarantees that we find the most optimal path between two nodes in a graph?
None of these
Depth First Search
Greedy First Search
Breadth First Search
4) To solve the shortest path problem of a weighted graph using non-negative weights we would preferably use ________'s algorithm.
None of these
Bellman-Ford
Dijkstra
Floyd-Warshall
4) If we finish Dijksta's algorithm and a node still has an estimated distance of infinity this means _______.
an error occurred
a path does not exist from the source to that node
that we need to run the relaxation method again
None of these
a.None of these
b.A*
c.Breadth First Search
d.Greedy First Search
Explanation / Answer
1) Which of the following traversals is best in terms of time and finding the optimal path?
BFS , DFS are two graph travels out of BFS gives best in terms of finding the optimal path
Ans : Bredth First Search
2) What data structure does Dijkstra's algorithm use to help it choose which vertex in a graph to visit next?
In degkstr's we need to find minimu distance. For this Prioriy queue is better option.
Min Heap is used as a priority queue to get the minimum distance vertex from set of not yet included vertices.
Ans : d.a priority queue
3)Which type of traversal guarantees that we find the most optimal path between two nodes in a graph?
Breadth-First Search (BFS) just uses a queue to push and pop nodes to/from. This means that it visits nodes in the order of their depth.
Ans : d. Bredth First Search
4)To solve the shortest path problem of a weighted graph using non-negative weights we would preferably use ________'s algorithm.
Dijkstra doesn’t work for Graphs with negative weight edges, Bellman-Ford works for such graphs.
Flyes-warshall algo is all pair shortes path with positive edges
Ans : b . Bellman-Ford
5)
If we finish Dijksta's algorithm and a node still has an estimated distance of infinity this means
If we don't have a path between a source and a vertex then we got distance as infinety in diskstra
Ans : B ) a path does not exist from the source to that node
Please ask me if you have any concerns, I ll replay as soon as possible
1) Which of the following traversals is best in terms of time and finding the optimal path?
BFS , DFS are two graph travels out of BFS gives best in terms of finding the optimal path
Ans : Bredth First Search
2) What data structure does Dijkstra's algorithm use to help it choose which vertex in a graph to visit next?
In degkstr's we need to find minimu distance. For this Prioriy queue is better option.
Min Heap is used as a priority queue to get the minimum distance vertex from set of not yet included vertices.
Ans : d.a priority queue
3)Which type of traversal guarantees that we find the most optimal path between two nodes in a graph?
Breadth-First Search (BFS) just uses a queue to push and pop nodes to/from. This means that it visits nodes in the order of their depth.
Ans : d. Bredth First Search
4)To solve the shortest path problem of a weighted graph using non-negative weights we would preferably use ________'s algorithm.
Dijkstra doesn’t work for Graphs with negative weight edges, Bellman-Ford works for such graphs.
Flyes-warshall algo is all pair shortes path with positive edges
Ans : b . Bellman-Ford
5)
If we finish Dijksta's algorithm and a node still has an estimated distance of infinity this means
If we don't have a path between a source and a vertex then we got distance as infinety in diskstra
Ans : B ) a path does not exist from the source to that node