Practice Network Flows (10) - 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.
What is meant by the term 'network flow'?
Show hintHide hint
Think about the flow of materials like water or oil.
Question 2.
Define conservation of flow.
Show hintHide hint
What happens to flow in a circle?
3Question 3.
What is the purpose of the Ford-Fulkerson algorithm?
- To determine the shortest path
- To calculate maximum flow
- To find the least cost
Show hintHide hint
What is the main goal of the required analysis?
4Question 4.
True or False: The maximum flow in a network can exceed the capacity of the edges.
- True
- False
Show hintHide hint
Think about the limits placed on each edge.
Question 5.
Given a directed graph with specified capacities and an initial flow, calculate the maximum flow using the Ford-Fulkerson algorithm. Show your working steps.
Show hintHide hint
Identify paths systematically and document capacity updates.
Question 6.
Create a flow network diagram with a source, sink, and nodes with varying capacities. Identify the maximum flow and cut based on the given diagram.
Show hintHide hint
Make sure to check edge capacities thoroughly to find the minimum cut.

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