Show reasons not just answer.

8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT an
9. Referring again to the dynamic programming problem considered in Question 8, what is the cost of matching the two substrin 8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT and the TOP string is ELEPHANT. The following string operations have the conventional costs: Delete LEFT 1 Delete TOP = 1 Match 0 What is the cost of matching two substrings ELEPH to EALEP illustrated by the shaded square d(5,5) in the table below? (a) 1 (b) 2 (c) 3 (d) 5 (e) None of the above E E P H A T E A L E P T Z 0. LLUI 0. 9. Referring again to the dynamic programming problem considered in Question 8, what is the cost of matching the two substrings ELEPHAN and EALEP? (a) 3 (b) 4 (c) 5 (d) 6 (e) None of the above



Source link

Leave a Reply

Your email address will not be published.