Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Test  >  Compiler Design  >  Test: Relations - Computer Science Engineering (CSE) MCQ

Relations - GATE CSE (CSE) Compiler Design Free MCQ Test with solutions


MCQ Practice Test & Solutions: Test: Relations (15 Questions)

You can prepare effectively for Computer Science Engineering (CSE) Compiler Design with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Relations". These 15 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.

Test Highlights:

  • - Format: Multiple Choice Questions (MCQ)
  • - Duration: 15 minutes
  • - Number of Questions: 15

Sign up on EduRev for free to attempt this test and track your preparation progress.

Test: Relations - Question 1

(a,b) what is a?

Detailed Solution: Question 1

Explanation: A is called the domain.

Test: Relations - Question 2

(a,b) what is b?

Detailed Solution: Question 2

Explanation: B is called the Range.

Test: Relations - Question 3

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

Detailed Solution: Question 3

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

Test: Relations - Question 4

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

Detailed Solution: Question 4

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

Test: Relations - Question 5

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

Detailed Solution: Question 5

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

Test: Relations - Question 6

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

Detailed Solution: Question 6

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

Test: Relations - Question 7

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

Detailed Solution: Question 7

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

Test: Relations - Question 8

If A ∩ B = B, then

Detailed Solution: Question 8

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

Test: Relations - Question 9

Empty set is a

Detailed Solution: Question 9

Explanation: Empty set is a finite set.

Test: Relations - Question 10

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

Detailed Solution: Question 10

Explanation: it is De’ Morgan law.

Test: Relations - Question 11

A = {x: x ≠ x }represents

Detailed Solution: Question 11

Explanation: That is a fact.

Test: Relations - Question 12

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

Detailed Solution: Question 12

Explanation: Transition Law.

Test: Relations - Question 13

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

Detailed Solution: Question 13

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

Test: Relations - Question 14

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

Detailed Solution: Question 14

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

Test: Relations - Question 15

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

Detailed Solution: Question 15

Explanation: It is distributive law.

26 videos|92 docs|30 tests
Information about Test: Relations Page
In this test you can find the Exam questions for Test: Relations solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Relations, EduRev gives you an ample number of Online tests for practice
26 videos|92 docs|30 tests
Download as PDF