Acerca de este Curso
182,920 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

Aprox. 21 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)
User
Learners taking this Course are
  • Machine Learning Engineers
  • Software Engineers
  • Data Scientists
  • Systems Engineers
  • Data Engineers

Habilidades que obtendrás

AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms
User
Learners taking this Course are
  • Machine Learning Engineers
  • Software Engineers
  • Data Scientists
  • Systems Engineers
  • Data Engineers

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

Aprox. 21 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
3 horas para completar

Week 1

13 videos (Total 130 minutos), 3 readings, 2 quizzes
13 videos
About the Course17m
Merge Sort: Motivation and Example8m
Merge Sort: Pseudocode12m
Merge Sort: Analysis9m
Guiding Principles for Analysis of Algorithms15m
The Gist14m
Big-Oh Notation4m
Basic Examples7m
Big Omega and Theta7m
Additional Examples [Review - Optional]7m
3 lecturas
Welcome and Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
2 ejercicios de práctica
Problem Set #110m
Programming Assignment #12m
Semana
2
3 horas para completar

Week 2

11 videos (Total 170 minutos), 2 readings, 2 quizzes
11 videos
O(n log n) Algorithm for Closest Pair I [Advanced - Optional]31m
O(n log n) Algorithm for Closest Pair II [Advanced - Optional]18m
Motivation7m
Formal Statement10m
Examples13m
Proof I9m
Interpretation of the 3 Cases10m
Proof II16m
2 lecturas
Week 2 Overview10m
Optional Theory Problems (Batch #1)10m
2 ejercicios de práctica
Problem Set #210m
Programming Assignment #22m
Semana
3
3 horas para completar

Week 3

9 videos (Total 156 minutos), 1 reading, 2 quizzes
9 videos
Choosing a Good Pivot22m
Analysis I: A Decomposition Principle21m
Analysis II: The Key Insight11m
Analysis III: Final Calculations8m
Probability Review I25m
Probability Review II17m
1 lectura
Week 3 Overview10m
2 ejercicios de práctica
Problem Set #310m
Programming Assignment #36m
Semana
4
4 horas para completar

Week 4

11 videos (Total 184 minutos), 3 readings, 3 quizzes
11 videos
Deterministic Selection - Analysis I [Advanced - Optional]22m
Deterministic Selection - Analysis II [Advanced - Optional]12m
Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]13m
Graphs and Minimum Cuts15m
Graph Representations14m
Random Contraction Algorithm8m
Analysis of Contraction Algorithm30m
Counting Minimum Cuts7m
3 lecturas
Week 4 Overview10m
Optional Theory Problems (Batch #2)10m
Info and FAQ for final exam10m
3 ejercicios de práctica
Problem Set #410m
Programming Assignment #42m
Final Exam20m
4.8
517 revisionesChevron Right

35%

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

36%

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

24%

consiguió un aumento de sueldo o ascenso

Principales revisiones sobre Divide and Conquer, Sorting and Searching, and Randomized Algorithms

por KSSep 14th 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

por FRMar 16th 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

Instructor

Avatar

Tim Roughgarden

Professor
Computer Science

Acerca de Universidad de Stanford

The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States....

Acerca de Programa especializado Algoritmos

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
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.