M

Mr. Dubey • 52.30K Points
Coach 

Q. What is the time complexity of the brute force algorithm used to find the longest common subsequence?

(A) o(n)
(B) o(n2)
(C) o(n3)
(D) o(2n)
Correct : Option (D)

Explanation: 
 the time complexity of the brute force algorithm used to find the longest common subsequence is o(2n).

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. How non clustered index point to the data?

Q. A view shows the system hardware and how software components are distributed across the processors in the system.

Q. Other boot loaders which can be used to load Linux exist:

Q. A random access machine (RAM) and truing machine are different in

Q. Which of the following assumptions do we make while deriving linear regression parameters? 1. The true relationship between dependent y and predictor

Q. The CPI for 2000 was 171.2 and the projected CPI for 2008 is 220. What is the general inflation rate over the last 8 years?

Q. An xml component that defines the structure of a document is known as a(n):

Q. Which of the following sections of an executable binary file has all un initialized data items

Q. Mathematical operations can be performed on a string.

Q. Robustness gives the inability of a signal to withstand the impairments.