- From www.coursera.org
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Course
en
English
16 h
This content is rated 0 out of 5
- Self-paced
- Free Access
- Fee-based Certificate
- 4 Sequences
- Intermediate Level
Course details
Syllabus
- Week 1 - Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm. - Week 2 - Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional). - Week 3 - Week 3
Huffman codes; introduction to dynamic programming. - Week 4 - Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
Prerequisite
None.
Instructors
Tim Roughgarden
Professor
Computer Science
Editor
Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.
Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".
Ranked among the world's top universities in most international rankings, it enjoys great prestige.
Platform
Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California.
Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.
This content is rated 4.5 out of 5
(no review)This content is rated 4.5 out of 5
(no review)Complete this resource to write a review