MCQ1 mark
Consider the following recurrence relations:
For all ,
Assume that for all , and .
Which one of the following options is correct?
Single correct
GATE CSE previous year questions · Algorithms
Single correct
Single correct
Single correct
Single correct
Single correct
Algorithm B1: For i = 1, 2, ..., n
For j = 1, 2, ..., n
T[i][j] = 2T[i-1][j] + 3T[i][j-1]
Algorithm B2: For s = 2, 3, ..., 2n
For i = 1, 2, ..., n
For j = 1, 2, ..., n
If (i + j == s)
T[i][j] = 2T[i-1][j] + 3T[i][j-1]
Algorithm , is said to be correct if and only if it calculates the correct values of , for all , (as per the recursive formulation) at the end of the execution of the algorithm .
Which one of the following statements is true?Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Single correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon