Informações sobre o curso
156,828 visualizações recentes

100% online

Comece imediatamente e aprenda em seu próprio cronograma.

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.

Nível intermediário

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

Aprox. 28 horas para completar

Sugerido: 4 weeks of study, 5-10 hours/week...

Inglês

Legendas: Inglês

Habilidades que você terá

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List

100% online

Comece imediatamente e aprenda em seu próprio cronograma.

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.

Nível intermediário

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

Aprox. 28 horas para completar

Sugerido: 4 weeks of study, 5-10 hours/week...

Inglês

Legendas: Inglês

Programa - O que você aprenderá com este curso

Semana
1
5 horas para concluir

Basic Data Structures

7 vídeos (Total 60 mín.), 7 leituras, 2 testes
7 videos
Arrays7min
Singly-Linked Lists9min
Doubly-Linked Lists4min
Stacks10min
Queues7min
Trees11min
Tree Traversal10min
7 leituras
Welcome10min
Slides and External References10min
Slides and External References10min
Slides and External References10min
Available Programming Languages10min
FAQ on Programming Assignments10min
Acknowledgements10min
1 exercícios práticos
Basic Data Structures10min
Semana
2
1 horas para concluir

Dynamic Arrays and Amortized Analysis

5 vídeos (Total 31 mín.), 1 leitura, 1 teste
5 videos
Amortized Analysis: Aggregate Method5min
Amortized Analysis: Banker's Method6min
Amortized Analysis: Physicist's Method7min
Amortized Analysis: Summary2min
1 leituras
Slides and External References10min
1 exercícios práticos
Dynamic Arrays and Amortized Analysis8min
Semana
3
6 horas para concluir

Priority Queues and Disjoint Sets

15 vídeos (Total 129 mín.), 6 leituras, 4 testes
15 videos
Naive Implementations of Priority Queues5min
Binary Trees1min
Basic Operations12min
Complete Binary Trees9min
Pseudocode8min
Heap Sort10min
Building a Heap10min
Final Remarks4min
Overview7min
Naive Implementations10min
Trees for Disjoint Sets7min
Union by Rank9min
Path Compression6min
Analysis (Optional)18min
6 leituras
Slides10min
Tree Height Remark10min
Slides and External References10min
Slides and External References10min
Slides and External References10min
Slides and External References10min
3 exercícios práticos
Priority Queues: Quiz12min
Quiz: Disjoint Sets8min
Priority Queues and Disjoint Sets6min
Semana
4
6 horas para concluir

Hash Tables

22 vídeos (Total 170 mín.), 4 leituras, 3 testes
22 videos
Analysing Service Access Logs7min
Direct Addressing7min
List-based Mapping8min
Hash Functions3min
Chaining Scheme6min
Chaining Implementation and Analysis5min
Hash Tables6min
Phone Book Problem4min
Phone Book Problem - Continued6min
Universal Family9min
Hashing Integers9min
Proof: Upper Bound for Chain Length (Optional)8min
Proof: Universal Family for Integers (Optional)11min
Hashing Strings9min
Hashing Strings - Cardinality Fix7min
Search Pattern in Text7min
Rabin-Karp's Algorithm9min
Optimization: Precomputation9min
Optimization: Implementation and Analysis5min
Instant Uploads and Storage Optimization in Dropbox10min
Distributed Hash Tables12min
4 leituras
Slides and External References10min
Slides and External References10min
Slides and External References10min
Slides and External References10min
2 exercícios práticos
Hash Tables and Hash Functions8min
Hashing6min
4.7
353 avaliaçõesChevron Right

36%

comecei uma nova carreira após concluir estes cursos

39%

consegui um benefício significativo de carreira com este curso

13%

recebi um aumento ou promoção

Principais avaliações do estrutura de dadosestrutura de dados

por DGMay 24th 2016

I like this course very much! Rope is the cleverest task I have ever done! Of course, I hope in future I will work on even more difficult problems, but this is pretty good already for me as a student!

por TTApr 6th 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

Instrutores

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

Sobre Universidade da Califórnia, San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

Sobre National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

Sobre o Programa de cursos integrados Estruturas de dados e algoritmos

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Estruturas de dados e algoritmos

Perguntas Frequentes – FAQ

  • Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.

  • Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.