Maximum Flow Problem Multiple choice Questions and Answers (MCQs)

 

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

Maximum Flow Problem Multiple choice Questions and Answers (MCQs)

Click on any option to know the CORRECT ANSWERS

Question 1
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
Puzzles Questions answers

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
A network can have only one source and one sink.
A
False
B
True
Library science Questions answers

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
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
Commerce Questions answers

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
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
Current affairs Questions answers

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
Does Ford- Fulkerson algorithm use the idea of?
A
Naive greedy algorithm approach
B
Residual graphs
C
Minimum cut
D
Minimum spanning tree
Economics Questions answers

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.

 

 Download all FREE PDF Ebook >>>CLICK HERE<<<