# 数据结构与算法设计(上)经典课程

Data Structures and Algorithm Design Part I

## 8 周

• 中文
• 10977

### 课程概况

Data structures play a central role in computer science and are the cornerstones of efficient algorithms. Knowledge in this area has been at the kernel of related curriculums. This course aims at exploring the principles and methods in the design and implementation of various data structures and providing students with main tools and skills for algorithm design and performance analysis. Topics covered by this course range from fundamental data structures to recent research results. “Data Structures and Algorithm Design Part I” is an introductory course focusing on basic data structures, including vectors, lists, stacks, queues, binary trees, and graphs. They are important in programming practice, as well as fundamental to our advanced course: “Part II.”

### 你将学到什么

Algorithms used to solve complex problems

Principles and methods in the design and implementation of various data structures

Skills for algorithm design and performance analysis

Background on fundamental data structures and recent results

### 课程大纲

OJ系统说明

PA讨论
PA晋级申请

（a）计算
（b）计算模型
（c）大O记号
（d）算法分析
（e）迭代与递归
（xc）动态规划

（a）接口与实现
（b）可扩充向量
（c）无序向量
（d1）有序向量：唯一化
（d2）有序向量：二分查找
（d3）有序向量：Fibonacci查找
（d4）有序向量：二分查找（改进）
（d5）有序向量：插值查找
（e）起泡排序
（f）归并排序

（a）接口与实现
（b）无序列表
（c）有序列表
（d）选择排序
（e）插入排序
（xd）习题辅导：LightHouse

（a）栈接口与实现
（c1）栈应用：进制转换
（c2）栈应用：括号匹配
（c3）栈应用：栈混洗
（c4）栈应用：中缀表达式求值
（c5）栈应用：逆波兰表达式
（d）队列接口与实现

（a）树
（b）树的表示
（c）二叉树
（d）二叉树实现
（e1）先序遍历
（e2）中序遍历
（e4）层次遍历
（e5）重构

（a）概述
（b1）邻接矩阵
（c）广度优先搜索
（d）深度优先搜索

##### 声明：MOOC中国发布之课程均源自下列机构，版权均归他们所有。本站仅作报道收录并尊重其著作权益，感谢他们对MOOC事业做出的贡献！(排名不分先后)
• Coursera
• edX
• OpenLearning
• FutureLearn
• iversity
• Udacity
• NovoEd
• Canvas
• Open2Study
• ewant
• FUN
• IOC-Athlete-MOOC
• World-Science-U
• CourseSites
• opencourseworld
• ShareCourse
• gacco