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.

11. ___________ is often used to prove the correctness of a recursive function.
a. Diagonalization
b. Communitivity
c. Mathematical Induction
d. Matrix Multiplication
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Mathematical Induction

12. For any B-tree of minimum degree   t   ≥  2, every node other than the root must have atleast keys and every node can have at most ____ keys. 
a. t -1, 2t + 1
b. t + 1, 2t + 1
c. t-1, 2t-1
d. t+ 1, 2t-1
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).t-1, 2t-1

13. Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be 
a. m x n
b. max (m, n)
c. min (m, n)
d. m +n-1
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).m +n-1

14. Match the following with respect to programming languages

  a. Structured Language  i.   JAVA

  b. Non-structured Language   ii. BASIC

  c. Object Oriented  Programming Language  iii.  PASCAL

  D. Interpreted  Programming Language  iv. FORTRAN

codes:
a b c d
a. iii  iv   i   ii
b. iv   iii   ii   i
c. ii   iv   i   iii
d. ii   iii   iv   i
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).iii  iv   i   ii

15. The compiler converts all operands up to the type of the largest operand is called
a. Type Promotion
b. Type Evaluation
c. Type Conversion
d. Type Declaration
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Type Promotion

16. _____________ comparisons  are necessary in the worst case  to find both the maximum and minimum of n numbers.
a. 2n-2
b. n + floor(log n) -2
c. floor(3n/2) -2
d. 2 log n -2
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).floor(3n/2) -2

17. Let A and B be two n x n matrices,The efficient algorithm to multiply the two matrices , has the time complexity
a. O(n^3)
b. O(n^2.81)
c. O(n^2.67)
d. O(n^2)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).O(n^2.81)

18. Assuming there are n keys and each key is in the range [0, m - 1]. The run time of bucket sort is
a. O(n)
b. O(n log n)
c. O(n log m)
d. O(n+n)
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).O(n+n)

19. You have to sort a list L, consisting of a sorted list followed by a few 'random' elements. Which of the following sorting method would be most suitable for such a task?
a. Bubble sort
b. Selection sort
c. Quick sort
d. Insertion sort
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Insertion sort

20. A full binary tree with n leaves contains
a. n nodes
b. log2 n nodes
c. 2n-1 nodes
d. 2^n nodes
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).2n-1 nodes

Page 2 of 27