1

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

Correct Answer: true

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Design and Analysis of Algorithms MCQ: Subset sum problem is an example of NP- complete problem. | Extra Education