Question

Which of the following problems is typically solved using Dynamic Programming, where items cannot be broken into smaller pieces?

A Fractional Knapsack Problem
B Activity Selection Problem
C 0/1 Knapsack Problem
D Minimum Spanning Tree
E Shortest Path in a DAG
Practice Next

Hey! Ask a query