This course is part of the Data Structures and Algorithms Specialization

3.0
stars
30 ratings

Junhui DENG

14,151 already enrolled

Offered By

Data Structures and Algorithms SpecializationTsinghua University

About this Course

7,739 recent views

By learning this course, you will get a comprehensive  grasp of vector and list and the ability to use them in solving real problems. By the end of this course, you will be able to evaluate data structures and algorithms in terms of asymptotic complexity, analyze storage/time complexity of iterative/recursive algorithms, implement 
vector and list, understand/implement  basic sorting algorithms such as Bubblesort, Insertionsort, and Selectionsort, understand/implement search algorithms such as Binary Search, Fibonacci Search, and Interpolation Search, use vector and list in problem-solving.

通过学习本课程，你将得到向量和列表的全面理解以及使用向量和列表解决实际问题的能力。 在本课程结束时，你将能够根据渐进复杂度评估数据结构和算法，分析迭代/递归算法的空间/时间复杂度，实现向量和列表， 了解/实现基本排序算法（例如冒泡排序、插入排序和选择排序），理解/实现搜索算法（例如二分搜索、斐波那契搜索和插值搜索）， 使用向量和列表解决问题。

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Coursera Labs

Includes hands on learning projects.

Learn more about Coursera Labs

Course 1 of 4 in the

Data Structures and Algorithms Specialization

Intermediate Level

Basic Computer Science and programming skills

Approx. 25 hours to complete

Chinese (Simplified)

What you will learn

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

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Coursera Labs

Includes hands on learning projects.

Learn more about Coursera Labs

Course 1 of 4 in the

Data Structures and Algorithms Specialization

Intermediate Level

Basic Computer Science and programming skills

Approx. 25 hours to complete

Chinese (Simplified)

Instructor

Junhui DENG

Professor

Department of Computer Science and Technology

15,595 Learners

4 Courses

Offered by

Tsinghua University

Free online courses from Tsinghua University

Tsinghua University, founded in 1911, is one of the most prestigious universities in Asia. Tsinghua University consists of 19 schools and 55 departments with faculties in science, engineering, humanities, social sciences, architecture, management, law, medicine, arts and design. As China’s leading institution of advanced learning, Tsinghua is dedicated to excellence in education, research, and social services. Tsinghua has approximately 3,200 faculty members and over 35,000 students, including 3,500 international students from 108 countries. Among its 170,000 alumni are many outstanding scholars, successful entrepreneurs, and distinguished statesmen who have been playing important roles in the development of China.

Syllabus - What you will learn from this course

Week1

Week 1

1 hour to complete

第零章

1 hour to complete

5 readings

Week2

Week 2

2 hours to complete

第一章绪论（上）

2 hours to complete

21 videos (Total 107 min)

21 videos

01-A-1：计算2m01-A-2：绳索计算机3m01-A-3：尺规计算机4m01-A-4：算法4m01-A-5：有穷性10m01-A-6：好算法3m01-B-1：性能测度2m01-B-2：问题规模5m01-B-3：最坏情况4m01-B-4：理想模型3m01-B-5：图灵机5m01-B-6：图灵机实例6m01-B-7：RAM模型6m01-B-8：RAM实例7m01-C-1：主流长远4m01-C-2：大O记号8m01-C-3：高效解6m01-C-4：有效解4m01-C-5：难解2m01-C-6：2-Subset7m01-C-7：增长速度1m

5 practice exercises

有穷性 QUIZ3m好算法 QUIZ2m图灵机 QUIZ3mRAM模型 QUIZ3m大O记号 QUIZ3m

Week3

Week 3

4 hours to complete

第一章绪论（下）

4 hours to complete

26 videos (Total 142 min)

26 videos

01-D-1：算法分析4m01-D-2：级数8m01-D-3：循环6m01-D-4：实例：非极端元素+起泡排序5m01-D-5：正确性的证明5m01-D-6：封底估算-15m01-D-7：封底估算-27m01-E-1：迭代与递归6m01-E-2：减而治之2m01-E-3：递归跟踪6m01-E-4：递推方程3m01-E-5：数组倒置4m01-E-6：分而治之1m01-E-7：二分递归：数组求和8m01-E-8：二分递归：Max29m01-E-9：Max2：二分递归5m01-XC-1：动态规划7m01-XC-2：Fib()：递推方程3m01-XC-3：Fib()：封底估算4m01-XC-4：Fib()：递归跟踪2m01-XC-5：Fib()：迭代5m01-XC-6：最长公共子序列4m01-XC-7：LCS：递归7m01-XC-8：LCS：理解5m01-XC-9：LCS：复杂度6m01-XC-A：LCS：动态规划4m

20 practice exercises

级数 QUIZ5m循环 QUIZ5m正确性的证明 QUIZ3m减而治之 QUIZ3m递归跟踪 QUIZ5m数组倒置 QUIZ3m分而治之 QUIZ5m动态规划 QUIZ3mFib()：递推方程 QUIZ3mFib()：封底估算 QUIZ3mFib()：递归跟踪 QUIZ3mFib()：迭代 QUIZ3m最长公共子序列 QUIZ3mLCS：递归 QUIZ3mLCS：理解 QUIZ3mLCS：动态规划 QUIZ3mΘ记号8m迭代的复杂度4m递归的复杂度5m起泡排序3m

Week4

Week 4

3 hours to complete

第二章向量（上）

3 hours to complete

30 videos (Total 135 min)

30 videos

02-A-1：接口与实现6m02-A-2：向量ADT5m02-A-3：接口操作实例7m02-A-4：构造与析构6m02-A-5：复制3m02-B-1：可扩充向量3m02-B-2：动态空间管理5m02-B-3：递增式扩容3m02-B-4：加倍式扩容4m02-B-5：分摊复杂度3m02-C-1：概述3m02-C-2：循秩访问3m02-C-3：插入3m02-C-4：区间删除2m02-C-5：单元素删除3m02-C-6：查找5m02-C-7：唯一化9m02-C-8：遍历3m02-D1-1：有序性3m02-D1-2：唯一化（低效版）3m02-D1-3：复杂度（低效版）3m02-D1-4：唯一化（高效版）5m02-D1-5：实例与分析（高效版）5m02-D2-1：概述2m02-D2-2：接口2m02-D2-3：语义5m02-D2-4：原理2m02-D2-5：实现3m02-D2-6：实例5m02-D2-7：查找长度7m

24 practice exercises

接口与实现 QUIZ3m接口操作实例 QUIZ3m复制 QUIZ3m可扩充向量 QUIZ3m动态空间管理 QUIZ3m递增式扩容 QUIZ3m加倍式扩容 QUIZ3m分摊复杂度 QUIZ3m循秩访问 QUIZ3m插入 QUIZ3m区间删除 QUIZ3m唯一化 QUIZ3m遍历 QUIZ3m有序性 QUIZ3m唯一化（低效版） QUIZ3m复杂度（低效版） QUIZ3m唯一化（高效版） QUIZ3m实例与分析（高效版） QUIZ3m接口 QUIZ3m语义 QUIZ3m原理 QUIZ3m实现 QUIZ3m实例 QUIZ3m查找长度 QUIZ3m

Week5

Week 5

3 hours to complete

第二章向量（下）

3 hours to complete

25 videos (Total 111 min)

25 videos

02-D3-1：构思5m02-D3-2：实现1m02-D3-3：实例3m02-D3-4：最优性5m02-D4-1：构思4m02-D4-2：版本B3m02-D4-3：语义3m02-D4-4：版本C2m02-D4-5：正确性7m02-D5-1：原理5m02-D5-2：实例4m02-D5-3：性能分析3m02-D5-4：字宽折半2m02-D5-5：综合对比3m02-E-1：构思6m02-E-2：改进3m02-E-3：反例3m02-E-4：再改进6m02-E-5：综合评价4m02-F-1：归并排序：构思5m02-F-2：归并排序：主算法1m02-F-3：二路归并：实例3m02-F-4：二路归并：实现7m02-F-5：二路归并：正确性6m02-F-6：归并排序：性能分析5m

20 practice exercises

构思 QUIZ3m实现 QUIZ3m实例 QUIZ3m版本B QUIZ3m语义 QUIZ3m版本C QUIZ3m正确性 QUIZ3m实例 QUIZ3m性能分析 QUIZ3m构思 QUIZ3m改进 QUIZ3m综合评价 QUIZ3m归并排序：构思 QUIZ4m二路归并：实例 QUIZ3m归并排序：性能分析 QUIZ4m向量的接口与实现15m二分查找12m斐波那契查找3m归并排序3m起泡排序3m

Week6

Week 6

3 hours to complete

第三章列表

3 hours to complete

27 videos (Total 114 min)

27 videos

03-A-1：从静态到动态2m03-A-2：从向量到列表2m03-A-3：从秩到位置3m03-A-4：实现6m03-B-1：循秩访问3m03-B-2：查找3m03-B-3：插入与复制5m03-B-4：删除和析构3m03-B-5：唯一化4m03-C-1：唯一化·构思3m03-C-2：唯一化·实现2m03-C-3：查找4m03-D-1：构思6m03-D-2：实例2m03-D-3：实现3m03-D-4：推敲3m03-D-5：selectMax()4m03-D-6：性能2m03-E-1：经验2m03-E-2：构思2m03-E-3：对比1m03-E-4：实例2m03-E-5：实现4m03-E-6：性能分析6m03-E-7：平均性能6m03-E-8：逆序对8m03-XD：习题辅导：LightHouse6m

16 practice exercises

从秩到位置 QUIZ3m实现 QUIZ3m循秩访问 QUIZ3m插入与复制 QUIZ3m唯一化·构思 QUIZ3m查找 QUIZ3m实例 QUIZ3mselectMax() QUIZ3m性能 QUIZ3m对比 QUIZ3m实例 QUIZ3m平均性能 QUIZ3m逆序对 QUIZ5m列表的接口与实现15m选择排序10m插入排序16m

Week7

Week 7

9 hours to complete

编程作业

9 hours to complete

Reviews

3.0

7 reviews

5 stars
48.38%
4 stars
3.22%
3 stars
3.22%
1 star
45.16%

TOP REVIEWS FROM DATA STRUCTURES AND ALGORITHMS (I)

by CCSep 3, 2020

One of the best courses lecturing on DSA in China.

View all reviews

About the Data Structures and Algorithms Specialization

Data structures play a central role in computer science and are the cornerstones of efficient algorithms. This specialization explores the principles and methods in the design and implementation of various data structures. You will learn the essential skills for algorithm design and performance analysis. Topics covered by this specialization range from fundamental data structures to recent research results.

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

More questions? Visit the Learner Help Center.

Data Structures and Algorithms (I)

About this Course

What you will learn