πŸ“Š Design and Analysis of Algorithms
Q. Problems that cannot be solved by any algorithm are called?
  • (A) tractable problems
  • (B) intractable problems
  • (C) undecidable problems
  • (D) decidable problems
πŸ’¬ Discuss
βœ… Correct Answer: (C) undecidable problems

Explanation: problems cannot be solved by any algorithm are called undecidable problems. problems that can be solved in polynomial time are called tractable problems.


Explanation by: Mr. Dubey
problems cannot be solved by any algorithm are called undecidable problems. problems that can be solved in polynomial time are called tractable problems.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
761
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
80%
Success Rate