Algorithm Short-answer Questions

| March 27, 2015

Paper, Order, or Assignment Requirements

 

Please see the questions in my uploaded file.

  1. Suppose you have a chain of 11 matrices, with dimensions given by the
    12-tuple, . Thus, has dimensions  and in general,  has dimensions for .  Specifically, the 12-tuple is
    (5, 10, 9, 20, 6, 33, 5, 17, 12, 8, 16, 5).  How should you multiply the matrices in this chain so as to minimize the total number of numeric multiplications? Give your answer both as a parenthesization of the chain of matrices and also as the 10 specific matrix multiplications in order that produce this minimal number. (For example, if you were to multiply  times followed by a multiplication on the right by  , you could indicate these steps in order as:

(1) Compute
(2) Compute

And so forth (I am not claiming that these steps would necessarily occur.)  Important: Show your work!

 

  1. The first stanza of King Lear’s famous Act III scene 2 speech, with all of the punctuation and spaces removed and all lower case (from First Folio, 1623 edition, with original spelling) is:

blowwindesandcrackyourcheeksrageblowyoucataractsandhyrricanosspouttillyouhaueddrenchdoursteeplesdrownthecockesyousulphrousandthoughtexecutingfiresvauntcurriorsofoakecleauingthunderboltssingemywhiteheadandthouallshakingthunderstrikeflatthethickerotundityothworldcrackenaturesmouldsallgermainesspillatoncethatmakesingratefullman

Find the longest palindromic subsequence in this text and its length. Again, show your work. Also, take your full name, all lower case and with spaces and punctuation removed. What is the longest palindromic subsequence in it and what is its length?

 

Get a 5 % discount on an order above $ 150
Use the following coupon code :
2018DISC
Statistics Project
Algorithm Short-Answer Questions

Tags:

Category: Mathematics

Our Services:
Order a customized paper today!