- 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
2007-2008-01《Design and Analysis of Algorithms》SCUEC The Design and Analysis of Algorithms Text Book: Introduction to the Design Analysis of Algorithms - Anany Levitin, Tsinghua University press Reference Books Algorithms Design Techniques and Analysis - M.H. Alsuwaiyel, Publishing House of Electronics Industry Analysis of Algorithms—An Active Learning Approach - Jeffrey J. McConnell, Higher Education Press Introduction to Algorithms (Second Edition) - Thomas H. Cormen etc., Higher Education Press The MIT Press Others, search on the website with keyword “Design and Analysis of algorithms”, you will find more... Teaching Plan Lecturing Part Learning Hour: 36 From week 10 to week 18 Experiment Part Learning Hour: 12 From week 13 to week 18 Class time: (waiting for notification) Grading Policy Total 100 Attendance and Assignments: 15% Experiments: 15% Final Exam: 70% Bonus is possible for those positive and active students Caution Please finish your assignments and projects independently. If you really meet problems, you can seek help from me or other students, but remember not copying. Please sign attendance when needed, but remember not signing for others. Power off (or ring off) your mobile phone Feedback (positive or negative) is encouraged and welcome, and IMPORTANT. Thinking, before, in and after class is encouraged and IMPORTANT. Course Prerequisite Data Structure Discrete Mathematics C, Java or other programming languages A little mathematics (sum, recurrence relations etc, we will mention them in next class) Course Contents Introduction Algorithm, rates of growth, mathematical background, count operations, what to analysis Brute force Sequential search, Selection sort, Bubble sort, Closest-pair problem, String match Divide and Conquer techniques Binary search, Merge sort, quicksort, Strassen’s matrix multiplication, finding median and the kth largest element Dynamic Programming The longest common subsequence problem, the all
文档评论(0)