M

Mr. Dubey • 52.30K Points
Coach 

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

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (A)

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

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. When numbers, letters or words are represented by a special group of symbols, this process is called

Q. What would be the current working directory at the end of the following command sequence? $ pwd /home/user1/proj $ cd src $ cd generic $ cd . $ pwd

Q. What is the average retrieval time when n keys hash to the same slot?

Q. Given the following relation Student (roll no, name, course no, course max. marks, year of study, address) The corresponding 3 NF relations are

Q. Number of pins in 8051 microcontroller with package.

Q. When using the Big Endian assignment to store a number, the sign bit of the number is stored in

Q. When both inputs of SR latches are low, the latch

Q. What are the types of prototypes?

Q. Which is known as Reduction?

Q. Which is the core wrapper of GSN?