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: Stanford University
Enseñado por: Tim Roughgarden, Professor
Computer Science
| Información básica | Curso 2 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
Breadth-first and depth-first search; computing strong components; applications.
9 videos, 4 lecturas
- Leitura: Week 1 Overview
- Leitura: Overview, Resources, and Policies
- Leitura: 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]
- Leitura: 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
- Leitura: 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
- Leitura: 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
- Leitura: 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
- Leitura: 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
- Leitura: Optional Theory Problems (Week 4)
- Leitura: Info and FAQ for final exam
Calificado: Problem Set #4
Calificado: Programming Assignment #4
Calificado: Final Exam
Preguntas Frecuentes
Cómo funciona
Trabalho
Cada curso é como um livro didático interativo, com vídeos pré-gravados, testes e projetos.
Ajuda dos seus colegas
Conecte-se com milhares de outros aprendizes, debata ideias, discuta sobre os materiais do curso e obtenha ajuda para dominar conceitos.
Certificados
Obtenha reconhecimento oficial pelo seu trabalho e compartilhe seu sucesso com amigos, colegas e empregadores.
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
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.
