". VdoTips

APPLY LATEST GOVT JOBS

hi
51. To verify whether a function grows faster or slower than the other function, we have some asymptotic or mathematical notations, which is_________.
(A).Big Omega Ω (f)
(B).Big Theta θ (f)
(C).Big Oh O (f)
(D).All of the above


52. A subroutine can be coded so that it may call itself recursively, at___________, in order to perform its task.
(A).One or more places
(B).Two or more places
(C).More places
(D).None of the above


53. A function in which f(n) is Ω(g(n)), if there exist positive values k and c such that f(n)>= c*g(n), for all n>=k. This notation defines a lower bound for a function f(n):
(A).Big Omega Ω (f)
(B).Big Theta θ (f)
(C).Big Oh O (f)
(D).None of the above


54. An algorithm that indicates the amount of temporary storage required for running the algorithm, i.e., the amount of memory needed by the algorithm to run to completion is termed as_____.
(A).Space complexity
(B).Big Theta θ (f)
(C).Big Oh O (f)
(D).None of the above


55. The amount of time the computer needs to run to completion is known as_____:
(A).Space complexity
(B).Time complexity
(C).Recursive function
(D).None of the above