About this course: The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
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 3 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
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
16 videos, 4 readings
Graded: Problem Set #1
Graded: Programming Assignment #1
WEEK 2
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
16 videos, 2 readings
Graded: Problem Set #2
Graded: Programming Assignment #2
WEEK 3
Week 3
Huffman codes; introduction to dynamic programming.
11 videos, 1 reading
Graded: Problem Set #3
Graded: Programming Assignment #3
WEEK 4
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
10 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
The most challenging course after first and second, really difficult
Need solution of quiz and final
Outstanding course. Prof. Roughgarden is enthusiastic. The lectures, programming problems, and readings build a solid understanding.
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.
EY
Stellar explanations as usual