COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Algorithm
|
|
|
Sequential Computing
|
|
|
Unreasonable Time
|
|
|
Distributed Computing
|
Detailed explanation-1: -Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time. Some problems cannot be solved in a reasonable amount of time because there is no efficient algorithm for solving them. In these cases, approximate solutions are sought.
Detailed explanation-2: -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-3: -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).
Detailed explanation-4: -Polynomial, linear, and log algorithms are reasonable. Exponential algorithms are unreasonable.