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

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.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

A network can have only one source and one sink.

False | |

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?

Vertex with no incoming edges | |

Vertex with no leaving edges | |

Centre vertex | |

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?

Prim's algorithm | |

Kruskal's algorithm | |

Dijkstra's algorithm | |

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?

Naive greedy algorithm approach | |

Residual graphs | |

Minimum cut | |

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.