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

Customising your models with TensorFlow 2Customising your models with TensorFlow 2
Welcome to this course on Customising your models ...
Quantum Computing II: HardwareQuantum Computing II: Hardware
This course is part 2 of the series of Quantum com ...
Internet of Things: How did we get here?Internet of Things: How did we get here?
It is hard to imagine life without your Smartphone ...
Computational Social ScienceComputational Social Science
For more information please view the Computational ...

 

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