Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Fundamental Algorithms, Assignment 7

    Uploaded by

    Aashish D
    This document provides instructions for Fundamental Algorithms Assignment 7 due on March 24/25. It includes 6 problems: 1) determining the longest common subsequence of two strings, 2) writing all parenthesizations of a string, 3) finding longest increasing/decreasing subsequences, 4) finding an optimal parenthesization of a matrix chain product, 5) exercises involving logarithms, and 6) two quotes about theories of the universe.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Fundamental Algorithms, Assignment 7

    Uploaded by

    Aashish D
    12 views2 pages
    This document provides instructions for Fundamental Algorithms Assignment 7 due on March 24/25. It includes 6 problems: 1) determining the longest common subsequence of two strings, 2) writing all parenthesizations of a string, 3) finding longest increasing/decreasing subsequences, 4) finding an optimal parenthesization of a matrix chain product, 5) exercises involving logarithms, and 6) two quotes about theories of the universe.

    Original Title

    hw7.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions for Fundamental Algorithms Assignment 7 due on March 24/25. It includes 6 problems: 1) determining the longest common subsequence of two strings, 2) writing all parenthesizations of a string, 3) finding longest increasing/decreasing subsequences, 4) finding an optimal parenthesization of a matrix chain product, 5) exercises involving logarithms, and 6) two quotes about theories of the universe.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    12 views2 pages

    Fundamental Algorithms, Assignment 7

    Uploaded by

    Aashish D
    This document provides instructions for Fundamental Algorithms Assignment 7 due on March 24/25. It includes 6 problems: 1) determining the longest common subsequence of two strings, 2) writing all parenthesizations of a string, 3) finding longest increasing/decreasing subsequences, 4) finding an optimal parenthesization of a matrix chain product, 5) exercises involving logarithms, and 6) two quotes about theories of the universe.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Fundamental Algorithms, Assignment 7

    Due March 24/25 in Recitation.

    What you need is that your brain is open. Paul Erdos

    1. Determine an LCS of 10010101 and 010110110 using the algorithm


    studied.

    2. Write all the parenthesizations of ABCDE. Associate them in a nat-


    ural way with (setting n = 5) the terms P (i)P (n i), i = 1, 2, 3, 4
    given in the recursion for P (n).

    3. Let x1 , . . . , xm be a sequence of distinct real numbers. For 1 i m


    let IN C[i] denote the length of the longest increasing subsequence
    ending with xi . Let DEC[i] denote the length of the longest decreasing
    subsequence ending with xi . Caution: The subsequence must use xi .
    For example, 20, 30, 4, 50, 10. Now IN C[5] = 2 because of 4, 10 we
    do not count 20, 30, 50.

    (a) Find an efficient method for finding the values IN C[i], 1 i n.


    (You should find IN C[i] based on the previously found IN C[j],
    1 j < i. Your algorithm should take time O(i) for each partic-
    ular i and thus O(n2 ) overall.)
    (b) Let LIS denote the length of the longest increasing subsequence
    of x1 , . . . , xm . Show how to find LIS from the values IN C[i].
    Your algorithm, starting with the IN C[i], should take time O(n).
    Similarly, let DIS denote the length of the longest decreasing
    subsequence of x1 , . . . , xm . Show how to find DIS from the values
    DEC[i].
    (c) Suppose i < j. Prove that it is impossible to have IN C[i] =
    IN C[j] and DEC[i] = DEC[j]. (Hint: Show that if xi < xj
    then IN C[j] IN C[i] + 1.)
    (d) Deduce the following celebrated result (called the Monotone Sub-
    sequence Theorem) of Paul Erdos and George Szekeres: Let m =
    ab + 1. Then any sequence x1 , . . . , xm of distinct real numbers
    either LIS > a or DIS > b. (Idea: Assume not and look at
    the pairs (IN C[i], DEC[i]).) Paul Erdos was a great twentieth
    century mathematician, whose work remains highly influential in
    many areas.
    4. Find an optimal parenthesization of a matrix-chain product whose
    sequence of dimensions is 5, 10, 3, 12, 5, 50, 6.

    5. Some exercises in logarithms:



    (a) Write lg(4n / n) in simplest form. What is its asymptotic value.
    (b) Which is bigger, 5313340 or 7271251 ? Give reason. (You can use a
    calculator but you cant use any numbers bigger than 109 .)
    (c) Simplify n2 lg(n2 ) and lg2 (n3 ).
    2 /2
    (d) Solve (for x) the equation ex = n1 .
    (e) Write logn 2n and logn n2 in simple form.
    (f) What is the relationship between lg n and log3 n?
    (g) Assume i < n. How many times need i be doubled before it
    reaches (or exceeds) n?

    (h) Write lg[nn en 2n] precisely as a sum in simplest form. What
    is it asymptotic to as n ? What is interesting about the
    bracketed expression?

    There is a theory which states that if ever anybody discovers ex-


    actly what the Universe is for and why it is here, it will instantly
    disappear and be replaced by something even more bizarre and
    inexplicable. There is another theory which states that this has
    already happened.
    Douglas Adams

    You might also like