COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
The problem can be solved algorithmically, but it will require an unreasonably long amount of time.
|
|
|
The problem can be solved algorithmically, but it will require an unreasonably large amount of data storage.
|
|
|
There is no possible algorithm that can be used to solve all instances of the problem.
|
|
|
There are several different possible algorithms that can solve the problem, but there is controversy about which is the most efficient.
|
Detailed explanation-1: -Explanation: An undecidable problem is one for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.
Detailed explanation-2: -Which of the following best explains the consequence of the problem being undecidable? There is no possible algorithm that can be used to solve all instances of the problem.
Detailed explanation-3: -Which of the following best describes the ability of parallel computing solutions to improve efficiency? Any problem that can be solved sequentially can be solved using a parallel solution in approximately half the time.
Detailed explanation-4: -Which of the following best explains how algorithms that run on a computer can be used to solve problems? All problems can be solved with an algorithm that runs in a reasonable amount of time. All problems can be solved with an algorithm, but some algorithms might need a heuristic to run in a reasonable amount of time.