需要一些相關領域經驗。需要一些相關經驗。
提供方


您將學到的內容有
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
需要一些相關領域經驗。需要一些相關經驗。
此專項課程包含 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% 在线学习吗?是否需要现场参加课程?
完成专项课程后我会获得大学学分吗?
完成专项课程后我会获得大学学分吗?
完成专项课程需要多长时间?
Do I need to take the courses in a specific order?
還有其他問題嗎?請訪問 學生幫助中心。