1 |
To draw general conclusions from a limited number of observations is called: |
logic
proposition
induction
deduction
|
2 |
A statement which is true for all possible values of the variables involved in it, is called a: |
tautology
conditional
implication
absurdity
|
3 |
A compound statement of the form "if p then q" is called an: |
tautology
conditional
consequent
absurdity
|
4 |
The number of subsets of a set having three elements is: |
2
3
4
8
|
5 |
If n(S) = 3 then n {P(S)} = |
2
8
16
4
|
6 |
|
A
B
|
7 |
|
B
A
none of these
|
8 |
B - A is a subset of: |
A
B
|
9 |
A - B is a subset of: |
A
B
|
10 |
|
A
B
|
11 |
|
A
B
|
12 |
|
A and B are power sets
A and B are disjoint sets
A and B are super sets
A and B are equal sets
|
13 |
If set A = {1, 2, 3} and B = {1, 2, 3} then sets A and B are: |
not equal
equal
disjoint
overlapping
|
14 |
If two sets have no element common, they are called: |
disjoint
over lapping
dissimilar
exhaustive
|
15 |
{2, 4, 6, 8, ...........} represents the set of: |
positive odd numbers
natural numbers
prime numbers
positive even numbers
|
16 |
If A = {1, 2, 7, 9}, B = {1, 4, 7, 11}: |
disjoints sets
equal sets
overlapping sets
complementary sets
|
17 |
A set containing finite number of elements is called: |
nullset
superset
finiteset
infiniteset
|
18 |
A set having no element is called: |
null set
subset
singleton
superset
|
19 |
|
a is an element of a set A
a is subset of A
a is a whole number
a contains A
|
20 |
|
set builder notation
tabular form
descriptive method
non-set builder method
|