The recursive formula for Binomial Coefficient C(n, k) is given by C(n, k) = C(n-1, k-1)+...

 

Transcribed Image Text:

The recursive formula for Binomial Coefficient C(n, k) is given by C(n, k) = C(n-1, k-1)+ C(n-1, k). Consider the following dynamic programming implementation for Binomial Coefficient. Which of the following lines completes the below code? int binomial_coefficient (int n, int k). { } int i, j; int C[n]; for(i= 1; i < =n; i++) { } for(j=0; j < = mimimum (i, k); j++) { } return C[n] [k]; if (j==0 || j == 1) else C [i] [j] =1; OA. Clillil - C[n-1, k-1]+ C[n-1, kl OB. C[i][i] = C[i-1, j-1] + C[i-1.j] OC. C[i]li] = Cli, j-1] + Cli, j] The recursive formula for Binomial Coefficient C(n, k) is given by C(n, k) = C(n-1, k-1)+ C(n-1, k). Consider the following dynamic programming implementation for Binomial Coefficient. Which of the following lines completes the below code? int binomial_coefficient (int n, int k). { } int i, j; int C[n]; for(i= 1; i < =n; i++) { } for(j=0; j < = mimimum (i, k); j++) { } return C[n] [k]; if (j==0 || j == 1) else C [i] [j] =1; OA. Clillil - C[n-1, k-1]+ C[n-1, kl OB. C[i][i] = C[i-1, j-1] + C[i-1.j] OC. C[i]li] = Cli, j-1] + Cli, j]

Answer rating: 100% (QA)

The image contains a partially completed piece of code that is intended to implement a dynamic progr... View the full answer