MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What does Maximum flow problem involve? |
| A. | finding a flow between source and sink that is maximum |
| B. | finding a flow between source and sink that is minimum |
| C. | finding the shortest path between source and sink |
| D. | computing a minimum spanning tree |
| Answer» B. finding a flow between source and sink that is minimum | |
| 2. |
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
Which algorithm is used to solve a maximum flow problem? |
| A. | Prim's algorithm |
| B. | Kruskal's algorithm |
| C. | Dijkstra's algorithm |
| D. | Ford-Fulkerson algorithm |
| Answer» E. | |
| 4. |
What is the running time of Dinic's blocking flow algorithm? |
| A. | O(V2E) |
| B. | O(VE2) |
| C. | O(V3) |
| D. | O(E max |f|) |
| Answer» B. O(VE2) | |
| 5. |
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges? |
| A. | O(|E|) |
| B. | O(|E||V|) |
| C. | O(|E|2|V|) |
| D. | O(|E| log |V|) |
| Answer» D. O(|E| log |V|) | |
| 6. |
Under what condition can a vertex combine and distribute flow in any manner? |
| A. | It may violate edge capacities |
| B. | It should maintain flow conservation |
| C. | The vertex should be a source vertex |
| D. | The vertex should be a sink vertex |
| Answer» C. The vertex should be a source vertex | |
| 7. |
What is the source? |
| A. | Vertex with no incoming edges |
| B. | Vertex with no leaving edges |
| C. | Centre vertex |
| D. | Vertex with the least weight |
| Answer» B. Vertex with no leaving edges | |
| 8. |
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 | |
| 9. |
A simple acyclic path between source and sink which pass through only positive weighted edges is called? |
| A. | augmenting path |
| B. | critical path |
| C. | residual path |
| D. | maximum path |
| Answer» B. critical path | |
| 10. |
In what time can an augmented path be found? |
| A. | O(|E| log |V|) |
| B. | O(|E|) |
| C. | O(|E|2) |
| D. | O(|E|2 log |V|) |
| Answer» C. O(|E|2) | |
| 11. |
How many constraints does flow have? |
| A. | one |
| B. | three |
| C. | two |
| D. | four |
| Answer» D. four | |
| 12. |
Does Ford- Fulkerson algorithm use the idea of? |
| A. | Naïve greedy algorithm approach |
| B. | Residual graphs |
| C. | Minimum cut |
| D. | Minimum spanning tree |
| Answer» C. Minimum cut | |
| 13. |
A network can have only one source and one sink. |
| A. | False |
| B. | True |
| Answer» C. | |
| 14. |
Who is the formulator of Maximum flow problem? |
| A. | Lester R. Ford and Delbert R. Fulkerson |
| B. | T.E. Harris and F.S. Ross |
| C. | Y.A. Dinitz |
| D. | Kruskal |
| Answer» C. Y.A. Dinitz | |