Feb
03

# Category: Software Engineering

# Software Engineering

Feb
03

## Which problems should be solved using dynamic programming?

a) Mergesort

b) Binary search

**c) Longest common subsequence**

d) Quicksort

Feb
03

## Which problems is NOT solved using dynamic programming?

a) 0/1 knapsack problem

b) Matrix chain multiplication problem

c) Edit distance problem

**d) Fractional knapsack problem**