MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Dijkstra’s Algorithm is the prime example for ___________ |
| A. | Greedy algorithm |
| B. | Branch and bound |
| C. | Back tracking |
| D. | Dynamic programming |
| Answer» B. Branch and bound | |
| 2. |
In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex. |
| A. | a-b-e |
| B. | a-c-e |
| C. | a-c-d-e |
| D. | a-c-d-b-e |
| Answer» C. a-c-d-e | |
| 3. |
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. 6 | |
| 4. |
The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________ |
| A. | Total number of vertices |
| B. | Total number of edges |
| C. | Number of vertices – 1 |
| D. | Number of edges – 1 |
| Answer» C. Number of vertices – 1 | |
| 5. |
What is the pseudo code to compute the shortest path in Dijkstra’s algorithm? |
| A. | a) |
| Answer» B. | |
| 6. |
Dijkstra’s Algorithm cannot be applied on ______________ |
| A. | Directed and weighted graphs |
| B. | Graphs having negative weight function |
| C. | Unweighted graphs |
| D. | Undirected and unweighted graphs |
| Answer» C. Unweighted graphs | |
| 7. |
What is the time complexity of Dijikstra’s algorithm? |
| A. | O(N) |
| B. | O(N3) |
| C. | O(N2) |
| D. | O(logN) |
| Answer» D. O(logN) | |
| 8. |
Dijkstra’s Algorithm is used to solve _____________ problems. |
| A. | All pair shortest path |
| B. | Single source shortest path |
| C. | Network flow |
| D. | Sorting |
| Answer» C. Network flow | |