重庆大学研究生《算法分析与设计》课程教学大纲-重庆大学软件学院
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
重庆大学研究生《算法分析与设计》课程教学大纲
1、课程名称:课程编码:(在MIS系统中的课程编号)
2、学时学分:32学时/2学分
3、适用的专业学位类型或工程硕士领域:软件工程
4、先修课程:高等数学、程序设计、数据结构
5、使用教材及主要参考书目
王晓东.计算机算法设计与分析(第4版).北京:电子工业出版社,2012.
6、课程简介及主要内容(500字)
《算法分析与设计》是软件工程专业的核心课程。该课程将系统地介绍计算机算法分析与设计的相关基础理论和常见方法,特别是软件工程领域中非数值计算有关算法的分析技术和设计方法。课程理论和实践相结合,既强调算法分析也重视设计技巧。
通过本课程的学习,使学生基本掌握算法的基本概念、计算模型和复杂度分析的基本方法,学会分析算法的时间复杂度、空间复杂度和稳定性;掌握几种常用的算法设计策略,包括递归与分治策略、动态规划算法、贪心算法、回溯法、分支限界法、概率算法、图算法和NP完全性理论与近似算法等。课程重点讲述算法的设计思想和分析方法,阐明算法的效率保障、最优最差情况,利用典型案例说明如何应用算法解决实际问题。
7、教学内容、教学方式及学时分配:
8、考核及成绩评定方式:
出勤10%+作业30%+期末考试60%。
Curriculum for Graduate Courses of Chongqing University
1、Course Name: Algorithms Analysis and Design Course Code
2、Credits and hours:32hours/2credits
3、Applied professional degree types or master engineering fields: Software Engineering
4、Prerequisite Courses: Advanced Mathematics, Program Design, Data Structure
5、Textbooks and reference books
Wang Xiaodong, Algorithm Design and Analysis, Publishing House of Electronics Industry, 2012.
6、Course description
The algorithms analysis and design of is the core subject matter of Software Engineering. This course introduces concepts related to the design and analysis of algorithms. Some of the basic techniques used in the analysis and design of non-numerical algorithms which have become central to the study of software engineering in recent years will be examined. Both the theoretical and experimental aspects of the subject will be covered. In particular, the design as well as the analysis of algorithms will form a central focus.
This graduate-level course will cover topics related to algorithms analysis and design. Topics will include NP-complete problems, divide and conquer algorithms, dynamic programming, greedy algorithms, backtracking, branch and bound method, randomized algorithms and graph algorithms. We will not cover any of these topics exhaustively. Rather, the focus will be on algorithmic thinking, performance guarantees and boundary cases, efficient solutions to practical problems and understanding how to analyze algorithms. Advanced topics will cover a selection of modern algorithms, many of which come from real-world applications.
7、Course Content:
8、Grading:
Participation: 10% + Homework: 30% + Final exam: 60%