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: Stanford University
Enseñado por: Tim Roughgarden, Professor
Computer Science
| Información básica | Curso 1 de 4 en Algorithms Specialization |
| Nivel | Intermedio |
| 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 lecturas
- Reading: Welcome and Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- 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 lecturas
- Reading: Week 2 Overview
- 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
- Reading: 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 lectura
- Reading: Week 3 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 lecturas
- Reading: Week 4 Overview
- 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
- Reading: Optional Theory Problems (Batch #2)
- Reading: Info and FAQ for final exam
Calificado: Problem Set #4
Calificado: Programming Assignment #4
Calificado: Final Exam
Preguntas Frecuentes
Cómo funciona
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Creadores
Stanford University
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
An awesome course for learning algorithms in Divide and Conquer Strategy. The lecturer's teaching and lecture content both are world class. The assignments too were worth challenging and confidence boasting. Nice one in case someone needs to grasp at deeper level, the algorithm design and analysis.
Awesomeness!
Very good course. Teaches the basics of algorithms very well. Lectures are great but I mostly studied from textbook (you can find it on amazon for $10).
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.
Well-balanced course in terms of difficulty, theory level and practicality. Final exam could have been more difficult.