Dynamic Programming
Master of Engineering (MEng) · University · Computer Science
This unit introduces the dynamic programming approach, a powerful technique for solving complex optimization problems. Students will learn memoization and tabulation strategies, and apply them to practical examples such as the Fibonacci sequence and longest common subsequence.
What's included
- Introduction to Dynamic Programming
- Memoization
- Tabulation
- Fibonacci Sequence
- Longest Common Subsequence
- Time and Space Complexity Analysis
- Applications of Dynamic Programming
Keywords
- Dynamic Programming
- Optimization
- Problem Solving
- Algorithms
- Complexity