Flows, cuts and the max-flow min-cut theorem

Flows, cuts and the max-flow min-cut theorem Quiz

Spec DC1–DC3 · AQA A-Level Further Maths: Quiz

Studying this course? Keep your progress in one place.

Pick an answer for each. Quizzes never use energy.

5 questions, one answer each

Each answer is checked as you go, with why.

See all 5 questions
  1. 1. A network has arcs SASA 9, SBSB 5, ABAB 4, BABA 2, ATAT 6 and BTBT 8. Find the capacity of the cut {S,A}∣{B,T}\{S,A\}|\{B,T\}.

    • A. 1515
    • B. 1717
    • C. 1111
    • D. 3434
  2. 2. A flow of value 17 and a cut of capacity 17 are found in the same network. What can be concluded?

    • A. The flow is not maximal
    • B. The cut is not minimal
    • C. The flow is maximal and the cut is minimal
    • D. Nothing, because the network may have other flows
  3. 3. A problem has three factories and one warehouse. How is the supersource used?

    • A. Arcs from each factory to the supersource
    • B. Arcs from the supersource to each factory, with the factories' supply limits as capacities
    • C. An arc from the supersource to the warehouse
    • D. No change is needed
  4. 4. At an intermediate node, arcs carrying 6 and 5 enter and one arc carrying 7 leaves. What does the other outgoing arc carry?

    • A. 1818
    • B. 11
    • C. 77
    • D. 44
  5. 5. The cuts of a network have capacities 13, 12 and 15. What is the greatest possible value of the maximum flow?

    • A. 1212
    • B. 1313
    • C. 1515
    • D. 4040

Quiz