1-BiolaUniversityComputerScience.doc

Algorithms: Test 3 on Dynamic Programming 1. Suppose you are given three strings of English letters X = x1x2…xm, Y = y1y2…ym, Z = z1z2…zm+n. The string Z is a shuffle of X and Y if and only if Z can be formed by interspersing the characters from X and Y in a way that preserves the left-to-right ordering of the characters from X and Y respectively. For example, cchocohilaptes is a shuffle of chocolate and chips, but chcccochilatspe is not. (i) Design a dynamic programming algorithm with that will determine whether Z is a shuffle of X and Y given any strings X,Y, and Z. (ii) Analyze the running time of your algorithm and show that it is polynomial in n and m. (iii) demonstrate concretely how you can apply your algorithm to determine whether chocochilatspe is a shuffle of chocolate and chips.??? 2. Suppose you are managing the construction of billboards on the Imperial Highway, a heavily traveled stretch of road that runs west-east for M miles. The possible sites for billboards are given by numbers x1, x2, . . . , xn, each in the interval [0, M] (specifying their position along the highway, measured in miles from its western end). If you place a billboard at location xi, you receive a revenue of ri 0. Regulations imposed by the countys Highway Department require that no two of the billboards be within less than or equal to 5 miles of each other. You would like to place billboards at a subset of the sites so as to maximize your al revenue, subject to this restriction. (i) Give an algorithm that takes an instance of this problem as input and returns the maximum total revenue that can be obtained from any valid subset of sites. (ii) Analyze the running time of your algorithm and show that it is polynomial in n. (iii) demonstrate concretely how you can apply your algorithm to determine an optimal solution when M = 20, n = 4, and {x1, x2, x3, x4} = {6, 7, 12, 14} and {r1, r2, r3, r4} = {5, 6, 5, 1}. 3. Given an unlimited supply of 5￠, 4￠, 1￠