Math for Computer science Questions and Answers 81 to 90

Math for Computer science

Questions  81 to 90

81.
A Ç (A È B) = A is known as
 (a) Identity Law (b) Idempotent Law (c) Associative Law (d) Absorption Law (e) Domination Law.
82.
Let U = {1, 2, 3, 4, 5 ….10} then bit string for the set A = {1, 2, 5, 6, 9, 10} is
 (a) 11    00    10    10    01 (b) 11    11    00    11    00 (c) 11    00    11    11    00 (d) 11    11    00    00    11 (e) 11    00    11    00    11.
83.
Let U = {1, 2, 3, ….10} the set representation of bit string 10        01         00         11         10 is
 (a) A = {2, 3, 5, 6, 10} (b) A = {1, 4, 7,  8, 9} (c) A = {1, 2, 5, 6, 7} (d) A = {2, 4, 5, 9, 10} (e) A = {3, 5, 7, 8, 9}.
84.
If every element of a set A is also an element of B then A and B are connected by the relation
 (a) A is superset of B (b) A is greater than B (c) A is subset of B (d) B is a greater than A (e) A is equal to B.
85.
A Relation is said to be a function if
 (a) Every element of the second set is mapped to all elements of the first set (b) Every element of the second set is mapped to an element of the first set (c) Every element of the first  set is mapped to no element in second set (d) Every element of the first set is not mapped to atleast an element in second set (e) Every element of the first set is mapped to atleast an element in the second set.
86.
Let f(x) = éx2/4ù defined on A = {1, 2, 3, 4} then f(A) is
 (a) {1, 2, 3, 4} (b) {1, 2, 4} (c) {1, 3, 4} (d) {2, 3, 4} (e) {1, 2, 3}.
87.
Let f : A ® B be a function. Let x Î A and f(x) = y then x is called
 (a) Image of y with respect to f (b) Image of x with respect to f (c) Pre image of x with respect to f (d) Pre image of y with respect to f (e) Domain of y with respect to f.
88.
Let f : A ® B be a function. If Co-domain of the function equals to Range of the function, then the function is called
 (a) One - One function (b) Surjective function (c) Bijection function (d) Injective function (e) Automorphism.
89.
The inference Rule of the form [(pÚq) Ù (ù p Ú r)] ® (q Ú r) is known as
 (a) Addition (b) Conjunction (c) Modus Ponens (d) Resolution (e) Fallacy.
90.
Biconditional operator is true only when
 (a) Both the inputs are different (b) Both the inputs are same (c) Both the inputs are outputs (d) Both the inputs are inputs (e) Both the outputs are outputs.