COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Problem
|
|
a finite set of instructions that accomplish a task.
|
|
|
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
|
|
|
a general description of a task that can (or cannot) be solved with an algorithm.
|
|
|
the time used to complete a task sequentially divided by the time to complete a task in parallel.
|
Explanation:
Detailed explanation-1: -2: 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: -An algorithm solves a general class of problems. An algorithm describes a process that ends with a solution to a problem. The first electronic digital computers, sometimes called mainframe computers, consisted of vacuum tubes, wires, and plugs, and filled entire rooms. Informally, a computing agent is like a recipe.
Detailed explanation-3: -A decidable problem is a decision problem (one that has a yes/no answer) where an algorithm can be written to produce a correct output for all inputs.
There is 1 question to complete.