Q. ______ number of reflexive closure exists in a relation R = {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} where {0, 1, 2, 3} ∈ A.

View solution

Q. The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3, 4, 5} is _______

View solution

Q. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) ∈ N² | a!= b} satisfies _______ property.

View solution

Q. The number of equivalence relations of the set {3, 6, 9, 12, 18} is ______

View solution

Q. Let R₁ and R₂ be two equivalence relations on a set. Is R₁ ∪ R₂ an equivalence relation?

View solution

Q. A relation R is defined on the set of integers as aRb if and only if a+b is even and R is termed as ______

View solution

Q. The binary relation U = Φ (empty set) on a set A = {11, 23, 35} is _____

View solution

Q. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________

View solution

Q. Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational numbers,then R’ is _________

View solution

Q. Let S be a set of n>0 elements. Let be the number Bᵣ of binary relations on S and let Bf be the number of functions from S to S. The expression for Bᵣ and Bf, in terms of n should be ____________

View solution

Q. Let A be a set of k (k>0) elements. Which is larger between the number of binary relations (say, Nr) on A and the number of functions (say, Nf) from A to A?

View solution

Q. Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?

View solution

Q. Let R₁ be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R₂ be another relation from B to C = {1, 2, 3, 4} as defined below:

i. An element a in A is related to an element b in B (under R₁) if a * b is divisible by 3.

ii. An element a in B is related to an element b in C (under R₂) if a * b is even but not divisible by 3. Which is the composite relation R₁R₂ from A to C?

View solution

Q. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________

View solution

Q. Let A and B be two non-empty relations on a set S. Which of the following statements is false?

View solution

Q. Determine the characteristics of the relation aRb if a² = b².

View solution

Q. Let R be a relation between A and B. R is asymmetric if and only if ________

View solution

Q. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is ______

View solution

Q. The less-than relation, <, on a set of real numbers is ______

View solution

Q. If the longest chain in a partial order is of length l, then the partial order can be written as _____ disjoint antichains.

View solution