É necessário ter alguma experiência prévia.É necessária alguma experiência prévia.
oferecido por
Programa de cursos integrados Estruturas de dados e algoritmosUniversidade TsinghuaO que você vai aprender
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
Sobre este Programa de cursos integrados
3,145 visualizações recentes
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.
Projeto de Aprendizagem Aplicada
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
Certificados compartilháveis
Tenha o certificado após a conclusão
Cursos 100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Cronograma flexível
Definição e manutenção de prazos flexíveis.
Nível intermediário
Approximately 6 months to complete
Suggested pace of 5 hours/week
Chinês (simplificado)
Legendas: Chinês (simplificado)
Certificados compartilháveis
Tenha o certificado após a conclusão
Cursos 100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Cronograma flexível
Definição e manutenção de prazos flexíveis.
Nível intermediário
É necessário ter alguma experiência prévia.É necessária alguma experiência prévia.
Approximately 6 months to complete
Suggested pace of 5 hours/week
Chinês (simplificado)
Legendas: Chinês (simplificado)
Este Programa de cursos integrados contém 4 cursos
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.
oferecido por
Universidade Tsinghua
Free online courses from Tsinghua University
Perguntas Frequentes – FAQ
Qual é a política de reembolso?
Posso me inscrever em um único curso?
Existe algum auxílio financeiro disponível?
Posso fazer o curso gratuitamente?
Este curso é realmente 100% on-line? Eu preciso assistir alguma aula pessoalmente?
Vou ganhar créditos universitários por concluir a Especialização?
Vou ganhar créditos universitários por concluir a Especialização?
Quanto tempo é necessário para concluir a Especialização?
Do I need to take the courses in a specific order?
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.
