Explore topic-wise MCQs in Subset Sum Problem Multiple Choice.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Subset Sum Problem Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.

1.

Subset sum problem is an example of NP-complete problem.

A. true
B. false
Answer» B. false
Discussion
2.

What is the worst case time complexity of dynamic programming solution of the subset sum problem(sum=given subset sum)?

A. O(n)
B. O(sum)
C. O(n<sup>2</sup>)
D. O(sum*n)
Answer» E.
Discussion