Register

Recent questions tagged relations

4 votes
1 answer
211
Relation and Partial order
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people, if a is not taller than b?
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people,if a is not taller than b?
User Avatar
2 votes
1 answer
212
Kenneth Rosen Edition 6th Exercise 7.5 Question 3 d (Page No. 507)
R is a relation on the set of all functions from Z to Z. R = { (f, g) | for some C ∈ Z , for all x ∈ Z , f(x) - g(x) = C } is it Equivalence relation or not ?
R is a relation on the set of all functions from Z to Z.R = { (f, g) | for some C ∈ Z , for all x ∈ Z , f(x) - g(x) = C } is it Equivalence relation or not ?
User Avatar
1 votes
1 answer
213
Relations
Please tell me how to calculate total number of symmetric relations on a set of 5 elements. I know the answer but want the proof.
Please tell me how to calculate total number of symmetric relations on a set of 5 elements.I know the answer but want the proof.
User Avatar
2 votes
1 answer
215
Views and Tables
What is the difference between a View and a Table? If I create a Table, it will be stored in the database. I mean on the storage space. If I create a View, it will not be stored onto the storage space? Please correct me if I am wrong?
What is the difference between a View and a Table?If I create a Table, it will be stored in the database. I mean on the storage space.If I create a View, it will not be s...
User Avatar
14 votes
3 answers
219
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
User Avatar
4 votes
0 answers
220
tables in Self Referential relations
Plz explain what is the no of tables required in self referential relation( without multivalued attribute) and How:- and also (with multivalued attribute) ? ???
Plz explain what is the no of tables required in self referential relation( without multivalued attribute) and How:- and also (with multivalued attribute) ????
User Avatar
1 votes
1 answer
221
Relations
Proof that a relation which is symmetric and transitive, need not be reflexive relation.
Proof that a relation which is symmetric and transitive, need not be reflexive relation.
User Avatar
1 votes
1 answer
222
Relations
Let A={1,2,3,4,5,6,7} What will be no of symmetric relations on A that contains exactly 4 ordered pairs?
Let A={1,2,3,4,5,6,7}What will be no of symmetric relations on A that contains exactly 4 ordered pairs?
User Avatar
0 votes
1 answer
227
type of relation
how is it not transitive?? i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
how is it not transitive??i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
User Avatar
0 votes
2 answers
229
Geeks for Geeks
A and B are two sets. If |A| = 5 , |B| = 3 , then, the number of onto functions from A to B are ___ ? (A) 35 (B) 150 (C) 29 (D) 27
A and B are two sets. If |A| = 5 , |B| = 3 , then, the number of onto functions from A to B are ___ ?(A) 35(B) 150(C) 29(D) 27
User Avatar
0 votes
1 answer
233
Relation composition
$R$ and $S$ are two relations on a set $A$ $\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \\ \end{bmatrix} \end{align*}$ Then matrices for $R \cap S$ and $R \cup S$ ?
$R$ and $S$ are two relations on a set $A$$$\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 &...
User Avatar
1 votes
1 answer
234
Relation
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$. a. $R = \left \{ (x,y) \; | x = y \pm 1 \right \}$ b. $R = \left \{ (x,y) \; | x + y = 1000 \right \}$
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$.a. $R = \left \{ (x,y) \; | x = y \pm 1 \right...
User Avatar
0 votes
0 answers
235
Equivalence relation
True / false ? a. Partitions formed from congruence classes modulo $6$ ... $R_4$ creates refinement partitions with respect to the partitions of $R_3$.
True / false ?a. Partitions formed from congruence classes modulo $6$ is a refinement of the partitions formed from congruence classes modulo 3s and t are bit strings and...
User Avatar
6 votes
2 answers
236
equivalence relaton
How many different equivalence relations with exactly three equivalence classes are there on a set with 5 elements 10 15 25 30
How many different equivalence relations with exactly three equivalence classes are there on a set with 5 elements10152530
User Avatar
21 votes
6 answers
238
GATE CSE 1989 | Question: 1-iv
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
User Avatar
25 votes
2 answers
239
GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
User Avatar
24 votes
4 answers
240
GATE CSE 1987 | Question: 9a
How many binary relations are there on a set $A$ with $n$ elements?
How many binary relations are there on a set $A$ with $n$ elements?
User Avatar
Page: