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: 1698 EUR 1698 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

Quantum Computing III: Algorithm and SoftwareQuantum Computing III: Algorithm and Software
This course is part III of the series of Quantum c ...
BS MS Computer ScienceBS MS Computer Science
Students can earn both bachelors and masters degre ...
Unlocking Information Security II: An Internet PerspectiveUnlocking Information Security II: An Internet Perspective
Information Security is everywhere: as the world b ...
Essentials of CybersecurityEssentials of Cybersecurity
Are you interested in working in cybersecurity but ...

 

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