Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Add to Favourites
1 1 1 1 1
Price: 8965 EUR 8965 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

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

This course will give you the skills and knowledge ...
Excel in Data Science, one of the hottest fields i ...
In this Professional Certificate program you will ...
Digitalization and artificial intelligence are cha ...

 

©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