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
Graded: Problem Set #1
Graded: Programming Assignment #1
WEEK 2
Week 2
Dijkstra's shortest-path algorithm.
4 videos, 2 readings
Graded: Problem Set #2
Graded: Programming Assignment #2
WEEK 3
Week 3
Heaps; balanced binary search trees.
9 videos, 1 reading
Graded: Problem Set #3
Graded: Programming Assignment #3
WEEK 4
Week 4
Hashing; bloom filters.
9 videos, 3 readings
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
Nice explanation and quality exercises!!
Good introductory coverage and challenging assignments.
Great course for computer scientists. It is easy to understand but it takes too much time to be completed. The video lectures were long and full of too much explanation. And the week 4 programming assignment took very long running time to complete using the algorithm specified in the course but less time using other algorithms.
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.
Best way to revise the core concepts!!