DATABASE FUNDAMENTALS
BASICS OF BIG DATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
To ensure the algorithm will run in reasonable time.
|
|
|
To ensure the algorithm will NOT run in unreasonable time.
|
|
|
There is no mathematical way to evaluate the run time of an algorithm.
|
|
|
If the algorithm solves the problem, the run time does not matter.
|
|
|
A and B only
|
Detailed explanation-1: -An algorithm is considered efficient if its resource consumption, also known as computational cost, is at or below some acceptable level. Roughly speaking, ‘acceptable’ means: it will run in a reasonable amount of time or space on an available computer, typically as a function of the size of the input.
Detailed explanation-2: -Time and space complexity are the two main measures for calculating algorithm efficiency, determining how many resources are needed on a machine to process it. Where time measures how long it takes to process the algorithm, space measures how much memory is used.
Detailed explanation-3: -Time efficiency-a measure of amount of time for an algorithm to execute. Space efficiency-a measure of the amount of memory needed for an algorithm to execute.
Detailed explanation-4: -The efficiency of an algorithm is defined as the number of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage. The efficiency of an algorithm can be measured based on the usage of different resources.