# Minimum Cut Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
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

Question 1 Explanation:
Minimum cut algorithm is solved using Stoer-Wagner algorithm. Maximum flow problem is solved using Ford-Fulkerson algorithm. Stable marriage problem is solved using Gale-Shapley algorithm.

 Question 2
..... 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

Question 2 Explanation:
Minimum cut is a partition of the vertices in a graph 4. in two disjoint subsets joined by one edge. It is a cut that is minimal in some sense.

 Question 3
Minimum cut algorithm comes along with the maximum flow problem.
 A true B false

Question 3 Explanation:
Minimum cut algorithm is considered to be an extension of the maximum flow problem. Minimum cut is finding a cut that is minimal.

 Question 4
What does the given figure depict?
 A min cut problem B max cut problem C maximum flow problem D flow graph

Question 4 Explanation:
The given figure is a depiction of min cut problem since the graph is partitioned to find the minimum cut.

 Question 5
..... separates a particular pair of vertices in a graph.
 A line B arc C cut D flow