Analysis and Design of Algorithm question bank

Objective Type Questions:

1. Which one is the correct equation for Fibonacci sequence by Dynamic Programming?

a. F[n]=F[n-1]+F[n-2]                        b. F_n=F_n-1+F_n-2                                       c. F(n)=F(n-1)+F(n-2)                        d. All of these

2. Which equation is correct when a character is matched in Longest Common Subsequence problem?

a. c[i,j]=c[i,j-1]                                     b. c[i,j]=c[i-1,j-1]                                 c. c[i,j]=c[i-1,j]                                     d. None of these