Longest palindromic subsequence is an example of ______________

The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using __________

A

Recursion

B

Dynamic programming

C

Brute force

D

Recursion, Dynamic programming, Brute force

In the brute force implementation to find the longest increasing subsequence, all the subsequences of a given sequence are found. All the increasing subsequences are then selected and the length of the longest subsequence is found. What is the time complexity of this brute force implementation?

A

O(n)

B

O(n2)

C

O(n!)

D

O(2n)

Which of the following methods can be used to solve the longest palindromic subsequence problem?

A

Dynamic programming

B

Recursion

C

Brute force

D

Dynamic programming, Recursion, Brute force

For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?

A

A string that is a palindrome d) Some strings of length two View Answer]

B

A string of length one

C

A string that has all the same letters(e.g. aaaaaa)

D

Some strings of length two

What is the length of the longest palindromic subsequence for the string “ababcdabba”?

A

6

B

7

C

8

D

9

What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?

A

O(1)

B

O(2n)

C

O(n)

D

O(n2)

For every non-empty string, the length of the longest palindromic subsequence is at least one.

A

True

B

False

Which of the following is not a palindromic subsequence of the string “ababcdabba”?

A

abcba

B

abba

C

abbbba

D

adba

Longest common subsequence is an example of ____________

A

Greedy algorithm

B

2D dynamic programming

C

1D dynamic programming

D

Divide and conquer

What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

A

Linear Time

B

Exponential Time

C

Logarithmic Time

D

Cubic Time

Longest palindromic subsequence is an example of ______________

Related Questions