Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) Does Ford- Fulkerson algorithm use the idea of?

(A) naïve greedy algorithm approach
(B) residual graphs
(C) minimum cut
(D) minimum spanning tree
Correct answer : Option (B) - residual graphs

Explanation: 
 ford-fulkerson algorithm uses the idea of residual graphs which is an extension of naïve greedy approach allowing undo operations.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. is around one-half of the maximum seek time.

Q. Which two routing protocols can be redistributed into OSPF by a Cisco router?

Q. Which of the following is true about Naive Bayes ?

Q. AMIs are operating systems running on the virtualization hypervisor.

Q. which of the following is an operating system?

Q. Predict the output? #include <iostream> using namespace std; class Test { int x; Test() { x = 5; } }; int main() { Test *t = new Test; cout << t->x; }

Q. In the words of …………………..,”…………………. means knowing exactly what you want men to do and seeing that they do it in the best and cheapest way”. Find the above blank with right option

Q. What is the major advantage of ECL logic?

Q. The number failed attempts to access memory, stated in the form of a fraction is called as

Q. While inserting a diskette into the diskette drive of a PC, the diskette’s label side should face