Course Summary
This course covers advanced data structures and algorithms, including graph algorithms, greedy algorithms, dynamic programming, and more. You'll learn how to analyze the efficiency and correctness of algorithms, and apply them to real-world problems.Key Learning Points
- Learn advanced data structures and algorithms
- Apply algorithms to real-world problems
- Improve your analysis skills
Job Positions & Salaries of people who have taken this course might have
- USA: $100,000 - $150,000
- India: INR 8,00,000 - INR 20,00,000
- Spain: €40,000 - €60,000
- USA: $100,000 - $150,000
- India: INR 8,00,000 - INR 20,00,000
- Spain: €40,000 - €60,000
- USA: $120,000 - $180,000
- India: INR 10,00,000 - INR 25,00,000
- Spain: €45,000 - €70,000
- USA: $100,000 - $150,000
- India: INR 8,00,000 - INR 20,00,000
- Spain: €40,000 - €60,000
- USA: $120,000 - $180,000
- India: INR 10,00,000 - INR 25,00,000
- Spain: €45,000 - €70,000
- USA: $110,000 - $170,000
- India: INR 9,00,000 - INR 22,00,000
- Spain: €45,000 - €65,000
Related Topics for further study
Learning Outcomes
- Understand advanced data structures and algorithms
- Analyze algorithm efficiency and correctness
- Apply algorithms to solve real-world problems
Prerequisites or good to have knowledge before taking this course
- Familiarity with basic data structures and algorithms
- Proficiency in at least one programming language
Course Difficulty Level
AdvancedCourse Format
- Online
- Self-paced
- Video lectures
- Assignments
Similar Courses
- Algorithms and Data Structures
- Data Structures and Performance
Related Education Paths
Notable People in This Field
- Robert Sedgewick
- Donald Knuth
Related Books
Description
By learning this course, you will get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications. By the end of this course, you will be able to understand the principle of Hashing, design and implement Hashtables for real problems, understand and implement typical balanced binary search trees such as Splay tree, Red-Black tree as well as B-tree, use BBST to solve various problems such as range query.
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
- 第零章
- 写在选课之前
- 考核方式
- 课程教材与讲义
- 关于讨论区
- 微信平台
- 第八章 高级搜索树（上）
- 08-A1-1：宽松平衡
- 08-A1-2：局部性
- 08-A1-3：自适应调整
- 08-A1-4：逐层伸展
- 08-A1-5：实例
- 08-A1-6：一步一步往上爬
- 08-A1-7：最坏情况
- 08-A2-1：双层伸展
- 08-A2-2：子孙异侧
- 08-A2-3：子孙同侧
- 08-A2-4：点睛之笔
- 08-A2-5：折叠效果
- 08-A2-6：分摊性能
- 08-A2-7：最后一步
- 08-A3-1：功能接口
- 08-A3-2：伸展算法
- 08-A3-3：四种情况
- 08-A3-4：查找算法
- 08-A3-5：插入算法
- 08-A3-6：删除算法
- 08-A3-7：综合评价
- 08-B1-1：640KB
- 08-B1-2：越来越大的数据
- 08-B1-3：越来越小的内存
- 08-B1-4：一秒与一天
- 08-B1-5：分级I/O
- 08-B1-6：1B = 1KB
- 08-B2-1：观察体验
- 08-B2-2：多路平衡
- 08-B2-3：还是I/O
- 08-B2-4：深度统一
- 08-B2-5：阶次含义
- 08-B2-6：紧凑表示
- 08-B2-7：BTNode
- 08-B2-8：BTree
- 08-B3-1：算法过程
- 08-B3-2：操作实例
- 08-B3-3：算法实现
- 08-B3-4：主次成本
- 08-B3-5：最大高度
- 08-B3-6：最小高度
- 局部性 QUIZ
- 逐层伸展 QUIZ
- 双层伸展 QUIZ
- 折叠效果 QUIZ
- 分摊性能 QUIZ
- 四种情况 QUIZ
- 综合评价 QUIZ
- 越来越小的内存 QUIZ
- 一秒与一天 QUIZ
- 观察体验 QUIZ
- 还是I/O QUIZ
- 阶次含义 QUIZ
- 算法过程 QUIZ
- 算法实现 QUIZ
- 最大高度 QUIZ
- 第八章 高级搜索树（下）
- 08-B4-1：算法框架
- 08-B4-2：分裂
- 08-B4-3：再分裂
- 08-B4-4：分裂到根
- 08-B4-5：实例演示
- 08-B5-1：算法框架
- 08-B5-2：旋转
- 08-B5-3：合并
- 08-B5-4：实例演示
- 08-B5-5：道法自然
- 08-XA1-1：观察体验
- 08-XA1-2：持久性
- 08-XA1-3：关联性
- 08-XA1-4：O(1)重构
- 08-XA2-1：定义规则
- 08-XA2-2：实例验证
- 08-XA2-3：提升变换
- 08-XA2-4：末端节点
- 08-XA2-5：红黒树，即是B-树
- 08-XA2-6：平衡性
- 08-XA2-7：接口定义
- 08-XA3-1：以曲为直
- 08-XA3-2：双红缺陷
- 08-XA3-3：算法框架
- 08-XA3-4：RR-1
- 08-XA3-5：RR-2
- 08-XA3-6：归纳回味
- 08-XA4-1：以曲为直
- 08-XA4-2：算法框架
- 08-XA4-3：双黑缺陷
- 08-XA4-4：BB-1
- 08-XA4-5：反观回味
- 08-XA4-6：BB-2R
- 08-XA4-7：BB-2B
- 08-XA4-8：BB-3
- 08-XA4-9：归纳体味
- 算法框架 QUIZ
- 分裂到根 QUIZ
- 算法框架 QUIZ
- 实例演示 QUIZ
- 观察体验 QUIZ
- O(1)重构 QUIZ
- 定义规则 QUIZ
- 红黒树，即是B-树 QUIZ
- 平衡性 QUIZ
- 双红缺陷 QUIZ
- RR-2 QUIZ
- 伸展树
- B-树
- 红黑树
- 平衡搜索树综合
- 第九章 词典
- 09-B-1：从服务到电话
- 09-B-2：循值访问
- 09-B-3：数组
- 09-B-4：原理
- 09-B-5：散列
- 09-B-6：冲突
- 09-C-1：冲突难免
- 09-C-2：何谓优劣
- 09-C-3：整除留余
- 09-C-4：以蝉为师
- 09-C-5：M+A+D
- 09-C-6：平方取中
- 09-C-7：折叠汇总
- 09-C-8：伪随机数
- 09-C-9：多项式
- 09-C-A：Vorldmort
- 09-C-B：DSA@THU
- 09-D1-1：一山二虎
- 09-D1-2：泾渭分明
- 09-D1-3：开放定址
- 09-D1-4：线性试探
- 09-D1-5：懒惰删除
- 09-D2-1：平方试探
- 09-D2-2：一利一弊
- 09-D2-3：至多半载
- 09-D2-4：M + Lemda
- 09-D2-5：双蜓点水
- 09-D2-6：4k + 3
- 09-D2-7：双平方定理
- 09-D2-8：泾渭分明
- 09-E-1：大数据 + 小范围
- 09-E-2：桶排序
- 09-E-3：计数排序
- 从服务到电话 QUIZ
- 原理 QUIZ
- 冲突 QUIZ
- 冲突难免 QUIZ
- 整除留余 QUIZ
- M+A+D QUIZ
- 多项式 QUIZ
- DSA@THU QUIZ
- 泾渭分明 QUIZ
- 线性试探 QUIZ
- 平方试探 QUIZ
- 至多半载 QUIZ
- 计数排序 QUIZ
- 散列函数
- 排解冲突
- 桶/计数排序
- 编程作业
Summary of User Reviews
Discover the ins and outs of data structures and algorithms in this comprehensive course. Students rave about the engaging content and knowledgeable instructors, making it a top pick for anyone looking to expand their knowledge in this area.Key Aspect Users Liked About This Course
The instructors are knowledgeable and engaging, making it easy to stay focused and learn effectively.Pros from User Reviews
- Content is comprehensive and covers a wide range of topics
- Instructors are knowledgeable and engaging
- Course is well-structured and easy to follow
- Assignments and quizzes provide ample opportunity to practice and reinforce concepts
Cons from User Reviews
- Course can be challenging for beginners with limited programming experience
- Course material can be dense and difficult to understand at times
- Assignments can be time-consuming and require a significant amount of effort
- Course is not always interactive, with some lectures being purely informational
Dynamic Programming: Applications In Machine Learning and Genomics
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Learn how dynamic programming and Hidden Markov Models can be used to compare genetic strings and uncover evolution. Dynamic programming and how it applies to basic string comparison algorithms...
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....
Object Oriented Programming in Java
- 4.7
-
![]()
![]()
![]()
![]()
![]()
Welcome to our course on Object Oriented Programming in Java using data visualization. This is an intermediate Java course. This course should take about 6 weeks to complete....
How to Win a Data Science Competition: Learn from Top Kagglers
- 4.7
-
![]()
![]()
![]()
![]()
![]()
At the same time you get to do it in a competitive context against thousands of participants where each one tries to build the most predictive algorithm....
