• CSE214 & CSE215 (Theory & LAB)

    "For me, great algorithms are the poetry of computation"

                                                                                                                                                                        --Francis Sullivan

    • Online Class Link (PC-A) Google Meet™ for Moodle
      Restricted Not available unless: You belong to PC-A
    • Online Class Link (PC-B) Google Meet™ for Moodle
      Restricted Not available unless: You belong to PC-B
  • Week 6: Dynamic programming (part 1)

    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

    • Basic understanding of dynamic programming
    • Fibonacci series
    • 0/1 Knapsack problem
    • DP coin change problem

    CONTENTS

Week 5: Greedy AlgorithmWeek 7: Dynamic Programming (part 2)