"If a procedure can be broken down into a sequence of tasks and if there are n1, n2, n3,……..nk ways to do these K tasks then there are (n1)X(n2)X……X(nk) ways to do this tasks." this rule is known as _____________.
Answers
Answered by
1
These TCS Ninja programming MCQ's were asked in ... topics in C. It is easy to answer these questions if you are ... C[m,n] will contain the length of the LCS of X and Y.
Similar questions