À propos de ce cours
4.8
884 ratings
105 reviews
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)....
Stacks

Cours 2 sur 4 dans la

Globe

Cours en ligne à 100 %

Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Calendar

Dates limites flexibles

Réinitialisez les dates limites selon votre disponibilité.
Intermediate Level

Niveau intermédiaire

Clock

Recommandé : 4 weeks of study, 4-8 hours/week

Approx. 17 heures pour terminer
Comment Dots

English

Sous-titres : English

Compétences que vous acquerrez

GraphsData StructureAlgorithmsHash Table
Stacks

Cours 2 sur 4 dans la

Globe

Cours en ligne à 100 %

Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Calendar

Dates limites flexibles

Réinitialisez les dates limites selon votre disponibilité.
Intermediate Level

Niveau intermédiaire

Clock

Recommandé : 4 weeks of study, 4-8 hours/week

Approx. 17 heures pour terminer
Comment Dots

English

Sous-titres : English

Programme du cours : ce que vous apprendrez dans ce cours

1

Section
Clock
4 heures pour terminer

Week 1

Breadth-first and depth-first search; computing strong components; applications....
Reading
9 vidéos (Total 162 min), 4 lectures, 2 quiz
Video9 vidéos
Breadth-First Search (BFS): The Basics14 min
BFS and Shortest Paths7 min
BFS and Undirected Connectivity13 min
Depth-First Search (DFS): The Basics7 min
Topological Sort21 min
Computing Strong Components: The Algorithm29 min
Computing Strong Components: The Analysis26 min
Structure of the Web [Optional]18 min
Reading4 lectures
Week 1 Overview10 min
Overview, Resources, and Policies10 min
Lecture slides10 min
Optional Theory Problems (Week 1)10 min
Quiz2 exercices pour s'entraîner
Problem Set #110 min
Programming Assignment #12 min

2

Section
Clock
2 heures pour terminer

Week 2

Dijkstra's shortest-path algorithm....
Reading
4 vidéos (Total 79 min), 2 lectures, 2 quiz
Video4 vidéos
Dijkstra's Algorithm: Examples12 min
Correctness of Dijkstra's Algorithm19 min
Dijkstra's Algorithm: Implementation and Running Time26 min
Reading2 lectures
Week 2 Overview10 min
Optional Theory Problems (Week 2)10 min
Quiz2 exercices pour s'entraîner
Problem Set #210 min
Programming Assignment #22 min

3

Section
Clock
3 heures pour terminer

Week 3

Heaps; balanced binary search trees....
Reading
9 vidéos (Total 142 min), 1 lecture, 2 quiz
Video9 vidéos
Heaps: Operations and Applications18 min
Heaps: Implementation Details [Advanced - Optional]20 min
Balanced Search Trees: Operations and Applications10 min
Binary Search Tree Basics, Part I13 min
Binary Search Tree Basics, Part II30 min
Red-Black Trees21 min
Rotations [Advanced - Optional]7 min
Insertion in a Red-Black Tree [Advanced]14 min
Reading1 lecture
Week 3 Overview10 min
Quiz2 exercices pour s'entraîner
Problem Set #310 min
Programming Assignment #32 min

4

Section
Clock
4 heures pour terminer

Week 4

Hashing; bloom filters....
Reading
9 vidéos (Total 171 min), 3 lectures, 3 quiz
Video9 vidéos
Hash Tables: Implementation Details, Part I18 min
Hash Tables: Implementation Details, Part II22 min
Pathological Data Sets and Universal Hashing Motivation21 min
Universal Hashing: Definition and Example [Advanced - Optional]25 min
Universal Hashing: Analysis of Chaining [Advanced - Optional]18 min
Hash Table Performance with Open Addressing [Advanced - Optional]15 min
Bloom Filters: The Basics15 min
Bloom Filters: Heuristic Analysis13 min
Reading3 lectures
Week 4 Overview10 min
Optional Theory Problems (Week 4)10 min
Info and FAQ for final exam10 min
Quiz3 exercices pour s'entraîner
Problem Set #410 min
Programming Assignment #42 min
Final Exam20 min
4.8
Direction Signs

33%

a commencé une nouvelle carrière après avoir terminé ces cours
Briefcase

83%

a bénéficié d'un avantage concret dans sa carrière grâce à ce cours

Meilleurs avis

par HCNov 12th 2017

Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.

par HNJul 30th 2017

One of the greatest courses on this website. However, I believe this course will be more approachable if it contains more practical guide such as sample solution for algorithms.

Enseignant

Tim Roughgarden

Professor
Computer Science

À propos de 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....

À propos de la Spécialisation Algorithms

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
Algorithms

Foire Aux Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.