Math for Computer science
Questions 81 to 90
81.

A Ç (A È B) = A is known as


82.

Let U =
{1, 2, 3, 4, 5 ….10} then bit string for the set A = {1, 2, 5, 6, 9, 10} is


83.

Let U =
{1, 2, 3, ….10} the set representation of bit string 10 01 00 11 10
is


84.

If every
element of a set A is also an element of B then A and B are connected by the
relation


85.

A
Relation is said to be a function if


86.

Let f(x)
= éx^{2}/4ù defined on A = {1, 2, 3, 4} then
f(A) is


87.

Let f : A
® B be a function. Let x Î A and f(x) = y then x is called


88.

Let f : A
® B be a function. If Codomain of the function equals
to Range of the function, then the function is called


89.

The
inference Rule of the form [(pÚq) Ù (ù p Ú r)] ® (q Ú r) is known as


90.

Biconditional
operator is true only when

Answers
81.

Answer : (d)
Reason: By definition of Absorption Law.

82.

Answer : (e)
Reason: U = {1, 2, … 10}
A = {1, 2, 5, 6,
9, 10}
Bit string: 11 00 11 00 11

83.

Answer : (b)
Reason: U = {1, 2, … 10}
A = {1, 4, 7, 8,
9}
Bit string : 10 01 00 11 10

84.

Answer : (c)
Reason: By definition of subset, A is subset of B

85.

Answer : (e)
Reason: By definition of a function Every element of
the first set is mapped to atleast one element in second set.

86.

Answer : (c)
Reason: é ù for x Î {1, 2, 3, 4}
x = 1 Þ f(1) = éù = éù = é0.25ù = 1
x = 2 Þ f(2) = éù = éù = é1ù = 1
x = 3 Þ f(3) = éù = éù = é2.25ù = 3
x = 4 Þ f(4) = éù = éù = 4
\ f(A) = {1, 3, 4}

87.

Answer : (d)
Reason: By definition of Pre image

88.

Answer : (b)
Reason: By definition of Subjective function

89.

Answer : (d)
Reason: By definition of Resolution.

90.

Answer : (b)
Reason: By definition of Bi conditional

No comments :
Post a Comment