M

Mr. Dubey • 100.69K Points
Coach

Q. 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
Share
Explanation by: Mr. Dubey
the maximum flow problem involves finding a feasible flow between a source and a sink in a network that is maximum and not minimum.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Which MIMD systems are best scalable with respect to the number of processors?

Q. PJNF stands form:

Q. In which of the following adder circuits, the carry look ripple delay is eliminated ?

Q. The term '‘loud’ in cloud-computing refers to ______.

Q. Floyd Warshall Algorithm can be used for finding

Q. The output quality of a printer is measured by

Q. Describes the discovery of useful information from the web contents.

Q. Which command is used with vi editor to move the cursor to the left?

Q. If 5 files are transferred from server A to client B in the same session. The number of TCP connection between A and B is:

Q. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________

Question analytics