MCQOPTIONS
Bookmark
Saved Bookmarks
→
General Awareness
→
Banking Innovation in India
→
Consider the following graph.
1.
Consider the following graph.
A.
If b is the source vertex, what is the minimum cost to reach f vertex?
B.
8
C.
9
D.
4
E.
6
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Dijkstra’s Algorithm is the prime example for ___________
In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.
Consider the following graph.
The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________
What is the pseudo code to compute the shortest path in Dijkstra’s algorithm?
Dijkstra’s Algorithm cannot be applied on ______________
What is the time complexity of Dijikstra’s algorithm?
Dijkstra’s Algorithm is used to solve _____________ problems.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies