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

Master of Computer and Information SciencesMaster of Computer and Information Sciences
Research an area of your interest, advance your un ...
Introduction to Programming with MATLABIntroduction to Programming with MATLAB
This course teaches computer programming to those ...
Bachelor in Computer ScienceBachelor in Computer Science
Computer Science is a young science at the interfa ...
BSc Hons Data Science and Knowledge EngineeringBSc Hons Data Science and Knowledge Engineering
If you choose the Research track, you will get the ...

 

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