M

Mr. Dubey • 52.30K Points
Coach 

Q. Which of the following problems should be solved using dynamic programming?

(A) mergesort
(B) binary search
(C) longest common subsequence
(D) quicksort
Correct : Option (C)

Explanation: 
 the longest common subsequence problem has both, optimal substructure and overlapping subproblems. hence, dynamic programming should be used the solve this problem.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following is private IP address?

Q. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

Q. Which chart is a tool that depicts project as network diagram that is capable of graphically representing main events of project in both parallel and

Q. ________ memory system which is discussed later can improve matters in this respect

Q. The up level browser will perform validation on the client, using the _________ and _____________

Q. TTL is a

Q. Check Sheet(Checklist. is considered a simple , but powerful statistical tool because it differentiates between two extremes.

Q. The decision making criteria that should be used to achieve maximum long term pay off is

Q. COUNT command is used to

Q. The relation R defined on the set A = {1, 2, 3, 4, 5} by R = {(x, y) : x2 – y2 < 16} is given by