681. To measure Time complexity of an algorithm Big O notation is used which:
A. describes limiting behaviour of the function
B. characterises a function based on growth of function
C. upper bound on growth rate of the function
D. all of the mentioned

682. If for an algorithm time complexity is given by O(1) then complexity of it is:
A. constant
B. polynomial
C. exponential
D. none of the mentioned

683. If for an algorithm time complexity is given by O(log2n) then complexity will:
A. constant
B. polynomial
C. exponential
D. none of the mentioned

684. If for an algorithm time complexity is given by O(n) then complexity of it is:
A. constant
B. linear
C. exponential
D. none of the mentioned

685. if for an algorithm time complexity is given by O(n2) then complexity will:
A. constant
B. quadratic
C. exponential
D. none of the mentioned

686. If for an algorithm time complexity is given by O((3/2)^n) then complexity will:
A. constant
B. quadratic
C. exponential
D. none of the mentioned

687. the time complexity of binary search is given by:
A. constant
B. quadratic
C. exponential
D. none of the mentioned

688. The time complexity of linear search is given by:
A. O(log2n)
B. O(1)
C. exponential
D. none of the mentioned

689. Which algorithm is better for sorting between bubble sort and quicksort?
A. bubble sort
B. quick sort
C. both are equally good
D. none of the mentioned

690. Two main measures for the efficiency of an algorithm are
A. Time and space
B. Processor and memory
C. Complexity and capacity
D. Data and space