📊 Design and Analysis of Algorithms
Q. Subset sum problem is an example of NP- complete problem.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
💬 Discuss
✅ Correct Answer: (A) true

Explanation: subset sum problem takes exponential time when we implement a recursive solution. subset sum problem is known to be a part of np complete problems.

Explanation by: Mr. Dubey
subset sum problem takes exponential time when we implement a recursive solution. subset sum problem is known to be a part of np complete problems.

💬 Discussion

Related MCQs

Q. In virtual circuit network each packet contains ___________

Q. Integrity is protection of data from all of the following except ________.

Q. Create a new file “new.txt” that is a concatenation of “file1.txt” and “file2.txt”

Q. The proportion of transaction supporting X in T is called _________.

Q. In above Ex. 196 how many players play exactly 2 of the games?

Q. It measures the quality of processes used to create a quality product. It is a system of management activities, It is a preventive process, It applies

Q. What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

Q. Which of the following service provider provides the highest level of service?

Q. PGP makes use of which cryptographic algorithm?

Q. Common deep learning applications include____

📊 Question Analytics

👁️
465
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
86%
Success Rate