What is a network flow?
A Graph
B Path
C Cycle
D Flow
What does a maximum flow problem solve?
A Capacity
B Maximum path
C Bottleneck
D Total flow
What is a cut in a flow network?
A A subset of edges
B A path
C A flow increase
D A route
What is the main idea behind randomized algorithms?
A Random decisions
B Exact solutions
C Speed optimization
D Deterministic outcomes
In network flows, what does the Ford Fulkerson algorithm solve?
A Path optimization
B Maximum flow
C Minimum cut
D Graph coloring
What is a bottleneck in the context of network flows?
A Maximum capacity
B Path with least capacity
C Highest demand
D Flow split
Which of the following is a characteristic of randomized algorithms?
A Constant performance
B Probabilistic behavior
C Exact solutions
D Always deterministic
What does the minimum cut theorem in network flows state?
A The flow is infinite
B The maximum flow equals the minimum cut
C The source has no capacity
D Flow must equal capacity
What is a flow network?
A A directed graph
B A static graph
C A weighted undirected graph
D A tree
What is the primary goal of network flow problems?
A Minimize path length
B Find optimal paths
C Maximize total flow
D Maximize flow capacity
Which algorithm is often used for finding a maximum flow in a network?
A Dijkstra’s algorithm
B Kruskal’s algorithm
C Ford Fulkerson algorithm
D Bellman Ford algorithm
What is a residual graph?
A A graph with no edges
B A graph with updated flow capacities
C A graph with a single vertex
D A graph of shortest paths
In the context of network flows, what is a source?
A A starting point for the flow
B The endpoint of the flow
C A node with maximum capacity
D A node with zero capacity
What is the purpose of using randomized algorithms in network flow problems?
A To reduce computational time
B To find exact solutions
C To optimize flow paths
D To guarantee maximum flow
What is a sink in a flow network?
A A node that receives flow
B A node that produces flow
C A node with maximum flow
D A node with minimum flow