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

Toward the Future of iOS Development with SwiftToward the Future of iOS Development with Swift
An introduction to the Swift programming language. ...
Build a Modern Computer from First Principles: Nand to Tetris Part II (project-centered course)Build a Modern Computer from First Principles: Nand to Tetris Part II (project-centered course)
In this project-centered course you will build a m ...
Bachelor of Science in Technology and Master of Science in Information TechnologyBachelor of Science in Technology and Master of Science in Information Technology
Digitalization and artificial intelligence are cha ...
BSc Computer ScienceBSc Computer Science
The study content of the degree program Bachelor C ...

 

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