Register

CMI-2021-DataScience-A: 1

• edited by
212 views
2 votes
2 votes

There are two longest subsequences, not necessarily contiguous, common to the strings $\text{“ARTIFICIAL"}$ and $\text{“INTELLIGENCE."}$ They are $\text{“IIC"}$ and $\text{“TIC"}$ which are of length three.

Consider two strings $\text{S1 = “CORONAVIRUS"}$ and $\text{S2 = “SARSCOVID".}$ Let $x$ be the length of a longest common subsequence between $\text{S} 1$ and $\text{S} 2$ and let $y$ be the number of such longest common subsequences of length $x$ between $\text{S} 1$ and $\text{S} 2$. What is $x+5y?$ 

  1. $13$
  2. $15$
  3. $14$
  4. $16$
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
admin asked Jul 23, 2022
306 views
CMI-2021-DataScience-A: 2
The roots of the polynomial $p(x)=x^{4}-2x^{3}-2x^{2}+8x-8$ are: $1, -1, 2, 2+3 i$ $1+i, 1-i, 2, -2$ $1, -1+i, 2, 2+3 i$ $1+i, -1+i, 2, -2$
The roots of the polynomial $p(x)=x^{4}-2x^{3}-2x^{2}+8x-8$ are:$1, -1, 2, 2+3 i$$1+i, 1-i, 2, -2$$1, -1+i, 2, 2+3 i$$1+i, -1+i, 2, -2$
User Avatar
0 votes
0 votes
1 answer
2
admin asked Jul 23, 2022
320 views
CMI-2021-DataScience-A: 3
Consider the following code, in which $\text{A}$ is an array indexed from $0.$ function foo (A , n) { m = A [0] ; x = 0 ; for i = 0 to n – 1 { x = x + A [i] ; if (m < x) { m = x ; } if (x < 0) { x = 0 ; } } return (m) ; } If $\text{A}=[-12, -3, 5, 10, 8, -16, -23, 12, -5, 7]$, what will $\textsf{foo(A, 10)}$ return? $23$ $17$ $-17$ $35$
Consider the following code, in which $\text{A}$ is an array indexed from $0.$function foo (A , n) { m = A [0] ; x = 0 ; for i = 0 to n – 1 { x = x + A [i] ; if (m < x)...
User Avatar
Link Copied!