Q1: 2. Which of the following is NOT a characteristic of dynamic programming?

• A) A. Overlapping subproblems
• B) B. Optimal substructure
• C) C. Greedy choice property
• D) D. Memoization

Q2: 3. In dynamic programming, what is the purpose of memoization?

• A) A. To prevent infinite loops
• B) B. To store computed results to avoid redundant calculations
• C) C. To simplify the code structure
• D) D. To prioritize subproblems based on a heuristic

Q3: 4. Which dynamic programming technique focuses on solving larger subproblems by first solving smaller subproblems?

• A) A. Top-down approach
• B) B. Bottom-up approach
• C) C. Divide and conquer
• D) D. Greedy approach

Q4: 5. What is the time complexity of dynamic programming using memoization?

• A) A. O(n^2)
• B) B. O(2^n)
• C) C. O(n log n)
• D) D. O(n)

Q5: 8. Which dynamic programming approach typically requires more space?

• A) A. Top-down approach
• B) B. Bottom-up approach
• C) C. Greedy approach
• D) D. Divide and conquer