Question

HOMEWORK6 CS425.docx - Word REVIEW VIEW Foxit PDF REFERENCES MAILINGS АавbccDt Аавьсах АавьсАавьссс Аав 1 Normal 1 No Spac... Heading 1 Heading 2 Title A. E E B Paragraph Styles 2. Using the Dynamic Programming concept, determine the Binomial coefficients using n = 7 and k Determine the values of C(5,3), 17, 2) and (6,3) from the table constructed. 3. Find the optimal order, and its cost, for evaluating the product of A, XA, XA, XA XA Where the sizes of matrices are: A, 10 x 4 A4x5 A. 5 x 20 A, 20 x 2 A, 2 x 50 Find the M-table and P-table first. 4. Given the following DNA sequences: X = (CCGGGTTACCA) and Y = (GGAGTTCA! Determine the Longest Common Subsequence (LCS) of X and Y using Dynamic Programming algorithm. 5. Given the following keys and probabilities of searching them: Keys: с E F нот Probabilities: 0.05 0.15 0.05 0.35 0.05 0.35 Determine the optimal binary search tree which will take minimum average number of searches. Construct the m-table and the r-table first. swi

Answer 1

Solution to problem statement 2:-

The table is constructed for binomial coefficients calculation and it can be seen below in the snapshot.

c c[n,o)=c(n,n =1 in,k)= c(n-1, k-1) + 6(n-1,k) n 112 34 15 16 17 | *- aso 2 1 | 2 | X 3 11 13 13 11 x 4 4 1 6 1 4 x 511 151101 1015 6 1 1. 6 | 15 | 2015 | 6 11721 35135 2117 | € 15,3) = 10 c (72) = 21 16, 3) = 20