Certaines connaissances prérequises.
Offert par


Ce que vous allez apprendre
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
À propos de ce Spécialisation
Projet d'apprentissage appliqué
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
Certaines connaissances prérequises.
Cette Spécialisation compte 4 cours
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.
Offert par

Université Tsinghua
Free online courses from Tsinghua University
Foire Aux Questions
Quelle est la politique de remboursement ?
Puis-je m'inscrire à un seul cours ?
Une aide financière est-elle possible ?
Puis-je suivre le cours gratuitement ?
Ce cours est-il vraiment accessible en ligne à 100 % ? Dois-je assister à certaines activités en personne ?
Puis-je obtenir des crédits universitaires si je réussis la Spécialisation ?
Puis-je obtenir des crédits universitaires si je réussis la Spécialisation ?
Quelle est la durée nécessaire pour terminer la Spécialisation ?
Do I need to take the courses in a specific order?
D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.