This course is part of the Data Structures and Algorithms Specialization

Junhui DENG

2,914 already enrolled

Offered By

Data Structures and Algorithms SpecializationTsinghua University

About this Course

By learning this course, you will get a comprehensive grasp of Priority Queues and string match techniques, as well as their applications. By the end of this course, you will be able to understand/implement Bucketsort, Counting-sort, and Radixsort, understand the principle/implementation/application of different Priority Queues such as complete binary heap and leftist heap, understand and implement Heapsort, understand and implement typical string matching algorithms such as KMP, BM, and Karp-Rabin, implement and analyze advanced selection/sorting algorithms such as Quicksort, QuickSelect, LinearSelect, and Shellsort.
通过学习本课程，你将全面了解优先级队列和字符串匹配技术及其应用。 在本课程结束时，你将能够了解/实现桶排序，计数排序和基数排序，了解不同优先级队列的原理/实现/应用，例如完全二叉堆和左倾堆，了解并实现堆排序，了解并实现典型的字符串匹配算法（例如KMP，BM和Karp-Rabin），实现并分析高级选择/排序算法，例如快速排序、快速选择、线性选择和希尔排序。

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 4 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 4 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

4 hours to complete

第十章优先级队列

4 hours to complete

39 videos (Total 151 min)

39 videos

10-A1-1：应用需求5m10-A1-2：计算模式2m10-A1-3：功能接口3m10-A2-1：向量2m10-A2-2：有序向量2m10-A2-3：BBST3m10-B1-1：完全二叉树2m10-B1-2：结构性5m10-B1-3：形具神备1m10-B1-4：堆序性2m10-B2-1：上滤5m10-B2-2：实例4m10-B2-3：实现2m10-B2-4：效率3m10-B3-1：算法5m10-B3-2：实例5m10-B3-3：实现3m10-B3-4：效率2m10-B4-1：自上而下的上滤：算法5m10-B4-2：自上而下的上滤：效率3m10-B4-3：自下而上的下滤：算法5m10-B4-4：自下而上的下滤：实例4m10-B4-5：自下而上的下滤：效率4m10-C-1：算法4m10-C-2：就地4m10-C-3：实现1m10-C-4：实例4m10-XA1-1：第一印象1m10-XA1-2：堆之合并4m10-XA1-3：奇中求正3m10-XA1-4：NPL5m10-XA1-5：左倾性2m10-XA1-6：左展右敛4m10-XA2-1：LeftHeap模板类2m10-XA2-2：算法2m10-XA2-3：实现2m10-XA2-4：实例8m10-XA3-1：插入即是合并2m10-XA3-2：删除亦是合并3m

18 practice exercises

应用需求 QUIZ3m功能接口 QUIZ3mBBST QUIZ3m结构性 QUIZ30m堆序性 QUIZ3m上滤 QUIZ3m效率 QUIZ3m算法 QUIZ3m效率 QUIZ3m自上而下的上滤：效率 QUIZ3m自下而上的下滤：效率 QUIZ3m算法 QUIZ3m第一印象 QUIZ3m左倾性 QUIZ3m算法 QUIZ3m优先级队列ADT6m完全二叉堆20m堆排序15m

Week3

Week 3

5 hours to complete

第十一章串（上）

5 hours to complete

29 videos (Total 132 min)

29 videos

11-A-1：定义+特点4m11-A-2：术语4m11-A-3：ADT2m11-B1-1：问题与需求6m11-B1-2：算法测评5m11-B2-1：构思5m11-B2-2：版本一7m11-B2-3：版本二3m11-B2-4：性能5m11-C1-1：重复匹配的前缀4m11-C1-2：不变性3m11-C1-3：记忆力1m11-C1-4：预知力4m11-C2-1：制表备查3m11-C2-2：主算法3m11-C2-3：实例4m11-C3-1：快速移动5m11-C3-2：避免回溯2m11-C3-3：通配哨兵5m11-C4-1：递推4m11-C4-2：算法5m11-C4-3：实现4m11-C5-1：失之粗糙3m11-C5-2：精准估计5m11-C6-1：美中不足5m11-C6-2：以卵击石2m11-C6-3：前车之覆4m11-C6-4：后车之鉴1m11-C6-5：可视对比9m

8 practice exercises

定义+特点 QUIZ30m问题与需求 QUIZ3m性能 QUIZ3m重复匹配的前缀 QUIZ30m制表备查 QUIZ3m通配哨兵 QUIZ30m算法 QUIZ30m精准估计 QUIZ30m

Week4

Week 4

2 hours to complete

第十一章串（下）

2 hours to complete

22 videos (Total 91 min)

22 videos

11-D1-1：不对称性2m11-D1-2：善待教训6m11-D1-3：前轻后重2m11-D1-4：以终为始7m11-D2-1：坏字符5m11-D2-2：特殊情况5m11-D3：画家策略3m11-D4-1：最好情况4m11-D4-2：最坏情况4m11-E1-1：兼顾经验8m11-E1-2：好后缀策略4m11-E1-3：实例体验2m11-E2：构造gs表5m11-E3-1：BM之性能2m11-E3-2：各算法纵览4m11-F1-1：化串为数2m11-F1-2：凡物皆数3m11-F1-3：串亦是数3m11-F2-1：数位溢出2m11-F2-2：散列压缩3m11-F2-3：应对冲突3m11-F2-4：指纹更新2m

3 practice exercises

串匹配及其蛮力算法15mKMP算法20m其他串匹配算法4m

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 (IV)

About this Course

What you will learn