1-BiolaUniversityComputerScience.doc

  1. 1、本文档共3页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
1-BiolaUniversityComputerScience

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¢

文档评论(0)

***** + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档