网站大量收购独家精品文档,联系QQ:2885784924

算法设计与分析(2013.1.8).doc

  1. 1、本文档共5页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
新疆大学硕士研究生课程期末考试试卷 《The Design Analysis of Algorithms》试卷 2012—2013学年度第学期: 信息科学与工程学院 班级: 2012级计算机应用、软件专业 姓名: 学号: 2013.1.8 题号 一 二 三 四 五 六 总分 得分 签名 得分 评卷人 1.Answer the following questions(40 points) What are algorithms? What is the role of algorithms relative to other technologies used in computers?(P5 P10) Explain why dynamic programming algorithms and Greedy algorithms apply to optimization problem.( P321) What is an analyzing algorithm?(P21) When we study the asymptotic efficiency of algorithm? (P41) Please define several types of asymptotic notation: Θ(g(n)) ={f(n) }, O (g(n)) ={f(n) }, Ω (g(n)) ={f(n) }. What is the main difference between the complexity classes of problem: NP, P, NPC. Vertex cover problem belong to which one? Is it hard to find a vertex cover that is near-optimal? How to do? (P1024) 得分 评卷人 2. Algorithm’s application ( 25 points). 5)Run the Bellman-Ford algorithm on the following digraph, using vertex s as the source and uses the technique of relaxation. Graham’s scan solves the convex-hull problem by maintaining a stack S of candidate points. Please execute Graham’s scan on the figure 2, and its costs time. (P951) Design the efficient comparison network ,when it is given the input sequence 12,8,9,5 得分 评卷人 3. Solve problems (40 points) Give a dynamic programming solution to the LCS problem. Longest Common Subsequence problem is given two sequences x[1 . . m] and y[1 . . n] and find a longest subsequence Z[1 . . k] that is common to them both. Determine an LCS of {ABAZDC} and {BACBAD}.(P354) 2)Assume we have a set of activities that wish to use a lecture hall, which can be used by only one activity at a time. Give an optimally schedule to select a maximum-size subset of mutually compatible activities using the greedy algorithm. Each activity has start time and finish time show as follow (P371). activity 1 2 3 4 5 6 7 8

文档评论(0)

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

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

1亿VIP精品文档

相关文档