MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 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. |
In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost? |
| A. | 2 |
| B. | 0 |
| C. | 1 |
| D. | 3 |
| Answer» D. 3 | |
| 2. |
In the given graph, what is the minimum cost to travel from vertex 1 to vertex 3? |
| A. | 3 |
| B. | 2 |
| C. | 10 |
| D. | -3 |
| Answer» E. | |
| 3. |
Floyd Warshall’s Algorithm can be applied on __________ |
| A. | Undirected and unweighted graphs |
| B. | Undirected graphs |
| C. | Directed graphs |
| D. | Acyclic graphs |
| Answer» D. Acyclic graphs | |
| 4. |
Floyd Warshall’s Algorithm is used for solving ____________ |
| A. | All pair shortest path problems |
| B. | Single Source shortest path problems |
| C. | Network flow problems |
| D. | Sorting problems |
| Answer» B. Single Source shortest path problems | |