The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Este curso forma parte de Programa Especializado - Algoritmos
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
ofrecido por
Acerca de este Curso
4.8
2,523 calificaciones
Habilidades que obtendrƔs
AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms
Programa - QuƩ aprenderƔs en este curso
Semana
13 horas para completar
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 videos (Total 130 minutos), 3 readings, 2 quizzes
13 videos
Integer Multiplication8m
Karatsuba Multiplication12m
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
23 horas para completar
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 videos (Total 170 minutos), 2 readings, 2 quizzes
11 videos
O(n log n) Algorithm for Counting Inversions II16m
Strassen's Subcubic Matrix Multiplication Algorithm22m
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
33 horas para completar
Week 3
The QuickSort algorithm and its analysis; probability review.
9 videos (Total 156 minutos), 1 reading, 2 quizzes
9 videos
Partitioning Around a Pivot24m
Correctness of Quicksort [Review - Optional]10m
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
44 horas para completar
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
11 videos (Total 184 minutos), 3 readings, 3 quizzes
11 videos
Randomized Selection - Analysis20m
Deterministic Selection - Algorithm [Advanced - Optional]16m
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
33%
comenzĆ³ una nueva carrera despuĆ©s de completar estos cursos
36%
consiguiĆ³ un beneficio tangible en su carrera profesional gracias a este curso
29%
consiguiĆ³ un aumento de sueldo o ascenso
Principales revisiones
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.
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
Tim Roughgarden
ProfessorComputer 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 del 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.
Preguntas Frecuentes
ĀæCuĆ”ndo podrĆ© acceder a las lecciones y tareas?
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.
ĀæQuĆ© recibirĆ© si me suscribo a este Programa especializado?
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.
ĀæCuĆ”l es la polĆtica de reembolsos?
ĀæHay ayuda econĆ³mica disponible?
ĀæTienes mĆ”s preguntas? Visita el Centro de Ayuda al Alumno.
Coursera brinda acceso universal a la mejor educaciĆ³n del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en lĆnea.
Ā© 2019 Coursera Inc. Todos los derechos reservados.
