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"


122.

Let a set A has
8 elements then P(A) denotes the powerset of the set A. Now cardinality of
P(A) is


123.

Let 'n' be a
positive integer. Then which of the
following are true for a real number 'x'?


124.

Let f(x ) = x
and g(x) = x2 then (fog) (x) is


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


126.

The rule of
inference in known as


127.

Binary
equavalent of the decimal number 726 is


128.



129.

How many
positive integers less than 100 are divisible by either 13 or 15?


130.

The Principle of
Inclusion – Exclusion on two sets is given by

No comments :
Post a Comment