COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.
|
|
|
provides a “good enough” solution to a problem when an actual solution is impractical or impossible
|
|
|
a finite set of instructions that accomplish a task
|
|
|
a model in which programs are run by multiple devices
|
Detailed explanation-1: -Algorithms with a polynomial efficiency or lower(constant, linear, square, cube, etc) are said to run in a reasonable amount of time. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
Detailed explanation-2: -reasonable time: A run time for an algorithm that doesn’t increase faster than a polynomial function of the input size (like 10 n 10n 10n, n 2 n^2 n2, etc). An unreasonable run time would increase superpolynomially (like 2 n 2^n 2n2, start superscript, n, end superscript or. n! n!
Detailed explanation-3: -An algorithm that does not execute in a reasonable time will break the computer it is running on.
Detailed explanation-4: -Reasonable algorithms grow at a polynomial rate or slower. Unreasonable algorithms grow exponentially. The time to solve an unreasonable algorithm grows very quickly even for relatively small problem sizes.
Detailed explanation-5: -Exponential curves grow extremely quickly. You simply can’t build a computer fast enough even for relatively small raffle sizes. Polynomial is bad but exponential gets unreasonably large extremely quickly.