MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 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. |
Minimum cut algorithm comes along with the maximum flow problem. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
What is the running time of Karger's algorithm to find the minimum cut in a graph? |
| A. | O(E) |
| B. | O(|V|2) |
| C. | O(V) |
| D. | O(|E|) |
| Answer» C. O(V) | |
| 3. |
_____________ is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints. |
| A. | numerical problems |
| B. | graph partition |
| C. | network problems |
| D. | combinatorial problems |
| Answer» C. network problems | |
| 4. |
What is the minimum number of cuts that a graph with 'n' vertices can have? |
| A. | n+1 |
| B. | n(n-1) |
| C. | n(n+1)/2 |
| D. | n(n-1)/2 |
| Answer» D. n(n-1)/2 | |
| 5. |
In how many ways can a Gomory-Hu tree be implemented? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 6. |
Which algorithm is used to solve a minimum cut algorithm? |
| A. | Gale-Shapley algorithm |
| B. | Ford-Fulkerson algorithm |
| C. | Stoer-Wagner algorithm |
| D. | Prim's algorithm |
| Answer» D. Prim's algorithm | |
| 7. |
The weight of the cut is not equal to the maximum flow in a network. |
| A. | true |
| B. | false |
| Answer» C. | |
| 8. |
Which one of the following is not an application of max-flow min-cut algorithm? |
| A. | network reliability |
| B. | closest pair |
| C. | network connectivity |
| D. | bipartite matching |
| Answer» C. network connectivity | |
| 9. |
What is the running time of implementing a min-cut algorithm using bidirected edges in a graph? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N4) |
| D. | O(N2) |
| Answer» D. O(N2) | |
| 10. |
___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge. |
| A. | Minimum cut |
| B. | Maximum flow |
| C. | Maximum cut |
| D. | Graph cut |
| Answer» B. Maximum flow | |
| 11. |
______________ separates a particular pair of vertices in a graph. |
| A. | line |
| B. | arc |
| C. | cut |
| D. | flow |
| Answer» D. flow | |
| 12. |
__________ is a data structure used to collect a system of cuts for solving min-cut problem. |
| A. | Gomory-Hu tree |
| B. | Gomory-Hu graph |
| C. | Dancing tree |
| D. | AA tree |
| Answer» B. Gomory-Hu graph | |
| 13. |
The running time of implementing naïve solution to min-cut problem is? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(log N) |
| D. | O(N2) |
| Answer» E. | |