 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

#### Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

 41. Space complexity of an algorithm is the maximum amount of _______ required by it during execution. a. Time b. Operations c. Memory space d. None of the above

 42. Frequently, the memory space required by an algorithm is a multiple of the size of input. State if the statement is True or False or Maybe. a. True b. False c. Maybe d. None of the above

 43. For many problems such as sorting, there are many choices of algorithms to use, some of which are extremely___________. a. Space efficient b. Time efficient c. Both (a) and (b) d. None of the above

 44. In the analysis of algorithms, what plays an important role? a. Text Analysis b. Growth factor c. Time d. None of the above

 45. 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. a. True b. False c. Maybe d. None of the above

 46. 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

 47. 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