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.

 101. Identify the correct translation into logical notation of the following assertion."Some boys in the class are taller than all the girls" Note : taller(x,y) is true if x is taller than y. a. (∃x) (boy(x) → (∀y) (girl(y) ∧ taller(x,y))) b. (∃x) (boy(x) ∧ (∀y) (girl(y) ∧ taller(x,y))) c. (∃x) (boy(x) → (∀y) (girl(y) → taller(x,y))) d. (∃x) (boy(x) ∧ (∀y) (girl(y) → taller(x,y)))

 102. If a fair coin is tossed four times. What is the probability that two heads and two tails will result? a. 3/8 b. 1/2 c. 5/8 d. 2/4

 103. The number of different n × n symmetric matrices with each element being either 0 or 1 is:(Note: power(2, x) is same as 2x) a. power(2, n) b. power(2, n^2) c. power(2, (n^2 + n)/2) d. power(2, (n^2 - n)/2)

 104. Let A, B, C, D be n × n matrices, each with non-­zero determinant. If ABCD = 1, then B-1 is a. D^-1C^-1A^-1 b. CDA c. ADC d. Does not necessarily exist

 105. What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?(113. + -111.) + 7.51113. + (-111. + 7.51) a. 9.51 and 10.0 respectively b. 10.0 and 9.51 respectively c. 9.51 and 9.51 respectively d. 10.0 and 10.0 respectively

 106. The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of a. n b. n^2 c. n log n d. n log2 n

 107. The problems 3-SAT and 2-SAT are a. both in P b. both NP-complete c. NP-complete and in P respectively d. undecidable and NP-complete respectively