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: Graph Search - Overview
- 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 Shortest-Path Algorithm
- 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: Data Structures: 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: Operations and Applications
- 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
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.
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
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
Ratings and Reviews
we can't understand the writing. please provide the slides to understand better.
A very good and comprehensive course.
Very Nice Course
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
Really taught me a lot. Rather well-explained, except proof of Dijkstra's - Wikipedia explains it better and faster. But good walkthroughs of how algorithms work, because it helps you to visualise and understand properly. Interesting assignments, although it would be useful to have test cases provided because, especially for week 1 and 4, it takes a ridiculously long time to run the program, and it would be wasted time if you turn out to get the wrong answer. Test cases would help you be more sure that your code is right before you attempt to run it on the humongous file. I had to use PyPy to speed the programs up because I use Python which is generally slow. Advice: for week 1 and 4, use C or C++ or some other fast language. Or Cython if you can get it to work.