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

Mobile Computing with App Inventor – CS PrinciplesMobile Computing with App Inventor – CS Principles
Learn to use the open development tool, App Invent ...
Causal Diagrams: Draw Your Assumptions Before Your ConclusionsCausal Diagrams: Draw Your Assumptions Before Your Conclusions
Causal diagrams have revolutionized the way in whi ...
Master of Computer Science in Data ScienceMaster of Computer Science in Data Science
Master of Computer Science in Data Science (MCS-DS ...
Image and Video Processing: From Mars to Hollywood with a Stop at the HospitalImage and Video Processing: From Mars to Hollywood with a Stop at the Hospital
In this course, you will learn the science behind ...

 

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