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

Understanding and Visualizing Data with PythonUnderstanding and Visualizing Data with Python
In this course, learners will be introduced to the ...
Coding for Designers, Managers, & Entrepreneurs IIICoding for Designers, Managers, & Entrepreneurs III
Do you want to experience what it is to go from id ...
Software Architecture & DesignSoftware Architecture & Design
Software Architecture and Design teaches the princ ...
Python for EverybodyPython for Everybody
This Specialization builds on the success of the P ...

 

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