About this course: 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).
Who is this class for: 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.
Created by: Stanford University
Taught by: Tim Roughgarden, Professor
Computer Science
| Basic Info | Course 2 of 4 in the Algorithms Specialization |
| Level | Intermediate |
| Commitment | 4 weeks of study, 4-8 hours/week |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 videos, 4 readings
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Video: Breadth-First Search (BFS): The Basics
- Video: BFS and Shortest Paths
- Video: BFS and Undirected Connectivity
- Video: Depth-First Search (DFS): The Basics
- Video: Topological Sort
- Video: Computing Strong Components: The Algorithm
- Video: Computing Strong Components: The Analysis
- Video: Structure of the Web [Optional]
- Reading: Optional Theory Problems (Week 1)
Graded: Problem Set #1
Graded: Programming Assignment #1
WEEK 2
Week 2
Dijkstra's shortest-path algorithm.
4 videos, 2 readings
- Reading: Week 2 Overview
- Video: Dijkstra's Algorithm: Examples
- Video: Correctness of Dijkstra's Algorithm
- Video: Dijkstra's Algorithm: Implementation and Running Time
- Reading: Optional Theory Problems (Week 2)
Graded: Problem Set #2
Graded: Programming Assignment #2
WEEK 3
Week 3
Heaps; balanced binary search trees.
9 videos, 1 reading
- Reading: Week 3 Overview
- Video: Heaps: Operations and Applications
- Video: Heaps: Implementation Details [Advanced - Optional]
- Video: Balanced Search Trees: Operations and Applications
- Video: Binary Search Tree Basics, Part I
- Video: Binary Search Tree Basics, Part II
- Video: Red-Black Trees
- Video: Rotations [Advanced - Optional]
- Video: Insertion in a Red-Black Tree [Advanced]
Graded: Problem Set #3
Graded: Programming Assignment #3
WEEK 4
Week 4
Hashing; bloom filters.
9 videos, 3 readings
- Reading: Week 4 Overview
- Video: Hash Tables: Implementation Details, Part I
- Video: Hash Tables: Implementation Details, Part II
- Video: Pathological Data Sets and Universal Hashing Motivation
- Video: Universal Hashing: Definition and Example [Advanced - Optional]
- Video: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- Video: Hash Table Performance with Open Addressing [Advanced - Optional]
- Video: Bloom Filters: The Basics
- Video: Bloom Filters: Heuristic Analysis
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Graded: Problem Set #4
Graded: Programming Assignment #4
Graded: Final Exam
FAQs
How It Works
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.
Creators
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.
Pricing
| Purchase Course | |
|---|---|
| Access to course materials | Available |
| Access to graded materials | Available |
| Receive a final grade | Available |
| Earn a shareable Course Certificate | Available |
Ratings and Reviews
Best Online Course I've Taken So Far!
clearly instruction to learn algorithm and well-designed assignment to practice
Very nice introduction to Graph Search. Thanks to the instructors!
Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.
© 2018 Coursera Inc. All rights reserved.
JA
Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.