MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Maximum Flow Problem Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the running time of Dinic s blocking flow algorithm? |
| A. | O(V<sup>2</sup>E) |
| B. | O(VE<sup>2</sup>) |
| C. | O(V<sup>3</sup>) |
| D. | O(E max |f|) |
| Answer» B. O(VE<sup>2</sup>) | |
| 2. |
Dinic s algorithm runs faster than the Ford-Fulkerson algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
The first step in the na ve greedy algorithm is? |
| A. | analysing the zero flow |
| B. | calculating the maximum flow using trial and error |
| C. | adding flows with higher values |
| D. | reversing flow if required |
| Answer» B. calculating the maximum flow using trial and error | |