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

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 common subsequence problem?

A

Recursion

B

Dynamic programming

C

Both recursion and dynamic programming

D

Greedy algorithm

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 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

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

A

True

B

False

Longest palindromic subsequence is an example of ______________

A

Greedy algorithm

B

2D dynamic programming

C

1D dynamic programming

D

Divide and conquer

The probability that Mohan can solve a mathematical problem is 2/3 and Sohan can solve the same problem is 3/4. If both Mohan and Sohan work on this problem, then what is the probability that the problem gets solved.

A

12/13

B

13/11

C

11/12

D

12/11

E

None of these

Which of the following statements regarding static methods are correct?
1. Static methods are difficult to maintain, because you can not change their implementation.
2. Static methods can be called using an object reference to an object of the class in which this method is defined.
3. Static methods are always public, because they are defined at class-level.
4. Static methods do not have direct access to non-static methods which are defined inside the same class.

A

1 and 2

B

2 and 4

C

3 and 4

D

1 and 3

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

Related Questions