Courses

# Test: Relations

## 15 Questions MCQ Test Compiler Design | Test: Relations

Description
This mock test of Test: Relations for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 15 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Relations (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Relations quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Relations exercise for a better result in the exam. You can find other Test: Relations extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

### (a,b) what is a?

Solution:

Explanation: A is called the domain.

QUESTION: 2

### (a,b) what is b?

Solution:

Explanation: B is called the Range.

QUESTION: 3

### R is said to be reflexive if aRa is true for every a in A;

Solution:

Explanation: All the elements of A are related with
itself by relation R, hence it is a reflexive relation.

QUESTION: 4

If every aRb implies bRa then a relation R will be a symmetric relation.

Solution:

Explanation: a is related to b by R, and if b is also related to a by the
same relation R).

QUESTION: 5

If every aRb and bRc implies aRc, then the relation is transitive

Solution:

Explanation: a is related to b by R, and b is related to c by R, and similarly for a and c.

QUESTION: 6

The smallest set A such that A ∪ {1, 2} = {1, 2, 3, 5, 9} is

Solution:

Explanation: Given A ∪ {1, 2} = {1, 2, 3, 5, 9}. Hence A = {3,5,9}.

QUESTION: 7

If a set A has n elements, then the total number of subsets of A is.

Solution:

Explanation: Number of subsets of A = nC0 + nC1+ . . . . . + nCn = 2n.

QUESTION: 8

If A ∩ B = B, then

Solution:

Explanation: Since A ∩ B = B , hence B ⊂ A .

QUESTION: 9

Empty set is a

Solution:

Explanation: Empty set is a finite set.

QUESTION: 10

f A, B and C are any three sets, then A – (B ∪ C) is equal to

Solution:

Explanation: it is De’ Morgan law.

QUESTION: 11

A = {x: x ≠ x }represents

Solution:

Explanation: That is a fact.

QUESTION: 12

If A, B, C be three sets such that A ∪ B = A ∪ C and A ∩ B = A ∩ C, then

Solution:

Explanation: Transition Law.

QUESTION: 13

The number of proper subsets of the set {1, 2, and 3} is.

Solution:

Explanation: Number of proper subsets of the set {1, 2, 3) = 2³ – 1 = 7.

QUESTION: 14

If A and B are any two sets, then A ∪ (A ∩ B) is equal to

Solution:

Explanation: A ∩ B ⊆ A Hence A ∪ (A ∩ B) = A.

QUESTION: 15

If A, B and C are any three sets, then A × (B ∪ C) is equal to.

Solution:

Explanation: It is distributive law.