COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a traveling solution
|
|
|
a solvable solution
|
|
|
a heuristic solution
|
|
|
an intractable solution
|
Detailed explanation-1: -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-2: -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.
Detailed explanation-3: -By using an algorithm, accuracy is increased and potential mistakes are minimized. If you are working in a situation where you absolutely need the correct or best possible answer, your best bet is to use an algorithm. When you are solving problems for your math homework, you don’t want to risk your grade on a guess.
Detailed explanation-4: -What is an algorithmic problem? Simplest and robust definition: An algorithmic problem is simply to compute a function f : ∗ → ∗ over strings of a finite alphabet. Algorithm A solves f if for all input strings w, A outputs f (w).