Q. is the class of decision problems that can be solved by non- deterministic polynomial algorithms?

  • (A) np
  • (B) p
  • (C) hard
  • (D) complete
💬 Discuss
✅ Correct Answer: (A) np
Explanation: np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.

💬 Discussion

Related MCQs

Q. It ………. at which an activity can start.

Q. In which testing level the focus is on customer usage?

Q. How many types of flip-flops are?

Q. Random things in a communication system are

Q. The architecture that uses a tighter coupling between the compiler and the processor.

Q. In many classification problems, the target is made up of categorical labels which cannot immediately be processed by any algorithm.

Q. Sample resolution for LPCM bits per sample.

Q. STACK is also called as ______________.

Q. What is the process of managerial control or controlling?

Q. Which of the following is a fundamental operation in relational algebra?

📊 Question Analytics

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