Question 21 : A network can have only one source and one sink.
1. False
2. True
3.
4.
View Answer   Discuss with Members

Question 22 : What is the running time of Dinic's blocking flow algorithm?
1. O(V²E)
2. O(VE²)
3. O(V³)
4. O(E max |f|)
View Answer   Discuss with Members

Question 23 : A simple acyclic path between source and sink which pass through only positive weighted edges is called?
1. augmenting path
2. critical path
3. residual path
4. maximum path
View Answer   Discuss with Members

Question 24 : Who is the formulator of Maximum flow problem?
1. Lester R. Ford and Delbert R. Fulkerson
2. T.E. Harris and F.S. Ross
3. Y.A. Dinitz
4. Kruskal
View Answer   Discuss with Members

Question 25 : The first step in the naïve greedy algorithm is?
1. analysing the zero flow
2. calculating the maximum flow using trial and error
3. adding flows with higher values
4. reversing flow if required
View Answer   Discuss with Members