McqMate

Q. |
## Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: dinic’s algorithm includes construction of level graphs and reslidual graphs and finding of augmenting paths along with blocking flow and is faster than the |

3.1k

0

Do you find this helpful?

15

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- The quick hull algorithm runs faster if the input uses non- extreme points.
- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- What is the computational complexity of Binary GCD algorithm where a and b are integers?