Section outline

  • LESSON OBJECTIVE

    • To teach the strategy of dynamic programming and the examples/ problems those are typically solved by this strategy and the complexity analysis of those problems

    LEARNING OUTCOMES

    • Explain the basic working procedure of dynamic programming
    • Give examples of problems those are typically solved using dynamic programming
    • Explain the complexity of dynamic programming

    TOPICS

    • LIS (Longest Increasing Subsequence)
    • LCS (Longest Common Subsequence)

    CONTENTS