MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Floyd-Warshall Algorithm Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The time taken to compute the transitive closure of a graph is Theta(n2). |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
Using logical operator s instead arithmetic operators saves time and space. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 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 | |