M

Mr. Dubey • 52.26K Points
Coach 

Q. Which of the following methods can be used to solve the edit distance problem?

(A) recursion
(B) dynamic programming
(C) both dynamic programming and recursion
(D) greedy algorithm
Correct : Option (C)

Explanation: 
 both dynamic programming and recursion can be used to solve the edit distance problem.

Share

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. "Using model of how a human would use a proposed system to obtain predict usability measure by calculation or simulation." Choose the evalua

Q. Validation plan describes

Q. VMM is

Q. The tar command in UNIX

Q. Which is the symbol used to denote the SELECT operation?

Q. Point out the wrong statement.

Q. How are variable length arguments specified in the function heading?

Q. Exposing a stand-alone SOAP endpoint using the:-

Q. Find a counterexample of ∀x∀y(xy > y), where the domain for all variables consists of all integers.

Q. The field of HCI