Font size
WorksheetsProgram Efficiency 2
Total questions: 15
Worksheet time: 8mins
The measure of the efficiency of an algorithm is called algorithm’scomputational (a) .
Programs with a bigger ) notation value run (a) than programs with a smaller O notation value.(
(a) term effects the most ,an algorithm’s performance.
Only the (a) term is included in big O notation
An algorithm’s performance cannot be slower than the (a) .
(a) is inversely proportional to the wall clock time.
A (a) ia an algorithm encoded into some programming language.
The overall efficiency of a program depends on the amount of (a) an algorithm requires to solve a program.
As the (a) size for a program grows ,it effects the efficiency of an algorithm.
For linear search , the worst case running time is (a) in the size of the list.
The best case running time is the maximum running time for all the possible in puts.
True
False
Complexity is the only absolute measure for evaluating program efficiency.
True
False
As the input size for a programs grows , it affects the efficiency of an algorithm.
True
False
1. O(1)is ____?
Constant time
Linear time
Best case efficiency means that the ______execution time of the algorithm
highest
lowest
