Math for Computer science Questions and Answers 121 to 130

Math for Computer science

Questions  121 to 130

121.	Let universe : Set of all birds Let p (x) : x is a Parrot q (x) : x can speak then symbollic representation of "All Parrots can speak" (a) x [p(x) Ù q(x)]    (b) x [p(x) v q(x)] (c) x [p(x)  q(x)] (d) x [p(x) ® q(x)] (e) x [p(x) Å q(x)].
122.	Let a set A has 8 elements then P(A) denotes the powerset of the set A. Now cardinality of P(A) is (a) 16 (b) 81 (c) 256 (d) 1 (e) 4.
123.	Let 'n' be a positive integer.  Then which of the following are true for a real number 'x'? (a) ë x + nù = ë x û + n       (b) éx + nù = ëxù + ënû (c) éx + nù = éxù + n (d) ëx + nû = éx + n ù (e) ëx + n û = éxù + ënû.
124.	Let f(x ) = x and g(x) = x2 then (fog) (x) is (a) x + 5 (b) x2 (c) x2 – 5 (d) x2 + 5 (e) x – 5.
125.	Let U = {0, 1, 2, 3, 4, 5, 6, 8, 9, 10}. The set represented by the bit string 0 1 1 0 0 0 1 1 1 0 0  is (a) {0, 2, 7, 8, 9, 10} (b) {1, 3, 4, 5, 6}   (c) {1, 3, 4, 6, 7} (d) {1, 2, 6, 7, 8} (e) {0, 1, 3, 4, 6}.
126.	The rule of inference in  known as (a) Addition (b) Simplification (c) Disjunctive Syllogism (d) Modus Tokens (e) Resolution.
127.	Binary equavalent of the decimal number 726 is (a) 1 1 0 0 0 0 0 1 0 1 (b) 1 0 1 1 0 1 0 1 1 0 (c) 1 0 1 0 0 0 1 0 0 1 (d) 1 0 1 0 0 0 0 0 1 1 (e) 0 1 0 1 1 1 1 0 1 0.
128.	Decimal equivalent of the Binary notation 1 1 1 1 1 0 1 0 1 0 1 is (a) 2013 (b) 2007 (c) 2003 (d) 2004 (e) 2005.
129.	How many positive integers less than 100 are divisible by either 13 or 15? (a) 7 (b) 13 (c) 6 (d) 15 (e) 19.
130.	The Principle of Inclusion – Exclusion on two sets is given by (a) (b) (c) (d) (e) .

Answers