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

Dynamic Programming: Applications In Machine Learning and GenomicsDynamic Programming: Applications In Machine Learning and Genomics
If you look at two genes that serve the same purpo ...
TECH MeD: Transdisciplinary Education for Critical Hacks of Medical DevicesTECH MeD: Transdisciplinary Education for Critical Hacks of Medical Devices
This course seeks to create an informed public, aw ...
MSci Hons Computer Science and Artificial IntelligenceMSci Hons Computer Science and Artificial Intelligence
Artificial Intelligence is arguably one of the mos ...
Algorithmic ToolboxAlgorithmic Toolbox
The course covers basic algorithmic techniques and ...

 

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