Acerca de este curso: The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
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 2 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
Breadth-first and depth-first search; computing strong components; applications.
9 videos, 4 lecturas
- Leyendo: Week 1 Overview
- Leyendo: Overview, Resources, and Policies
- Leyendo: Lecture slides
- Vídeo: Breadth-First Search (BFS): The Basics
- Vídeo: BFS and Shortest Paths
- Vídeo: BFS and Undirected Connectivity
- Vídeo: Depth-First Search (DFS): The Basics
- Vídeo: Topological Sort
- Vídeo: Computing Strong Components: The Algorithm
- Vídeo: Computing Strong Components: The Analysis
- Vídeo: Structure of the Web [Optional]
- Leyendo: Optional Theory Problems (Week 1)
Calificado: Problem Set #1
Calificado: Programming Assignment #1
SEMANA 2
Week 2
Dijkstra's shortest-path algorithm.
4 videos, 2 lecturas
- Leyendo: Week 2 Overview
- Vídeo: Dijkstra's Algorithm: Examples
- Vídeo: Correctness of Dijkstra's Algorithm
- Vídeo: Dijkstra's Algorithm: Implementation and Running Time
- Leyendo: Optional Theory Problems (Week 2)
Calificado: Problem Set #2
Calificado: Programming Assignment #2
SEMANA 3
Week 3
Heaps; balanced binary search trees.
9 videos, 1 lectura
- Leyendo: Week 3 Overview
- Vídeo: Heaps: Operations and Applications
- Vídeo: Heaps: Implementation Details [Advanced - Optional]
- Vídeo: Balanced Search Trees: Operations and Applications
- Vídeo: Binary Search Tree Basics, Part I
- Vídeo: Binary Search Tree Basics, Part II
- Vídeo: Red-Black Trees
- Vídeo: Rotations [Advanced - Optional]
- Vídeo: Insertion in a Red-Black Tree [Advanced]
Calificado: Problem Set #3
Calificado: Programming Assignment #3
SEMANA 4
Week 4
Hashing; bloom filters.
9 videos, 3 lecturas
- Leyendo: Week 4 Overview
- Vídeo: Hash Tables: Implementation Details, Part I
- Vídeo: Hash Tables: Implementation Details, Part II
- Vídeo: Pathological Data Sets and Universal Hashing Motivation
- Vídeo: Universal Hashing: Definition and Example [Advanced - Optional]
- Vídeo: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- Vídeo: Hash Table Performance with Open Addressing [Advanced - Optional]
- Vídeo: Bloom Filters: The Basics
- Vídeo: Bloom Filters: Heuristic Analysis
- Leyendo: Optional Theory Problems (Week 4)
- 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
Excellent course!
Provided great insight into algorithms
This is an excellent course! It is well explained and I would recommend it to anyone interested in algorithms and data structures covered in this course.
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.
JB
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!