À propos de ce cours : 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).
Les destinataires de ce cours : 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.
Créé par : Université de Stanford
Enseigné par : Tim Roughgarden, Professor
Computer Science
| Informations de base | Cours 2 de 4 dans Algorithms Specialization |
| Niveau | Intermediate |
| Engagement | 4 weeks of study, 4-8 hours/week |
| Langue | English |
| Comment réussir | Réussissez tous les devoirs notés pour terminer le cours. |
| Notes des utilisateurs |
Programme de cours
SEMAINE 1
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 vidéos, 4 lectures
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Vidéo: Graph Search - Overview
- Vidéo: Breadth-First Search (BFS): The Basics
- Vidéo: BFS and Shortest Paths
- Vidéo: BFS and Undirected Connectivity
- Vidéo: Depth-First Search (DFS): The Basics
- Vidéo: Topological Sort
- Vidéo: Computing Strong Components: The Algorithm
- Vidéo: Computing Strong Components: The Analysis
- Vidéo: Structure of the Web [Optional]
- Reading: Optional Theory Problems (Week 1)
Noté: Problem Set #1
Noté: Programming Assignment #1
SEMAINE 2
Week 2
Dijkstra's shortest-path algorithm.
4 vidéos, 2 lectures
- Reading: Week 2 Overview
- Vidéo: Dijkstra's Shortest-Path Algorithm
- Vidéo: Dijkstra's Algorithm: Examples
- Vidéo: Correctness of Dijkstra's Algorithm
- Vidéo: Dijkstra's Algorithm: Implementation and Running Time
- Reading: Optional Theory Problems (Week 2)
Noté: Problem Set #2
Noté: Programming Assignment #2
SEMAINE 3
Week 3
Heaps; balanced binary search trees.
9 vidéos, 1 lecture
- Reading: Week 3 Overview
- Vidéo: Data Structures: Overview
- Vidéo: Heaps: Operations and Applications
- Vidéo: Heaps: Implementation Details [Advanced - Optional]
- Vidéo: Balanced Search Trees: Operations and Applications
- Vidéo: Binary Search Tree Basics, Part I
- Vidéo: Binary Search Tree Basics, Part II
- Vidéo: Red-Black Trees
- Vidéo: Rotations [Advanced - Optional]
- Vidéo: Insertion in a Red-Black Tree [Advanced]
Noté: Problem Set #3
Noté: Programming Assignment #3
SEMAINE 4
Week 4
Hashing; bloom filters.
9 vidéos, 3 lectures
- Reading: Week 4 Overview
- Vidéo: Hash Tables: Operations and Applications
- Vidéo: Hash Tables: Implementation Details, Part I
- Vidéo: Hash Tables: Implementation Details, Part II
- Vidéo: Pathological Data Sets and Universal Hashing Motivation
- Vidéo: Universal Hashing: Definition and Example [Advanced - Optional]
- Vidéo: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- Vidéo: Hash Table Performance with Open Addressing [Advanced - Optional]
- Vidéo: Bloom Filters: The Basics
- Vidéo: Bloom Filters: Heuristic Analysis
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Noté: Problem Set #4
Noté: Programming Assignment #4
Noté: Final Exam
FAQ
Comment cela fonctionne
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.
Créateurs
Université 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.
Tarification
| Acheter le cours | |
|---|---|
| Accéder au contenu du cours | Disponible |
| Accéder au contenu noté | Disponible |
| Recevoir une Note Finale | Disponible |
| Obtenir un Certificat de Cours partageable | Disponible |
Notation et examens
Amazing course! Tim Roughgarden is an exceptional teacher! I'm really enjoying reviewing this algorithms and data structures topics
I think this was the best course of the specialization. Stacks, queues, heaps, search trees, hash tables etc. are data structures everyone should know; when to use and their raison d'etre as he says.. and to that end this course is very effective. This course also has a very nice flow. And of course, Prof. Tim Roughgarden is simply awesome. I wish I got a chance to be in his offline classroom.
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
Coursera propose un accès universel à la meilleure formation au monde,
en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.
© 2018 Coursera Inc. Tous droits réservés.
This course is very good! The professor explain the algorithms in detail , and the programming assignment is challenging！Highly recommend!