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.

31. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
a. f(n) x g(n)
b. Max ( f(n),g(n))
c. Min (f(n),g(n))
d. f(n) + g(n)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Max ( f(n),g(n))

32. Ackerman’s function is defined on the non-negative integers as follows
a (m,n) = n+1 if m=0
= a (m-1, 1) if m ≠ 0, n=0
= a (m-1, a(m, n-1)) if m ≠ 0, n ≠ 0
The value of a (1, 3) is
a. 4
b. 5
c. 6
d. 7
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).5

33. What is a set of steps for carrying out a specific task called?
a. Programming
b. Source code
c. Data packages
d. Algorithm
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Algorithm

34. A real world example of an algorithm would be a___________.
a. Recipe
b. Unit
c. Food item
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Recipe

35. Who should know about the basic algorithmic toolbox structures that allow efficient organization and retrieval of data frequently used algorithms and basic techniques for modeling, understanding and solving algorithmic problems?
a. Computer scientist
b. Professional programmers
c. Both (a) and (b)
d. None of the above
View Answer Report Discuss Too Difficult!
Answer: (c).Both (a) and (b)

36. Algorithms are at the heart of every non-trivial computer application and also a modern and active area of ____________.
a. Programming
b. Computer processing
c. Computer science
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Computer science

37. Operations performed on scalar quantities are termed simple, while operations on vector data normally termed as_______.
a. Complex
b. Not very complex
c. Simple
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Complex

38. An algorithm may have __________‘inputs’ quantities.
a. One or more
b. Zero or more
c. Two or more
d. None of the above
View Answer Report Discuss Too Difficult!
Answer: (b).Zero or more

39. ___________ refers to a finite set of steps, which, when followed, solves a particular problem.
a. Algorithm
b. Finiteness
c. Output
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Algorithm

40. The two main resources that we consider for an algorithm are__________.
a. Memory space and processor time
b. Space complexity and time complexity
c. Input and output properties
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Memory space and processor time

Page 4 of 7