Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

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).

Created by: Stanford University

Language: English

Find Out More
Share
Facebook
Twitter
Pinterest
Reddit
StumbleUpon
LinkedIn
Email

Academy College Online Courses

Back to Top

Log In

Contact Us

Upload An Image

Please select an image to upload
Note: must be in .png, .gif or .jpg format
OR
Provide URL where image can be downloaded
Note: must be in .png, .gif or .jpg format

By clicking this button,
you agree to the terms of use

By clicking "Create Alert" I agree to the Uloop Terms of Use.

Image not available.

Add a Photo

Please select a photo to upload
Note: must be in .png, .gif or .jpg format