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.

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
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Memory space

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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).True

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
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Both (a) and (b)

44. In the analysis of algorithms, what plays an important role?
a. Text Analysis
b. Growth factor
c. Time
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Growth factor

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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).True

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
View Answer Report Discuss Too Difficult! Search Google
Answer: (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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Big Omega Ω (f)

48. 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. Big Theta θ (f)
b. Space complexity
c. Big Oh O (f)
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Space complexity

49. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Time complexity

50. ___________algorithm is one which utilizes minimum processor time and requires minimum memory space during its execution.
a. Best
b. Efficient
c. Both (a) and (b)
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Both (a) and (b)

Page 5 of 7