《算法分析与设计》课程教学大纲（The teaching of Outline analysis and design of algorithm curriculum）.docVIP

下载本文档

5
0
约3.73千字
约 6页
2017-08-21 发布于河南
举报
版权申诉

《算法分析与设计》课程教学大纲（The teaching of Outline analysis and design of algorithm curriculum）.doc

1、本文档共6页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

《算法分析与设计》课程教学大纲（The teaching of Outline analysis and design of algorithm curriculum）

《算法分析与设计》课程教学大纲（The teaching of Outline analysis and design of algorithm curriculum） Detailed implementation of the basic idea of dynamic programming algorithm and time complexity analysis. [teaching method] combination of classroom instruction and self-study. [class] 9 hours. The fourth chapter greedy algorithm [Objective] to master the greedy algorithm design algorithm. [content] the basic elements of greedy algorithms, basic ideas and algorithm examples. [key and difficult] the specific implementation of greedy algorithm and time complexity analysis. [teaching method] combination of classroom instruction and self-study. [class] 6 hours. The fifth chapter is backtracking [Objective] to master the basic mode of backtracking algorithm. [content] backtracking algorithm framework and algorithm examples. [key and difficult] Application of algorithm framework. [teaching method] combination of classroom instruction and self-study. [class] 11 hours. The sixth chapter, branch and bound method [Objective] to understand the branch and bound method [content] the basic idea and algorithm example of branch and bound method. [key and difficult] Application of algorithm framework. [teaching method] combination of classroom instruction and self-study. [class] 3 hours. Three. Outline instructions 1. examination methods Closed examination 2. practical link In order to coordinate the theory teaching, assign 5~10 big homework questions. 3. examination results Final exam: 70 (80)%, usually 30 (20)% 4. using textbooks and main reference books Textbook: Wang Xiaodong, computer algorithm design and analysis, publishing house of electronics industry, 2002 Reference material: [1] Yan Yumin data structure (C Language Edition), Tsinghua University press, 2002 Zheng Li [2] C + + programming language (Second Edition) Tsinghua University press, 2001 [3] Tan Haoqiang, C programming (Second Edition), Tsinghua University press, 1999 Emei campus of Southwest Jiao Tong University Course name Chinese