QuizzesBeginner's Guide to Network Flow Algorithms
beginner
dsa

Beginner's Guide to Network Flow Algorithms

Explore the basics of network flow algorithms and their applications.

15 minutes 15 questions Pass at 70%
Time Limit
15 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

15 questions on Beginner's Guide to Network Flow Algorithms. Work through them here, then start the quiz to answer them and see your score.

  1. 1.What is the primary goal of a network flow algorithm?

    • ATo detect cycles in a graph
    • BTo sort nodes in topological order
    • CTo find the maximum flow from source to sink
    • DTo find the shortest path in a graph
  2. 2.Which algorithm is commonly used to find the maximum flow in a flow network?

    • AKruskal's Algorithm
    • BFord-Fulkerson Algorithm
    • CPrim's Algorithm
    • DDijkstra's Algorithm
  3. 3.In a flow network, what does a 'bottleneck' refer to?

    • AA cycle in the network
    • BAn edge that limits the flow
    • CA node with the highest degree
    • DAn edge with the maximum capacity
  4. 4.What is the capacity of an edge in a flow network?

    • AThe maximum flow it can carry
    • BThe cost to traverse it
    • CThe shortest path through it
    • DThe number of nodes it connects
  5. 5.In the context of network flow, what is a 'sink'?

    • AA node with the highest capacity
    • BA node where flow originates
    • CA node where flow is absorbed
    • DA node with no outgoing edges
  6. 6.Which of the following is a characteristic of an augmenting path in a flow network?

    • AIt has the maximum capacity
    • BIt decreases the total flow
    • CIt has no cycles
    • DIt increases the total flow
  7. 7.What is the residual capacity of an edge in a flow network?

    • AThe minimum capacity of the network
    • BThe flow currently passing through the edge
    • CThe total capacity of the network
    • DThe total capacity minus the current flow
  8. 8.What is the main purpose of the Edmonds-Karp algorithm?

    • ATo find the shortest path in a weighted graph
    • BTo detect negative cycles
    • CTo find the minimum spanning tree
    • DTo implement the Ford-Fulkerson method using BFS
  9. 9.In a flow network, what does 'flow conservation' mean?

    • AFlow is minimized at the sink
    • BFlow is maximized at the source
    • CFlow entering a node equals flow leaving it
    • DFlow is constant across all edges
  10. 10.What is a 'cut' in a flow network?

    • AA cycle in the network
    • BA path with no residual capacity
    • CA node with maximum flow
    • DA set of edges that, if removed, would disconnect the source from the sink
  11. 11.Which of the following is true about the Max-Flow Min-Cut Theorem?

    • AThe maximum flow is always less than the minimum cut
    • BThe minimum cut is always zero
    • CThe maximum flow equals the capacity of the minimum cut
    • DThe maximum flow is independent of the cut
  12. 12.What is the time complexity of the Edmonds-Karp algorithm?

    • AO(E log V)
    • BO(V^2)
    • CO(V^3)
    • DO(VE^2)
  13. 13.In a flow network, what is a 'source'?

    • AA node with the highest degree
    • BA node where flow originates
    • CA node where flow is absorbed
    • DA node with no incoming edges
  14. 14.What is the purpose of using Breadth-First Search (BFS) in the Edmonds-Karp algorithm?

    • ATo detect cycles
    • BTo sort nodes topologically
    • CTo find the shortest augmenting path
    • DTo find the longest path
  15. 15.What does an augmenting path with zero residual capacity indicate?

    • AThe path is not part of the network
    • BThe path has reached its maximum flow
    • CThe path can carry more flow
    • DThe path is a bottleneck