算法与数据结构教学大纲
一、课程基本信息
| 开课单位: |
|
课程代码: |
CS101 |
| 课程名称: |
算法与数据结构 |
英文名称: |
Algorithms and Data Structures |
| 学 分: |
4 |
学 时: |
64 |
| 授课对象: |
|
授课语言: |
中英文 |
| 先修课程: |
|
二、课程简介和教学目的
This course introduces the mathematical modeling of computational problems. It covers basic data structures and algorithms for solving these problems, and performance measurement and analysis techniques for these problems. Topics include:
• Basic algorithm design and analysis: performance measurement, asymptotic notations.
• Elementary data structures: linked lists, stacks, queues.
• Trees: binary search trees, balanced trees/AVL-trees, disjoint sets.
• Hashing: hash functions and tables.
• Graph algorithms: breadth-first search, depth-first search, topological sort, minimum spanning trees, single-source shortest paths/A*.
• Sorting: merge, heap, and quick sort.
• Advanced algorithm design techniques: divide and conquer, dynamic programming, NP Completeness. |
三、教学内容、教学方式和学时安排
Introduction | Week 1 | Algorithm Basics | Week 2 | Elementary Data Structures | Week 3 | Trees | Week 4-6 | Hashing | Week 7 | Graph Algorithms | Week 8-9 | Exam | Week 10 | Sorting | Week 11-12 | Advanced Algorithm Design | Week 13-16 |
|
四、考核方式和成绩评定
五、推荐教材和参考书目
| 书名 |
作者 |
译者 |
出版社 |
出版时间 |
ISBN |
| Introduction to Algorithms (3rd ed.) |
Charles E. Leiserson. Ronald L. Rivest. Clifford Stein
|
|
|
|
|
六、其他说明
七、教师信息
|
