Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Add to Favourites
1 1 1 1 1
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Price: 462 EUR 462 EUR
Contact Stanford University

More details about the program

Description

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

Specific details

Category of Education Computer Sciense and IT

University

Stanford University

External Links

More details about the program

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

Deep Learning for Natural Language ProcessingDeep Learning for Natural Language Processing
This is an advanced course on natural language pro ...
Mathematics for Machine Learning: PCAMathematics for Machine Learning: PCA
This intermediate-level course introduces the math ...
Introduction to the Internet of Things and Embedded SystemsIntroduction to the Internet of Things and Embedded Systems
The explosive growth of the “Internet of Things” i ...
Unlocking Information Security II: An Internet PerspectiveUnlocking Information Security II: An Internet Perspective
Information Security is everywhere: as the world b ...

 

Contact  info@educom.net

About
Terms and Conditions
Privacy Policy
Rankings
Accreditations

 GDPR 

©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net