Question 1 : How many constraints does flow have?
1. one
2. three
3. two
4. four
5.
View Answer   Discuss with Members

Question 2 : 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
5.
View Answer   Discuss with Members

Question 3 : What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
1. O(|E|)
2. O(|E||V|)
3. O(|E|²|V|)
4. O(|E| log |V|)
5.
View Answer   Discuss with Members

Question 4 : In what time can an augmented path be found?
1. O(|E| log |V|)
2. O(|E|)
3. O(|E|²)
4. O(|E|² log |V|)
5.
View Answer   Discuss with Members

Question 5 : 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
5.
View Answer   Discuss with Members

Question 6 : Under what condition can a vertex combine and distribute flow in any manner?
1. It may violate edge capacities
2. It should maintain flow conservation
3. The vertex should be a source vertex
4. The vertex should be a sink vertex
5.
View Answer   Discuss with Members

Question 7 : 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
5.
View Answer   Discuss with Members

Question 8 : Does Ford- Fulkerson algorithm use the idea of?
1. Naïve greedy algorithm approach
2. Residual graphs
3. Minimum cut
4. Minimum spanning tree
5.
View Answer   Discuss with Members

Question 9 : What is the source?
1. Vertex with no incoming edges
2. Vertex with no leaving edges
3. Centre vertex
4. Vertex with the least weight
5.
View Answer   Discuss with Members

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