# YOU may join our Telegram for all subjects PDF BOOKS. https://t.me/+Ccx9McEia7wyODg1

## Maximum Flow Problem Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 1 Explanation:
The maximum flow problem involves finding a feasible flow between a source and a sink in a network that is maximum and not minimum.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A network can have only one source and one sink.
 A False B True
Question 2 Explanation:
A network can have only one source and one sink inorder to find the feasible flow in a weighted connected graph.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 3 Explanation:
Vertex with no incoming edges is called as a source. Vertex with no leaving edges is called as a sink.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 4 Explanation:
Ford-fulkerson algorithm is used to compute the maximum feasible flow between a source and a sink in a network.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Does Ford- Fulkerson algorithm use the idea of?
 A Naive greedy algorithm approach B Residual graphs C Minimum cut D Minimum spanning tree
Question 5 Explanation:
Ford-Fulkerson algorithm uses the idea of residual graphs which is an extension of naive greedy approach allowing undo operations.

There are 5 questions to complete.