## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## 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?

Gale-Shapley algorithm | |

Ford-Fulkerson algorithm | |

Stoer-Wagner algorithm | |

Prim's algorithm |

**Current affairs Questions answers**

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.

Minimum cut | |

Maximum flow | |

Maximum cut | |

Graph cut |

**Journalism Questions answers**

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.

true | |

false |

**Commerce Questions answers**

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?

min cut problem | |

max cut problem | |

maximum flow problem | |

flow graph |

**GK Questions answers**

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.

line | |

arc | |

cut | |

flow |

**Commerce Questions answers**

Question 5 Explanation:

A cut separates a particular pair of vertices in a weighted undirected graph and has minimum possible weight.

There are 5 questions to complete.