Informações sobre o 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 quem é direcionado este curso: 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.
Desenvolvido por: Stanford University
Ministrado por: Tim Roughgarden, Professor
Computer Science
| Informações básicas | Curso 2 de 4 no Algorithms Specialization |
| Nível | Intermediário |
| Compromisso | 4 weeks of study, 4-8 hours/week |
| Idioma | English |
| Como ser aprovado | Seja aprovado em todas as tarefas para concluir o curso. |
| Classificação do usuário |
Programa
SEMANA 1
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 videos, 4 leituras
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: 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]
- Reading: Optional Theory Problems (Week 1)
Nota atribuída: Problem Set #1
Nota atribuída: Programming Assignment #1
SEMANA 2
Week 2
Dijkstra's shortest-path algorithm.
4 videos, 2 leituras
- Reading: 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
- Reading: Optional Theory Problems (Week 2)
Nota atribuída: Problem Set #2
Nota atribuída: Programming Assignment #2
SEMANA 3
Week 3
Heaps; balanced binary search trees.
9 videos, 1 leituras
- Reading: 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]
Nota atribuída: Problem Set #3
Nota atribuída: Programming Assignment #3
SEMANA 4
Week 4
Hashing; bloom filters.
9 videos, 3 leituras
- Reading: 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
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Nota atribuída: Problem Set #4
Nota atribuída: Programming Assignment #4
Nota atribuída: Final Exam
Perguntas frequentes
Como 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.
Desenvolvedores
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.
Custo
| Comprar curso | |
|---|---|
| Acesso aos materiais do curso | Disponível |
| Acesso a materiais valendo nota | Disponível |
| Receba uma nota final | Disponível |
| Obtenha um Certificado de Curso compartilhável | Disponível |
Classificações e avaliações
Very nice introduction to Graph Search. Thanks to the instructors!
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2018 Coursera Inc. Todos os direitos reservados.
clearly instruction to learn algorithm and well-designed assignment to practice