Acerca de este Curso
157,876 vistas recientes

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

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 (English)

Subtítulos: Inglés (English)

Habilidades que obtendrás

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

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 (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
5 horas para completar

Basic Data Structures

7 videos (Total 60 minutos), 7 lecturas, 2 cuestionarios
7 videos
Singly-Linked Lists9m
Doubly-Linked Lists4m
Stacks10m
Queues7m
Trees11m
Tree Traversal10m
7 lecturas
Welcome10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Acknowledgements10m
1 ejercicio de práctica
Basic Data Structures10m
Semana
2
1 hora para completar

Dynamic Arrays and Amortized Analysis

5 videos (Total 31 minutos), 1 lectura, 1 cuestionario
5 videos
Amortized Analysis: Aggregate Method5m
Amortized Analysis: Banker's Method6m
Amortized Analysis: Physicist's Method7m
Amortized Analysis: Summary2m
1 lectura
Slides and External References10m
1 ejercicio de práctica
Dynamic Arrays and Amortized Analysis8m
Semana
3
6 horas para completar

Priority Queues and Disjoint Sets

15 videos (Total 129 minutos), 6 lecturas, 4 cuestionarios
15 videos
Naive Implementations of Priority Queues5m
Binary Trees1m
Basic Operations12m
Complete Binary Trees9m
Pseudocode8m
Heap Sort10m
Building a Heap10m
Final Remarks4m
Overview7m
Naive Implementations10m
Trees for Disjoint Sets7m
Union by Rank9m
Path Compression6m
Analysis (Optional)18m
6 lecturas
Slides10m
Tree Height Remark10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
3 ejercicios de práctica
Priority Queues: Quiz12m
Quiz: Disjoint Sets8m
Priority Queues and Disjoint Sets6m
Semana
4
6 horas para completar

Hash Tables

22 videos (Total 170 minutos), 4 lecturas, 3 cuestionarios
22 videos
Analysing Service Access Logs7m
Direct Addressing7m
List-based Mapping8m
Hash Functions3m
Chaining Scheme6m
Chaining Implementation and Analysis5m
Hash Tables6m
Phone Book Problem4m
Phone Book Problem - Continued6m
Universal Family9m
Hashing Integers9m
Proof: Upper Bound for Chain Length (Optional)8m
Proof: Universal Family for Integers (Optional)11m
Hashing Strings9m
Hashing Strings - Cardinality Fix7m
Search Pattern in Text7m
Rabin-Karp's Algorithm9m
Optimization: Precomputation9m
Optimization: Implementation and Analysis5m
Instant Uploads and Storage Optimization in Dropbox10m
Distributed Hash Tables12m
4 lecturas
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
2 ejercicios de práctica
Hash Tables and Hash Functions8m
Hashing6m
4.7
368 revisionesChevron Right

35%

comenzó una nueva carrera después de completar estos cursos

39%

consiguió un beneficio tangible en su carrera profesional gracias a este curso

13%

consiguió un aumento de sueldo o ascenso

Principales revisiones sobre estructuras de datos

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.

por ASSep 19th 2019

The best data structures course that I have taken!\n\nThe complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

Instructores

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

Acerca de Universidad de California en 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....

Acerca de 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...

Acerca de Programa especializado Estructuras de datos y 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....
Estructuras de datos y algoritmos

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.