Longest palindromic subsequence is an example of

M

Mr. Dubey • 52.63K Points
Coach

Q. Longest palindromic subsequence is an example of

(A) greedy algorithm

(B) 2d dynamic programming

(C) 1d dynamic programming

(D) divide and conquer

Correct Answer - Option(B)
Views: 855
Filed under category Design and Analysis of Algorithms

Share

Explanation by: Mr. Dubey

 longest palindromic subsequence is an example of 2d dynamic programming.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Which of the following policies is not mentioned in ‘not to violate’ regarding CloudBurst?

Q. A Guideline that channelize decision making is called :

Q. A partial ordered relation is transitive, reflexive and

Q. Point out the correct statement.

Q. The latest PC keyboards use a circuit that senses the movement by the change in its capacitance,

Q. _________ defined as a collection of program statements with four basic attribute i.e. input and output, function, mechanics and internal data

Q. A path of a graph is said to be ______ if it contains all the edges of the graph.

Q. A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement

Q. A J-K flip-flop has two control inputs. What happens to the Q output on the active edge of the clock if both control inputs are asserted simultaneousl

Q. 2's complement of hexadecimal number B70A is

Question analytics