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

Algorithms, Part IIAlgorithms, Part II
This course covers the essential information that ...
Android App DevelopmentAndroid App Development
This Specialization enables learners to successful ...
The Arduino Platform and C ProgrammingThe Arduino Platform and C Programming
The Arduino is an open-source computer hardware/so ...
Game Design and Development CapstoneGame Design and Development Capstone
In the game design and development capstone, you w ...

 

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