logo

Question detail

Which description best defines an intractable problem?

Try the question, check the answer, then read the explanation to understand the curriculum point.

At a glance

MCQ

Type

practice

Style

Topic

Classification of algorithms

Exam-style question

Try this first

Which description best defines an intractable problem?.

  1. A.A problem with a polynomial (or less) time solution
  2. B.A problem that has no polynomial (or less) time solution
  3. C.A problem that can only be solved using a compiler
  4. D.A problem that has no algorithmic formulation

Model answer

What a good answer should say

  • A problem that has no polynomial (or less) time solution

Explanation

Why this works

An intractable problem is defined as one that has no polynomial (or less) time solution.

Common mistake

No common mistake is linked to this question yet.

Related flashcards

No flashcards are published for this page yet.

Related practice questions

No questions are published for this page yet.