# Math for Computer science Questions and Answers 201 to 210

## Math for Computer science

### Questions  201 to 210

201.
(p Ú q) → q is a
 (a) Contingency (b) Contradiction (c) Tautology (d) Contrapositive (e) Inverse.

202.
The fallacy of affirming the consequent is denoted by
 (a) (b) (c) (d) (e) .

203.
From the following which is not the method of proof ?
 (a) Vacuous proof (b) Trivial proof (c) Indirect proof (d) Non-trivial proof (e) Direct proof.

204.
Let F(x) : x is a bird, P(x): x can fly.
The statement “All birds can fly” equivalent is
 (a) (b) (c) (d) (e) .

205.
Which of the following statements is false
 (a) ÆÎ power set of {0} (b) 0Î power set of {Æ} (c) {0}Î power set of {0} (d) {Æ}Ì power set of {0} (e) Æ = power set of  Æ.

206.
Which of the following statements is false?
 (a) (b) (c) (d) (e) .

207.
Which of the following is Absorption law
 (a) (b) (c) (d) B Ç (A È B) = A (e) .

208.
If E and F be the events with P(F) > 0. The conditional probability P(E | F) =
 (a) P( E Ç F) × P( F) (b) P( E Ç F) +  P(F) (c) P( E Ç F) – P(F) (d) P( E Ç F) /  P(F) (e) P(E È F) /  P(F).

209.
Determine which of the following functions from {a, b, c, d} to itself is one-to-one.
 (a) f(a) = b,  f(b) = a,  f(c) = c,                  f(d) = b (b) f(a) = a,   f(b) = a,  f(c) = c,                  f(d) = d (c) f(a) = a,   f(b) = b,  f(c) = c,                  f(d) = d (d) f(a) = b,  f(b) = c,  f(c) = c,                  f(d) = d (e) f(a) = c,   f(b) = d,  f(c) = c,                  f(d) = d.

210.
What is the probability of getting a tail when the coin is biased so that heads comes up twice as often as tails?
 (a) 1/2 (b) 2/3 (c) 3/2 (d) 2/5 (e) 1/3.