COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
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.
|
|
|
All problems can be solved with an algorithm, but some algorithms might run in an unreasonable amount of time.
|
|
|
Some problems cannot be solved by an algorithm.
|
Detailed explanation-1: -C. All problems can be solved with an algorithm, but some algorithms might run in an unreasonable amount of time.
Detailed explanation-2: -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.
Detailed explanation-3: -An algorithm is a defined set of step-by-step procedures that provides the correct answer to a particular problem. By following the instructions correctly, you are guaranteed to arrive at the right answer. An algorithm is often expressed in the form of a graph, where a square represents each step.
Detailed explanation-4: -Undecidable Problems. These problems are the theoretically impossible to solve-by any algorithm. The halting problem is a decision problem (with a yes or no answer) that is undecidable. A computer cannot tell if it is in an infinite loop or it will at some point stop!
Detailed explanation-5: -Algorithms can be designed for any type of problem, i.e. mathematical, logical, or any complex problems. Example: Depth-first-search, traveling salesman, sorting algorithms, etc. But, after some steps, the algorithm would result in a finite solution before ending.