Dynamic Programming

Filter Courses within "Dynamic Programming" (Click to filter)
Reset Filters | Advanced Global Search
Comparing Genes, Proteins, and Genomes (Bioinformatics III) (Coursera) Coursera
University of California, San Diego

Comparing Genes, Proteins, and Genomes (Bioinformatics III) (Coursera)

Sci: Biology & Life Sciences Health & Society

Dive into the fascinating world of bioinformatics with 'Comparing Genes, Proteins, and Genomes (Bioinformatics III)'. This comprehensive online course will guide you through comparing genetic sequences, understanding evolutionary changes, and applying advanced algorithmic tools to analyze DNA and protein data. Perfect for students, researchers, and professionals in biology and genetics.

Nov 9th 2026
5-12 Weeks
Genes DNA Genomes
Details
Julia Scientific Programming (Coursera) Coursera
University of Cape Town

Julia Scientific Programming (Coursera)

Statistics & Data Analysis Data Science

Discover the power of Julia in scientific computing with our beginner-friendly online course. Designed specifically for physics, chemistry, astronomy, engineering, data science, bioinformatics and more, this four-module program will introduce you to Julia as a first language. Enhance your skills and unlock new possibilities in scientific programming.

Nov 9th 2026
4 Weeks
IPython Data Analysis Computer Programming
Details
Algorithmic Thinking (Part 2) (Coursera) Coursera
Rice University

Algorithmic Thinking (Part 2) (Coursera)

CS: Theory

Dive deeper into the world of Algorithmic Thinking in Part 2 of this insightful online course offered by Coursera. Designed for those who have already grasped the basics, this advanced class will train you in the mathematical concepts and processes that experienced computer scientists use to solve complex computational problems efficiently. Elevate your problem-solving skills and learn how to build more effective algorithms.

Nov 2nd 2026
4 Weeks
Python Computing Algorithms
Details
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera) Coursera
Stanford University

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)

CS: Software Engineering CS: Theory

Dive into advanced algorithmic concepts with 'Shortest Paths Revisited, NP-Complete Problems and What To Do About Them'. This course unravels the intricacies of shortest path algorithms, delves into the realm of NP-completeness, and equips you with strategies to tackle computationally hard problems effectively.

Nov 2nd 2026
4 Weeks
Algorithms Data Structures Dynamic Programming
Details
Algorithmic Toolbox (Coursera) Coursera
University of California, San Diego,Higher School of Economics - HSE University

Algorithmic Toolbox (Coursera)

CS: Software Engineering CS: Theory

Discover the power of algorithms with 'Algorithmic Toolbox', a comprehensive Coursera course that teaches you how to tackle everyday computational challenges. Learn sorting and searching, divide-and-conquer strategies, greedy algorithms, dynamic programming, and more through engaging video lectures and hands-on practice.

Oct 26th 2026
5-12 Weeks
Algorithms Debugging Data Structures
Details
Advanced Algorithms and Complexity (Coursera) Coursera
University of California, San Diego,Higher School of Economics - HSE University

Advanced Algorithms and Complexity (Coursera)

CS: Software Engineering CS: Theory

Step up your algorithmic skills with our Advanced Algorithms and Complexity course. Dive into intricate problem-solving techniques, including network flows, optimal matchings, and disjoint paths. Perfect for those ready to advance beyond the basics and explore sophisticated applications in various fields like computer vision and scheduling.

Oct 26th 2026
5-12 Weeks
Algorithms Data Structures Machine Learning
Details
Approximation Algorithms Part I (Coursera) Coursera
École normale supérieure

Approximation Algorithms Part I (Coursera)

CS: Software Engineering CS: Programming

Dive into the world of Approximation Algorithms Part I, an insightful online course designed to equip you with the skills needed to tackle NP-hard combinatorial optimization problems effectively. This course explores efficient methods for approximating solutions that balance computational efficiency with performance guarantees.

Oct 26th 2026
5-12 Weeks
Algorithms Computer Science Linear Programming
Details
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera) Coursera
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)

CS: Software Engineering CS: Theory

Dive into the world of efficient problem-solving with our specialized online course on Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming. This course is designed for those who want to enhance their algorithmic skills and learn how to tackle intricate computational challenges effectively.

Oct 26th 2026
4 Weeks
Programming Algorithms Clustering
Details
Algorithmic Design and Techniques (edX) EdX
University of California, San Diego,UC San DiegoX

Algorithmic Design and Techniques (edX)

CS: Theory Sci: Mathematics

Discover the art of designing algorithms and mastering computational problem-solving with our Algorithmic Design and Techniques course on edX. Whether you're a beginner or looking to enhance your expertise, this course will equip you with the essential tools and techniques needed to tackle intricate problems efficiently.

Self Paced
Self-Paced
Algorithms Algorithm Design Dynamic Programming
Details
Page 1 Next ›