関連する経験が必要です。
提供:


学習内容
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
よくある質問
返金ポリシーについて教えてください。
1つのコースだけに登録することは可能ですか?
学資援助はありますか?
無料でコースを受講できますか?
このコースは100%オンラインで提供されますか?実際に出席する必要のあるクラスはありますか?
専門講座を修了することで大学の単位は付与されますか?
専門講座を修了することで大学の単位は付与されますか?
専門講座を修了するのにどのくらいの期間かかりますか?
Do I need to take the courses in a specific order?
さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。