AP Computer Science Principleshardmcq1 pt
Which problem is undecidable?
A.deciding whether any given program will halt
B.sorting a list of numbers
C.searching a sorted list
D.adding two numbers
Explanation
Core Concept
The halting problem has no general algorithm.
Correct Answer
Adeciding whether any given program will halt
More Unit 3: Algorithms and Programming practice questions
- hardA list of student names sorted alphabetically lets you find a name faster with
- mediumA weather model run many times with random inputs is an example of
- mediumA library of drawing procedures is useful because
- mediumA procedure called with different arguments can
- easyIf two algorithms solve a problem, the more efficient one generally
Practice more AP Computer Science Principles questions with full explanations
Practice Unit 3: Algorithms and Programming Questions →