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.

 81. Let P(E) denote the probability of the event E. Given P(A) = 1, P(B) = 1/2, the values of P(A | B) and P(B | A) respectively are a. 1/4, 1/2 b. 1/2, 1/14 c. 1/2, 1 d. 1, 1/2

 82. Let A be a sequence of 8 distinct integers sorted in ascending order. How many distinct pairs of sequences, B and C are there such that (i) each is sorted in ascending order, (ii) B has 5 and C has 3 elements, and (iii) the result of merging B and C gives A? a. 2 b. 30 c. 56 d. 256

 83. Let T(n) be the number of different binary search trees on n distinct elements. Then , where x is a. n-k+1 b. n-k c. n-k-1 d. n-k-2

 84. Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between a. k and n b. k - 1 and k + 1 c. k - 1 and n - 1 d. k + 1 and n - k

 85. Which of the following is a valid first order formula ? (Here α and β are first order formulae with x as their only free variable) a. A b. B c. C d. D

 86. Consider the following formula a and its two interpretations I1 and I2. Which of the following statements is true? a. I1 satisfies α, I2 does not b. I2 satisfies α, I1 does not c. Neither I2 nor I2 satisfies α d. Both I1 and I2 satisfy α

 87. m identical balls are to be placed in n distinct bags. You are given that m ≥ kn, where, k is a natural number ≥ 1. In how many ways can the balls be placed in the bags if each bag must contain at least k balls? a. A b. B c. C d. D