Mathematics W.S – VIII IX – CBSE – TECHNO 1 Sri Chaitanya Schools I. Straight Objective type Questions : 1.

Question

Mathematics W.S – VIII IX – CBSE – TECHNO

1 Sri Chaitanya Schools

I. Straight Objective type Questions :

1. If R = {(1, 2), (3, 4), (5, 6)}, then range (R–1) = [ ]

a) {1, 3, 5} b) {2, 4, 6} c) {1, 4, 6} d) {2, 3, 5}

2. If A = {2, 4} and B = {3, 4, 5}, then  A B A B       is [ ]

a) {(2, 2) (3, 4) (4, 2) (5, 4)} b) {(2, 3) (4, 3) (4, 5)}

c) {(2, 4) (3, 4) (4, 4) (4, 5)} d) {(4, 2) (4, 3) (4, 4) (4, 5)}

3. Let A be a set containing 10 distinct elements and B has 5 distinct elements, then A × B has

–––– elements

a) 15 b) 105

c) 5 d) 50

4. In order that a relation R defined on a non – empty set A is an equivalence relation. It is

sufficient, if R is [ ]

a) reflexive b) symmetric

c) transitive d) possesses all the above three properties

5. In the set, A = {1, 2, 3, 4, 5}, a relation R is defined by, R = {( , ): , } x y x y Aand x y   .

Then R is [ ]

a) reflexive b) symmetric c) transitive d) none

6. If R is a relation from a finite set A having m elements to a finite set B having n elements, then

the number of relations from A to B is [ ]

a) 2mn b) 2mn –1 c) 2mn d) mn

II. Matrix Matching :

Column – I Column – II

If R is a relation from A to A, n(A) = n

Nature of the Relation Number of Relations

7. Reflexive relations [ ] a) ( 1)

2 2

n n

8. Symmetric relations [ ] b)

( 1)

2 2 . 3

n n

n

9. Anti – symmetric relations [ ] c) ( 1)

2 2

n n

10. equivalence relations [ ] d) 2n (n –1)

UNWANTED ANSWERS WILL BE REPORTED ​

in progress 0
3 weeks 2021-08-20T05:05:30+00:00 2 Answers 0 views 0

please bro Iam following you bro

Mathematics W.S – VIII IX – CBSE – TECHNO

1 Sri Chaitanya Schools

I. Straight Objective type Questions :

1. If R = {(1, 2), (3, 4), (5, 6)}, then range (R–1) = [ ]

a) {1, 3, 5} b) {2, 4, 6} c) {1, 4, 6} d) {2, 3, 5}

2. If A = {2, 4} and B = {3, 4, 5}, then  A B A B       is [ ]

a) {(2, 2) (3, 4) (4, 2) (5, 4)} b) {(2, 3) (4, 3) (4, 5)}

c) {(2, 4) (3, 4) (4, 4) (4, 5)} d) {(4, 2) (4, 3) (4, 4) (4, 5)}

3. Let A be a set containing 10 distinct elements and B has 5 distinct elements, then A × B has

–––– elements

a) 15 b) 105

c) 5 d) 50

4. In order that a relation R defined on a non – empty set A is an equivalence relation. It is

sufficient, if R is [ ]

a) reflexive b) symmetric

c) transitive d) possesses all the above three properties

5. In the set, A = {1, 2, 3, 4, 5}, a relation R is defined by, R = {( , ): , } x y x y Aand x y   .

Then R is [ ]

a) reflexive b) symmetric c) transitive d) none

6. If R is a relation from a finite set A having m elements to a finite set B having n elements, then

the number of relations from A to B is [ ]

a) 2mn b) 2mn –1 c) 2mn d) mn

II. Matrix Matching :

Column – I Column – II

If R is a relation from A to A, n(A) = n

Nature of the Relation Number of Relations

7. Reflexive relations [ ] a) ( 1)

2 2

n n

8. Symmetric relations [ ] b)

( 1)

2 2 . 3

n n

n

9. Anti – symmetric relations [ ] c) ( 1)

2 2

n n

10. equivalence relations [ ] d) 2n (n –1)