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
- 阅读: Week 1 Overview
- 阅读: Overview, Resources, and Policies
- 阅读: 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]
- 阅读: 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
- 阅读: Week 2 Overview
- Video: Dijkstra's Algorithm: Examples
- Video: Correctness of Dijkstra's Algorithm
- Video: Dijkstra's Algorithm: Implementation and Running Time
- 阅读: 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
- 阅读: 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
- 阅读: 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
- 阅读: Optional Theory Problems (Week 4)
- 阅读: Info and FAQ for final exam
Graded: Problem Set #4
Graded: Programming Assignment #4
Graded: Final Exam
FAQs
How It Works
课程作业
每门课程都像是一本互动的教科书，具有预先录制的视频、测验和项目。
来自同学的帮助
与其他成千上万的学生相联系，对想法进行辩论，讨论课程材料，并寻求帮助来掌握概念。
证书
获得正式认证的作业，并与朋友、同事和雇主分享您的成功。
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
Excellent course!
Provided great insight into algorithms
This is an excellent course! It is well explained and I would recommend it to anyone interested in algorithms and data structures covered in this course.
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.
JB
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!