McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Discrete Structure (DS)
→
Unit 2
→
The union of two equivalence relations o...
Q.
The union of two equivalence relations on a non- empty set is an equivalence relation.
A.
T
B.
F
Answer» B. F
2.4k
0
Do you find this helpful?
4
View all MCQs in
Discrete Structure (DS)
Discussion
No comments yet
Login to comment
Related MCQs
If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.
If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called -------
A relation R is defined on Z by xRy if 2x +5y = 0(mod7). Then the equivalence class[10] is equal to the equivalence class…
Define an equivalence relation R on the positive integers A = {2, 3, 4, . . . , 20} by m R n if the largest prime divisor of m is the same as the largest prime divisor of n. The number of equivalence classes of R is
If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:
Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is
Define a binary relation R on a set A to be anti- reflexive if xRx doesn’t hold for any x 2 A. The number of symmetric, anti-reflexive binary relations on a set of ten elements is
If A and B are two non empty sets then cartesian product of A and B is----------
The Relation is----------if a has relation with b and b has relation with a.