Maximum Flow Problem Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
What does Maximum flow problem involve?
finding a flow between source and sink that is maximum
finding a flow between source and sink that is minimum
finding the shortest path between source and sink
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.
A network can have only one source and one sink.
Question 2 Explanation:
A network can have only one source and one sink inorder to find the feasible flow in a weighted connected graph.
What is the source?
Vertex with no incoming edges
Vertex with no leaving edges
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.
Which algorithm is used to solve a maximum flow problem?
Question 4 Explanation:
Ford-fulkerson algorithm is used to compute the maximum feasible flow between a source and a sink in a network.
Does Ford- Fulkerson algorithm use the idea of?
Naive greedy algorithm approach
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.