需要一些相关领域经验。需要一些相关经验。
提供方


您将学到的内容有
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
关于此 专项课程
应用的学习项目
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
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
需要一些相关领域经验。需要一些相关经验。
专项课程的运作方式
加入课程
Coursera 专项课程是帮助您掌握一门技能的一系列课程。若要开始学习,请直接注册专项课程,或预览专项课程并选择您要首先开始学习的课程。当您订阅专项课程的部分课程时,您将自动订阅整个专项课程。您可以只完成一门课程,您可以随时暂停学习或结束订阅。访问您的学生面板,跟踪您的课程注册情况和进度。
实践项目
每个专项课程都包括实践项目。您需要成功完成这个(些)项目才能完成专项课程并获得证书。如果专项课程中包括单独的实践项目课程,则需要在开始之前完成其他所有课程。
获得证书
在结束每门课程并完成实践项目之后,您会获得一个证书,您可以向您的潜在雇主展示该证书并在您的职业社交网络中分享。

此专项课程包含 4 门课程
Data Structures and Algorithms (I)
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
Data Structures and Algorithms (II)
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.
Data Structures and Algorithms (III)
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.
Data Structures and Algorithms (IV)
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.
提供方

清华大学
Free online courses from Tsinghua University
常见问题
退款政策是如何规定的?
我可以只注册一门课程吗?
有助学金吗?
我可以免费学习课程吗?
此课程是 100% 在线学习吗?是否需要现场参加课程?
完成专项课程后我会获得大学学分吗?
完成专项课程需要多长时间?
What background knowledge is necessary?
Do I need to take the courses in a specific order?
还有其他问题吗?请访问 学生帮助中心。