Course Summary
This course teaches advanced data structures and algorithms that are commonly used in programming interviews and real-world applications. You will learn algorithms for solving complex problems and techniques for optimizing code performance.Key Learning Points
- Learn advanced data structures and algorithms commonly used in programming interviews
- Understand techniques for optimizing code performance
- Develop problem-solving skills for complex problems
Related Topics for further study
Learning Outcomes
- Develop proficiency in advanced data structures and algorithms
- Learn techniques for optimizing code performance
- Acquire problem-solving skills for complex problems
Prerequisites or good to have knowledge before taking this course
- Basic knowledge of programming concepts
- Familiarity with at least one programming language
Course Difficulty Level
IntermediateCourse Format
- Online self-paced
- Video lectures
- Hands-on coding exercises
Similar Courses
- Algorithms, Part I
- Algorithmic Toolbox
- Data Structures
Related Education Paths
Related Books
Description
By learning this course, you will get a comprehensive grasp of stack, queue, binary tree, graph and BST structures and algorithms, as well as their applications. By the end of this course, you will be able to understand and implement stack, queue and binary tree, use binary trees to solve problems such Huffman encoding, understand and implement the graph structure as well as related algorithms such BFS, DFS and PFS, understand and implement AVL tree.
Knowledge
- 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
Outline
- 第零章
- 写在选课之前
- 考核方式
- 课程教材与讲义
- 关于讨论区
- 微信平台
- 第四章 栈与队列
- 04-A-1：栈
- 04-A-2：实例
- 04-A-3：实现
- 04-C1-1：应用
- 04-C1-2：算法
- 04-C1-3：实现
- 04-C2-1：实例
- 04-C2-2：尝试
- 04-C2-3：构思
- 04-C2-4：实现
- 04-C2-5：反思
- 04-C2-6：拓展
- 04-C3-1：混洗
- 04-C3-2：计数
- 04-C3-3：甄别
- 04-C3-4：算法
- 04-C3-5：括号
- 04-C4-1：把玩
- 04-C4-2：构思
- 04-C4-3：实例
- 04-C4-4：算法框架
- 04-C4-5：算法细节
- 04-C4-6A：实例A
- 04-C4-6B：实例B
- 04-C4-6C：实例C
- 04-C4-6D：实例D
- 04-C5-1：简化
- 04-C5-2：体验
- 04-C5-3：手工
- 04-C5-4：算法
- 04-D-1：接口
- 04-D-2：实例
- 04-D-3：实现
- 实例 QUIZ
- 应用 QUIZ
- 实现 QUIZ
- 混洗 QUIZ
- 计数 QUIZ
- 实例 QUIZ
- 简化 QUIZ
- 算法 QUIZ
- 栈、队列的接口和实现
- 进制转换
- 栈混洗
- 表达式求值
- 第五章 二叉树
- 05-A-1：动机
- 05-A-2：应用
- 05-A-3：有根树
- 05-A-4：有序树
- 05-A-5：路径 + 环路
- 05-A-6：连通 + 无环
- 05-A-7：深度 + 层次
- 05-B-1：表示法
- 05-B-2：父亲
- 05-B-3：孩子
- 05-B-4：父亲 + 孩子
- 05-B-5：长子 + 兄弟
- 05-C-1：二叉树
- 05-C-2：真二叉树
- 05-C-3：描述多叉树
- 05-D-1：BinNode类
- 05-D-2：BinNode接口
- 05-D-3：BinTree类
- 05-D-4：高度更新
- 05-D-5：节点插入
- 05-E1-1：转化策略
- 05-E1-2：遍历规则
- 05-E1-3：递归实现
- 05-E1-4：迭代实现（1）
- 05-E1-5：实例
- 05-E1-6：新思路
- 05-E1-7：新构思
- 05-E1-8：迭代实现（2）
- 05-E1-9：实例
- 05-E2-1：递归
- 05-E2-2：观察
- 05-E2-3：思路
- 05-E2-4：构思
- 05-E2-5：实现
- 05-E2-6：实例
- 05-E2-7：分摊分析
- 05-E4-1：次序
- 05-E4-2：实现
- 05-E4-3：实例
- 05-E5-1：遍历序列
- 05-E5-2：(先序 | 后序) + 中序
- 05-E5-3：(先序 + 后序) x 真
- 动机 QUIZ
- 有序树 QUIZ
- 连通+无环 QUIZ
- 深度+层次 QUIZ
- 父亲 QUIZ
- 父亲+孩子 QUIZ
- 二叉树 QUIZ
- 真二叉树 QUIZ
- 描述多叉树 QUIZ
- 高度更新 QUIZ
- 转化策略 QUIZ
- 迭代实现（1） QUIZ
- 新思路 QUIZ
- 实例 QUIZ
- 观察 QUIZ
- 实例 QUIZ
- 次序 QUIZ
- 实例 QUIZ
- (先序|后序)+中序 QUIZ
- 树与二叉树
- 二叉树的遍历
- 第六章 图
- 06-A-1：邻接+关联
- 06-A-2：无向+有向
- 06-A-3：路径+环路
- 06-B1-1：接口
- 06-B1-2：邻接矩阵+关联矩阵
- 06-B1-3：实例
- 06-B1-4：顶点和边
- 06-B1-5：邻接矩阵
- 06-B1-6：顶点静态操作
- 06-B1-7：边操作
- 06-B1-8：顶点动态操作
- 06-B1-9：综合评价
- 06-C-1：化繁为简
- 06-C-2：策略
- 06-C-3：实现
- 06-C-4：可能情况
- 06-C-5：实例
- 06-C-6：多连通
- 06-C-7：复杂度
- 06-C-8：最短路径
- 06-D-1：算法
- 06-D-2：框架
- 06-D-3：细节
- 06-D-4：无向图
- 06-D-5：有向图
- 06-D-6：多可达域
- 06-D-7：嵌套引理
- 邻接+关联 QUIZ
- 路径+环路 QUIZ
- 实例 QUIZ
- 顶点静态操作 QUIZ
- 顶点动态操作 QUIZ
- 综合评价 QUIZ
- 化繁为简 QUIZ
- 策略 QUIZ
- 实例 QUIZ
- 复杂度 QUIZ
- 算法 QUIZ
- 细节 QUIZ
- 无向图 QUIZ
- 嵌套引理 QUIZ
- 图的基本性质
- 图在计算机中的表示
- 图搜索算法
- 第七章 二叉搜索树
- 07-A-1：纵览
- 07-A-2：循关键码访问
- 07-A-3：有序性
- 07-A-4：单调性
- 07-A-5：接口
- 07-B1-1：概述
- 07-B1-2：查找：算法
- 07-B1-3：查找：理解
- 07-B1-4：查找：实现
- 07-B1-5：查找：语义
- 07-B2-1：插入：算法
- 07-B2-2：插入：实现
- 07-B3-1：删除：框架
- 07-B3-2：删除：单分支
- 07-B3-3：删除：双分支
- 07-B3-4：删除：复杂度
- 07-C-1：极端退化
- 07-C-2：平均高度
- 07-C-3：理想 + 适度
- 07-C-4：歧义 = 等价
- 07-C-5：等价变换
- 07-D1-1：AVL = BBST
- 07-D1-2：平衡因子
- 07-D1-3：适度平衡
- 07-D1-4：接口
- 07-D1-5：失衡+复衡
- 07-D2-1：插入：单旋
- 07-D2-2：插入：双旋
- 07-D2-3：插入：实现
- 07-D3-1：删除：单旋
- 07-D3-2：删除：双旋
- 07-D3-3：删除：实现
- 07-D4-1：”3+4“重构
- 07-D4-2：”3+4“实现
- 07-D4-3：rotateAt()
- 07-D4-4：综合评价
- 有序性 QUIZ
- 单调性 QUIZ
- 查找：算法 QUIZ
- 查找：实现 QUIZ
- 插入：实现 QUIZ
- 删除：复杂度 QUIZ
- 极端退化 QUIZ
- 理想+适度 QUIZ
- 歧义=等价 QUIZ
- 平衡因子 QUIZ
- 适度平衡 QUIZ
- 接口 QUIZ
- 插入：双旋 QUIZ
- 删除：实现 QUIZ
- 综合评价 QUIZ
- 搜索树性质
- 搜索树接口
- 平衡二叉搜索树
- AVL树
- 编程作业
Summary of User Reviews
Data Structures and Algorithms 2 is a highly rated course on Coursera that covers advanced topics in the field. Users have praised the course for its challenging but rewarding content that helps them improve their problem-solving skills.Key Aspect Users Liked About This Course
Challenging but rewarding content that helps improve problem-solving skillsPros from User Reviews
- In-depth coverage of advanced topics
- Great for improving problem-solving abilities
- Challenging but rewarding assignments
- Engaging lectures from knowledgeable instructors
Cons from User Reviews
- Course may be too difficult for beginners
- Assignments can be time-consuming
- Some users have reported technical issues with the platform
- Limited opportunities for interaction with instructors
The Complete Data Structures and Algorithms Course in Python
- 4.5
-
![]()
![]()
![]()
![]()
![]()
Data Structures and Algorithms from Zero to Hero and Crack Top Companies 100+ Interview questions (Python Coding) After finishing this course, you will be able to:...
Object-Oriented Programming
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Learn the principles of programming for building large and extensible systems. Go beyond the basics of programming to understand object-oriented methodology, the approach to modular and reusable software systems....
Introduction to Formal Concept Analysis
- 4.8
-
![]()
![]()
![]()
![]()
![]()
This course is an introduction into formal concept analysis (FCA), a mathematical theory oriented at applications in knowledge representation, knowledge acquisition, data analysis and visualization....
Case Studies in Personalized Medicine
- 4.8
-
![]()
![]()
![]()
![]()
![]()
Learn how advances in biomedicine hold the potential to revolutionize drug development, drug treatments, and disease prevention: where are we now, and what does the future hold?...
