Acerca de este curso: 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).
Para quién es esta clase: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Creada por: Universidad de Stanford
Enseñado por: Tim Roughgarden, Professor
Computer Science
| Información básica | Curso 1 de 4 en Algorithms Specialization |
| Nivel | Intermediate |
| Compromiso | 4 weeks of study, 4-8 hours/week |
| Idioma | English |
| Cómo aprobar | Aprueba todas las tareas calificadas para completar el curso. |
| Calificaciones del usuario |
Programa
SEMANA 1
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 videos, 3 readings
- Leyendo: Welcome and Week 1 Overview
- Leyendo: Overview, Resources, and Policies
- Leyendo: Lecture slides
- Vídeo: Why Study Algorithms?
- Vídeo: Integer Multiplication
- Vídeo: Karatsuba Multiplication
- Vídeo: About the Course
- Vídeo: Merge Sort: Motivation and Example
- Vídeo: Merge Sort: Pseudocode
- Vídeo: Merge Sort: Analysis
- Vídeo: Guiding Principles for Analysis of Algorithms
- Vídeo: The Gist
- Vídeo: Big-Oh Notation
- Vídeo: Basic Examples
- Vídeo: Big Omega and Theta
- Vídeo: Additional Examples [Review - Optional]
Calificado: Problem Set #1
Calificado: Programming Assignment #1
SEMANA 2
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 videos, 2 readings
- Leyendo: Week 2 Overview
- Vídeo: O(n log n) Algorithm for Counting Inversions I
- Vídeo: O(n log n) Algorithm for Counting Inversions II
- Vídeo: Strassen's Subcubic Matrix Multiplication Algorithm
- Vídeo: O(n log n) Algorithm for Closest Pair I [Advanced - Optional]
- Vídeo: O(n log n) Algorithm for Closest Pair II [Advanced - Optional]
- Vídeo: Motivation
- Vídeo: Formal Statement
- Vídeo: Examples
- Vídeo: Proof I
- Vídeo: Interpretation of the 3 Cases
- Vídeo: Proof II
- Leyendo: Optional Theory Problems (Batch #1)
Calificado: Problem Set #2
Calificado: Programming Assignment #2
SEMANA 3
Week 3
The QuickSort algorithm and its analysis; probability review.
9 videos, 1 reading
- Leyendo: Week 3 Overview
- Vídeo: Quicksort: Overview
- Vídeo: Partitioning Around a Pivot
- Vídeo: Correctness of Quicksort [Review - Optional]
- Vídeo: Choosing a Good Pivot
- Vídeo: Analysis I: A Decomposition Principle
- Vídeo: Analysis II: The Key Insight
- Vídeo: Analysis III: Final Calculations
- Vídeo: Probability Review I
- Vídeo: Probability Review II
Calificado: Problem Set #3
Calificado: Programming Assignment #3
SEMANA 4
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
11 videos, 3 readings
- Leyendo: Week 4 Overview
- Vídeo: Randomized Selection - Algorithm
- Vídeo: Randomized Selection - Analysis
- Vídeo: Deterministic Selection - Algorithm [Advanced - Optional]
- Vídeo: Deterministic Selection - Analysis I [Advanced - Optional]
- Vídeo: Deterministic Selection - Analysis II [Advanced - Optional]
- Vídeo: Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]
- Vídeo: Graphs and Minimum Cuts
- Vídeo: Graph Representations
- Vídeo: Random Contraction Algorithm
- Vídeo: Analysis of Contraction Algorithm
- Vídeo: Counting Minimum Cuts
- Leyendo: Optional Theory Problems (Batch #2)
- Leyendo: Info and FAQ for final exam
Calificado: Problem Set #4
Calificado: Programming Assignment #4
Calificado: Final Exam
Preguntas Frecuentes
Cómo funciona
Trabajo del curso
Cada curso es como un libro de texto interactivo, con videos pregrabados, cuestionarios y proyectos.
Ayuda de tus compañeros
Conéctate con miles de estudiantes y debate ideas y materiales del curso, y obtén ayuda para dominar los conceptos.
Certificados
Obtén reconocimiento oficial por tu trabajo y comparte tu éxito con amigos, compañeros y empleadores.
Creadores
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.
Tarifa
| Comprar curso | |
|---|---|
| Accede a los materiales del curso | Disponible |
| Accede a los materiales con calificación | Disponible |
| Recibe una calificación final | Disponible |
| Obtén un Certificado de curso para compartir | Disponible |
Calificaciones y revisiones
Finished part I, keep going! This is one of the best courses in Coursera.
I loved the problem set 1!
Thanks for the book recommendations also
Extremely great teach!!!
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.
© 2018 Coursera Inc. Todos los derechos reservados.
Now I truly understand how to think of algorithm in terms with Recursion applying Divide and Conquer, and how to use Master method to prove an algorithm's complexity. Even though it is more rigorous then what is required for a software interview or engineering project, having the exposure of theory is better than not having it.