Practice Max Flow Min Cut Theorem (10.7) - Network Flows - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
5 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define a flow network.
Show hintHide hint
Think about how flow is managed in a system.
Question 2.
What is the principle of conservation of flow?
Show hintHide hint
Reflect on the balance of flow in a network.
3Question 3.
What must be true about a flow in a flow network?
- It can exceed edge capacities
- Inflow equals outflow at nodes
- It can accumulate at nodes
Show hintHide hint
Consider how flow behaves at nodes in a network.
4Question 4.
The Ford-Fulkerson algorithm aims to compute what?
- True
- False
Show hintHide hint
Reflect on the purpose of the algorithm.
Question 5.
Given the flow network with the following capacities: A-B (10), B-C (5), A-C (15), C-D (10), and B-D (15). Calculate the maximum flow from A to D.
Show hintHide hint
Try breaking the problem down into smaller flows and add them iteratively.
Question 6.
Explain how varying capacities on edges of a network impact the maximum flow and the minimum cut using a constructed graph.
Show hintHide hint
Build scenarios revealing how different capacities influence flow dynamics.

6 more questions in this section. Enroll free to practise them all.