IIRF Online > Development > Software Engineering > Algorithms > StanfordOnline: Algorithms: Design and Analysis, Part 2
StanfordOnline: Algorithms: Design and Analysis, Part 2 by Edx
Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience.
Course Highlights
- greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes)
- dynamic programming (knapsack, sequence alignment
- optimal search trees, shortest paths)
- NP-completeness and what it means for the algorithm designer
- analysis of heuristics
- local search
Skills you will learn!
StanfordOnline: Algorithms: Design and Analysis, Part 2
Related Algorithms Courses
Thank You!
Your review has been submitted successfully.