111 captures

05 Feb 2017 - 06 Mar 2026

Apr	MAY	Jun
	24
2021	2022	2023

success

fail

About this capture

COLLECTED BY

Collection: Save Page Now Outlinks

TIMESTAMPS

The Wayback Machine - http://web.archive.org/web/20220524092047/https://www.coursera.org/learn/algorithms-greedy

●Browse ●Top Courses ●Log In ●

Browse Computer Science Algorithms This course is part of the Algorithms Specialization ar 4.8 stars 1,177 ratings

Tim Roughgarden

63,027 already enrolled Offered By Stanford University

●About ●Instructors ●Syllabus ●Reviews ●Enrollment Options ●FAQ Stanford University

Algorithms SpecializationStanford University

●About ●Instructors ●Syllabus ●Reviews ●Enrollment Options ●FAQ

About this Course

34,298 recent views 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). Flexible deadlines Reset deadlines in accordance to your schedule. Shareable Certificate Earn a Certificate upon completion 100% online Start instantly and learn at your own schedule. Course 3 of 4 in the Algorithms Specialization Intermediate Level Approx. 15 hours to complete English Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish

Skills you will gain

●Spanning Tree ●Algorithms ●Dynamic Programming ●Greedy Algorithm Flexible deadlines Reset deadlines in accordance to your schedule. Shareable Certificate Earn a Certificate upon completion 100% online Start instantly and learn at your own schedule. Course 3 of 4 in the Algorithms Specialization Intermediate Level Approx. 15 hours to complete English Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish

Instructor

Instructor rating Placeholder

4.83/5 (58 Ratings) Placeholder

Tim Roughgarden

Professor Computer Science Placeholder

308,563 Learners Placeholder

6Courses

Offered by

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.

Syllabus - What you will learn from this course

Content Rating95%(2,399 ratings) Week 1

Week 1

4 hours to complete

Week 1

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm. 4 hours to complete 16 videos (Total 160 min), 4 readings, 2 quizzes 16 videos Application: Internet Routing10m Application: Sequence Alignment8m Introduction to Greedy Algorithms12m Application: Optimal Caching10m Problem Definition5m A Greedy Algorithm12m Correctness Proof - Part I6m Correctness Proof - Part II4m Handling Ties [Advanced - Optional]7m MST Problem Definition11m Prim's MST Algorithm7m Correctness Proof I15m Correctness Proof II8m Proof of Cut Property [Advanced - Optional]11m Fast Implementation I14m Fast Implementation II9m 4 readings Week 1 Overview10m Overview, Resources, and Policies10m Lecture slides10m Optional Theory Problems (Week 1)10m 2 practice exercises Problem Set #130m Programming Assignment #130m Week 2

Week 2

4 hours to complete

Week 2

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional). 4 hours to complete 16 videos (Total 188 min), 2 readings, 2 quizzes 16 videos Kruskal's MST Algorithm7m Correctness of Kruskal's Algorithm9m Implementing Kruskal's Algorithm via Union-Find I9m Implementing Kruskal's Algorithm via Union-Find II13m MSTs: State-of-the-Art and Open Questions [Advanced - Optional]9m Application to Clustering11m Correctness of Clustering Algorithm9m Lazy Unions [Advanced - Optional]10m Union-by-Rank [Advanced - Optional]12m Analysis of Union-by-Rank [Advanced - Optional]14m Path Compression [Advanced - Optional]14m Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]9m Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]11m The Ackermann Function [Advanced - Optional]16m Path Compression: Tarjan's Analysis I [Advanced - Optional]14m Path Compression: Tarjan's Analysis II [Advanced - Optional]13m 2 readings Week 2 Overview10m Optional Theory Problems (Week 2)10m 2 practice exercises Problem Set #230m Programming Assignment #230m Week 3

Week 3

3 hours to complete

Week 3

Huffman codes; introduction to dynamic programming. 3 hours to complete 11 videos (Total 105 min), 1 reading, 2 quizzes 11 videos Introduction and Motivation9m Problem Definition10m A Greedy Algorithm16m A More Complex Example4m Correctness Proof I10m Correctness Proof II12m Introduction: Weighted Independent Sets in Path Graphs7m WIS in Path Graphs: Optimal Substructure9m WIS in Path Graphs: A Linear-Time Algorithm9m WIS in Path Graphs: A Reconstruction Algorithm6m Principles of Dynamic Programming7m 1 reading Week 3 Overview10m 2 practice exercises Problem Set #330m Programming Assignment #330m Week 4

Week 4

4 hours to complete

Week 4

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees. 4 hours to complete 10 videos (Total 107 min), 3 readings, 3 quizzes 10 videos The Knapsack Problem9m A Dynamic Programming Algorithm9m Example [Review - Optional]12m Optimal Substructure13m A Dynamic Programming Algorithm12m Problem Definition12m Optimal Substructure9m Proof of Optimal Substructure6m A Dynamic Programming Algorithm I9m A Dynamic Programming Algorithm II9m 3 readings Week 4 Overview10m Optional Theory Problems (Week 4)10m Info and FAQ for final exam10m 3 practice exercises Problem Set #430m Programming Assignment #430m Final Exam30m

Reviews

4.8 r 141 reviews 5 stars 86.66% 4 stars 11.30% 3 stars 1.68% 2 stars 0.08% 1 star 0.25%

TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING

r by JPOct 19, 2018 Great learning experience!!! I love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!! r by NTJun 13, 2019 As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended. r by JFJan 13, 2018 I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm. r by YLNov 26, 2018 Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation. View all reviews

About the Algorithms Specialization

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Frequently Asked Questions

When will I have access to the lectures and assignments?"> When will I have access to the lectures and assignments? When will I have access to the lectures and assignments?" class="_msg5sa" style="height:0">

The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

What will I get if I subscribe to this Specialization?"> What will I get if I subscribe to this Specialization? What will I get if I subscribe to this Specialization?" class="_msg5sa" style="height:0">

Is financial aid available?"> Is financial aid available? Is financial aid available?" class="_msg5sa" style="height:0">

More questions? Visit the Learner Help Center. ●Google Data Analyst ●Google Project Management ●Google UX Design ●Google IT Support ●IBM Data Science ●IBM Data Analyst ●IBM Data Analytics with Excel and R ●IBM Cybersecurity Analyst ●IBM Data Engineering ●IBM Full Stack Cloud Developer ●Facebook Social Media Marketing ●Facebook Marketing Analytics ●Salesforce Sales Development Representative ●Salesforce Sales Operations ●Intuit Bookkeeping ●Preparing for Google Cloud Certification: Cloud Architect ●Preparing for Google Cloud Certification: Cloud Data Engineer ●Launch your career ●Prepare for a certification ●Advance your career ●Free Courses ●Learn a Language ●Python ●Java ●Web Design ●SQL ●Cursos Gratis ●Microsoft Excel ●Project Management ●Cybersecurity ●Human Resources ●Data Science Free Courses ●Speaking English ●Content Writing ●Full Stack Web Development ●Artificial Intelligence ●C Programming ●Communication Skills ●Blockchain ●See all courses ●Skills for Data Science Teams ●Data Driven Decision Making ●Software Engineering Skills ●Soft Skills for Engineering Teams ●Management Skills ●Marketing Skills ●Skills for Sales Teams ●Product Manager Skills ●Skills for Finance ●Popular Data Science Courses in the UK ●Beliebte Technologiekurse in Deutschland ●Popular Cybersecurity Certifications ●Popular IT Certifications ●Popular SQL Certifications ●Marketing Manager Career Guide ●Project Manager Career Guide ●Python Programming Skills ●Web Developer Career Guide ●Data Analyst Skills ●Skills for UX Designers ●MasterTrack® Certificates ●Professional Certificates ●University Certificates ●MBA & Business Degrees ●Data Science Degrees ●Computer Science Degrees ●Data Analytics Degrees ●Public Health Degrees ●Social Sciences Degrees ●Management Degrees ●Degrees from Top European Universities ●Master's Degrees ●Bachelor's Degrees ●Degrees with a Performance Pathway ●Bsc Courses ●What is a Bachelor's Degree? ●How Long Does a Master's Degree Take? ●Is an Online MBA Worth It? ●7 Ways to Pay for Graduate School ●See all certificates ●About ●What We Offer ●Leadership ●Careers ●Catalog ●Coursera Plus ●Professional Certificates ●MasterTrack® Certificates ●Degrees ●For Enterprise ●For Government ●For Campus ●Become a Partner ●Coronavirus Response ●Learners ●Partners ●Developers ●Beta Testers ●Translators ●Blog ●Tech Blog ●Teaching Center ●Press ●Investors ●Terms ●Privacy ●Help ●Accessibility ●Contact ●Articles ●Directory ●Affiliates Learn Anywhere