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

CS50's AP® Computer Science PrinciplesCS50's AP® Computer Science Principles
This is CS50 AP, Harvard University's introduction ...
Executive Data ScienceExecutive Data Science
Assemble the right team, ask the right questions, ...
Introduction to Genomic Data ScienceIntroduction to Genomic Data Science
In the first half of this course, we'll investigat ...
Probabilistic Graphical Models 2: InferenceProbabilistic Graphical Models 2: Inference
Probabilistic graphical models (PGMs) are a rich f ...

 

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