". VdoTips


41. In the analysis of algorithms, what plays an important role?
(B).Growth factor
(D).None of the above

42. An algorithm performs lesser number of operations when the size of input is small, but performs more operations when the size of input gets larger. State if the statement is True or False or Maybe.
(D).None of the above

43.________________ is a powerful technique which is used to invoke a function.
(C).Big Oh Ο (f)
(D).None of the above

44. A function, which invokes itself repeatedly until some condition is satisfied, is called a_________.
(A).Recursive function
(B).Big Theta θ(f)
(C).Big Omega Ω(f)
(D).None of the above

45. The number of recursive calls is limited to the _____ of the stack.