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

Regression ModelsRegression Models
Linear models, as their name implies, relates an o ...
Hadoop Platform and Application FrameworkHadoop Platform and Application Framework
This course is for novice programmers or business ...
Internet of Things V2: Setting up and Using Cloud ServicesInternet of Things V2: Setting up and Using Cloud Services
Have you wondered what exactly AWS is and why is i ...
IoT Networking and Fog Layer DevicesIoT Networking and Fog Layer Devices
If you have some experience with IoT end node devi ...

 

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