Register

Recent questions tagged relations

1 votes
2 answers
153
Is the given relation transitive
For given R={(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)} Is the given relation transitive?
For given R={(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)}Is the given relation transitive?
User Avatar
0 votes
2 answers
154
Recurrence Relation
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $O(n^{2})$ $O(logn)$ $O(nlogn)$ $O(n^{2}logn)$
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $$O(n^{2})$$O(logn)$$O(nlogn)$$O(n^{2}logn)$
User Avatar
0 votes
1 answer
155
Relation
State True or False? Empty set Φ is an equivalence relation.
State True or False?Empty set Φ is an equivalence relation.
User Avatar
1 votes
1 answer
156
ISI2017-PCB-A-3
Let $B=\{1, 2, 3, 4\}$. A set $S \subseteq B \times B$ called a symmetric set of $B$ if for all $x, y \in B$, $ (x, y) \in S \Rightarrow (y,x) \in S.$ Find the number of symmetric sets of $B$.
Let $B=\{1, 2, 3, 4\}$. A set $S \subseteq B \times B$ called a symmetric set of $B$ if for all $x, y \in B$, $$ (x, y) \in S \Rightarrow (y,x) \in S.$$Find the number of...
User Avatar
0 votes
1 answer
157
Relations
What is the smallest binary relation possible from A to B? Is it Null Set? If so, how is it possible relations are subsets of AxB (cartesian product) and if AxB is not supposed to be containing a Null Set.
What is the smallest binary relation possible from A to B? Is it Null Set? If so, how is it possible relations are subsets of AxB (cartesian product) and if AxB is not s...
User Avatar
13 votes
4 answers
160
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
User Avatar
0 votes
1 answer
161
Doubt
Is empty relation an equivalence relation?
Is empty relation an equivalence relation?
User Avatar
0 votes
1 answer
163
Kenneth Rosen Edition 6th Exercise 7.4 Example 7 (Page No. 493)
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
User Avatar
3 votes
4 answers
177
ISRO2018-56
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be $O(n)$ $O(n*\log(n))$ $O(n^{\frac{3}{2}})$ $O(n^{3})$
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be$O(n)$$O(n*\log(n))$$O(n^{\frac{3}{2}})$$O(n^{3})$
User Avatar
1 votes
1 answer
179
Set theory
Consider a set S $\left \{ 2,3,4,.....,23,24 \right \}$ and R is relation on S such that aRb if a divides b, then find the number of minimal elements in its hasse diagram
Consider a set S $\left \{ 2,3,4,.....,23,24 \right \}$ and R is relation on S such that aRb if a divides b, then find the number of minimal elements in its hasse diagram...
User Avatar
1 votes
1 answer
180
TEST SERIES
A binary relation R on Z × Z is defined as follows: ( a , b ) R ( c , d ) iff a = c or b = d Consider the following propositions: 1. R is reflexive.2. R is symmetric. 3. R is antisymmetric. Which one of the following statements are True?
A binary relation R on Z × Z is defined as follows: ( a , b ) R ( c , d ) iff a = c or b = d Consider the following propositions:1. R is reflexive.2. R is symmetric. 3....
User Avatar
Page: