Deck 9: Relations
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/74
Play
Full screen (f)
Deck 9: Relations
1
List all the binary relations on the set {0, 1}.

2
List the irreflexive relations on the set {0, 1}.

3
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all people where aR b means that a is at least as tall as b.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all people where aR b means that a is at least as tall as b.
1, 4.
4
List the antisymmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
5
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {a, b, c} where R = {(a, a), (b, b), (c, c), (a, b), (a, c), (c, b)}.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {a, b, c} where R = {(a, a), (b, b), (c, c), (a, b), (a, c), (c, b)}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
6
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
7
List the relations on the set {0, 1} that are neither reflexive nor irreflexive.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
8
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on A = {x, y, z} where R = {(x, x), (y, z), (z, y)}.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on A = {x, y, z} where R = {(x, x), (y, z), (z, y)}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
9
List the transitive relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
10
List the symmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
11
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {1, 2, 3, . . .} where aR b means a|b.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {1, 2, 3, . . .} where aR b means a|b.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
12
List the relations on the set {0, 1} that are reflexive and symmetric.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
13
List the asymmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
14
List the reflexive relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
15
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on N where aR b means that a has the same number of digits as b.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on N where aR b means that a has the same number of digits as b.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
16
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
17
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means |a − b| ≤ 1.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means |a − b| ≤ 1.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
18
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
19
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means that the units digit of a is equal to the units digit of b.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means that the units digit of a is equal to the units digit of b.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
20
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {w, x, y, z} where R = {(w, w), (w, x), (x, w), (x, x), (x, z), (y, y), (z, y), (z, z)}.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on {w, x, y, z} where R = {(w, w), (w, x), (x, w), (x, x), (x, z), (y, y), (z, y), (z, z)}.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
21
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
22
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
23
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
24
A company makes four kinds of products. Each product has a size code, a weight code, and a shape code.
The following table shows these codes:
Find which of the three codes is a primary key. If none of the three codes is a primary key, explain why.
The following table shows these codes:

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
25
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
26
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
27
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
28
If X =(Fran Williams, 617885197, MTH 202, 248B West), find the projections 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
29
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
30
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
31
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
32
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
33
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
34
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
35
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
36
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
37
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
38
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
39
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all people where aR b means that a is younger than b.
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all people where aR b means that a is younger than b.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
40
supp
ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.


Find the combination of relations.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
41
If R = {(1, 2), (1, 4), (2, 3), (3, 1), (4, 2)}, find the symmetric closure of R.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
42
What is the covering relation of the partial ordering 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
43
Draw the Hasse diagram for the relation R on A = {2, 3, 4, 5, 6, 8, 10, 40} 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
44
Find the transitive closure of R if
is 


Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
45
Find the smallest equivalence relation on {1, 2, 3} that contains (1, 2) and (2, 3).
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
46
Find the transitive closure of R if 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
47
Suppose A={2,3,6,9,10,12,14,18,20} and R is the partial order relation defined on A where xRy means x is a divisor of y .
(a) Draw the Hasse diagram for R .
(b) Find all maximal elements.
(c) Find all minimal elements.
(d) Find lub({2,9}) .
(e) Find lub ({3,10}) .
(f) Find glb ({14,10}) .
(a) Draw the Hasse diagram for R .
(b) Find all maximal elements.
(c) Find all minimal elements.
(d) Find lub({2,9}) .
(e) Find lub ({3,10}) .
(f) Find glb ({14,10}) .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
48
Find the join of the 3 -ary relation
{ (Wages,MS410,N507 ),(Rosen, CS540,N525), (Michaels, CS518,N504), (Michaels,MS410,N510)}
and the 4 -ary relation
{(MS410,N507,Monday, 6: 00),(MS410,N507,Wednesday, 6: 00),(CS540,N525, Monday,7:30),
(CS518,N504,Tuesday,6:00), (CS518,N504,Thursday,6:00) }
with respect to the last two fields of the first relation and the first two fields of the second relation.
{ (Wages,MS410,N507 ),(Rosen, CS540,N525), (Michaels, CS518,N504), (Michaels,MS410,N510)}
and the 4 -ary relation
{(MS410,N507,Monday, 6: 00),(MS410,N507,Wednesday, 6: 00),(CS540,N525, Monday,7:30),
(CS518,N504,Tuesday,6:00), (CS518,N504,Thursday,6:00) }
with respect to the last two fields of the first relation and the first two fields of the second relation.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
49
Find the transitive closure of R on {a, b, c, d} where R={(a, a),(b, a),(b, c),(c, a),(c, c),(c, d),(d, a),(d, c)} .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
50
Draw the directed graph for the relation defined by the matrix 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
51
If R = {(1, 2), (1, 4), (2, 3), (3, 1), (4, 2)}, find the reflexive closure of R.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
52
Draw the directed graph for the relation defined by the matrix 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
53
Find the smallest partial order relation on {1, 2, 3} that contains (1, 1), (3, 2), (1, 3).
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
54
Draw the Hasse diagram for the relation R on A = {2, 3, 4, 6, 10, 12, 16} 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
55
The diagram at the right is the Hasse diagram for a partially ordered set. Referring to this diagram:
(a) List the maximal elements
(b) List the minimal elements
(c) Find all upper bounds for f, g
(d) Find all lower bounds for d, f
(e) Find lub({g, j, m})
(f) Find glb({d, e})
(g) Find the greatest element
(h) Find the least element
(i) Use a topological sort to order the elements of the poset represented by this Hasse diagram.

(a) List the maximal elements
(b) List the minimal elements
(c) Find all upper bounds for f, g
(d) Find all lower bounds for d, f
(e) Find lub({g, j, m})
(f) Find glb({d, e})
(g) Find the greatest element
(h) Find the least element
(i) Use a topological sort to order the elements of the poset represented by this Hasse diagram.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
56
If
determine if R is:
(a) reflexive
(b) symmetric
(c) antisymmetric
(d) transitive.

(a) reflexive
(b) symmetric
(c) antisymmetric
(d) transitive.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
57
If R=
and
are bit strings containing the same number of 0s}, find the equivalence classes of
(a) 1 .
(b) 00 .
(c) 101 .


(a) 1 .
(b) 00 .
(c) 101 .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
58
If
determine if R is:
(a) reflexive
(b) symmetric
(c) antisymmetric
(d) transitive.

(a) reflexive
(b) symmetric
(c) antisymmetric
(d) transitive.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
59
What is the covering relation of the partial ordering 

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
60
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.

determine rows and columns of the matrix.

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
61
In questions give an example or else prove that there are none.
A relation on {1, 2, 3} that is reflexive and transitive, but not symmetric.
A relation on {1, 2, 3} that is reflexive and transitive, but not symmetric.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
62
Let R be the relation on A={1,2,3,4,5} where R={(1,1),(1,3),(1,4),(2,2),(3,1),(3,3),(3,4),(4,1), , (4,3),(4,4),(5,5)} . Draw the directed graph for R .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
63
Suppwhetherose RR isis thean equivrelationalenceonrelationN whereonaRNb. means that a ends in the same digit in which b ends. Determine
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
64
Suppose that R and S are equivalence relations on a set A . Prove that the relation R∩S is also an equivalence relation on A .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
65
Let R be the relation on A={1,2,3,4,5} where R={(1,1),(1,3),(1,4),(2,2),(3,1),(3,3),(3,4),(4,1) , (4,3),(4,4),(5,5)} . R is an equivalence relation. Find the equivalence classes for the partition of A given by R .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
66
Which of the following are partitions of {1,2,3, ... , 10} ?
(a) {2,4,6,8},{1,3,5,9},{7,10} .
(b) {1,2,4,8},{2,5,7,10},{3,6,9} .
(c) {3,8,10},{1,2,5,9},{4,7,8} .
(d) {1},{2}, ... ,{10} .
(e) {1,2, ... , 10} .
(a) {2,4,6,8},{1,3,5,9},{7,10} .
(b) {1,2,4,8},{2,5,7,10},{3,6,9} .
(c) {3,8,10},{1,2,5,9},{4,7,8} .
(d) {1},{2}, ... ,{10} .
(e) {1,2, ... , 10} .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
67
Suppose A is the set composed of all ordered pairs of positive integers. Let R be the relation defined on A where (a, b) R(c, d) means that a+d=b+c .
(a) Prove that R is an equivalence relation.
(b) Find [(2,4)] .
(a) Prove that R is an equivalence relation.
(b) Find [(2,4)] .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
68
Suppose
Find the number of reflexive, symmetric binary relations on A .

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
69
In questions give an example or else prove that there are none.


Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
70
Suppose
. Find the number of binary relations on A .

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
71
In questions give an example or else prove that there are none.
A relation on {1, 2} that is symmetric and transitive, but not reflexive.
A relation on {1, 2} that is symmetric and transitive, but not reflexive.
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
72
Let R be the relation on A={1,2,3,4,5} where R={(1,1),(1,3),(1,4),(2,2),(3,1),(3,3),(3,4),(4,1) , (4,3),(4,4),(5,5)} . Write the matrix for R .
Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
73
Suppose
Find the number of symmetric binary relations on A .

Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck
74
Suppose the relation R is defined on the set
where aRb means that
Determine whether R is an equivalence relation on 



Unlock Deck
Unlock for access to all 74 flashcards in this deck.
Unlock Deck
k this deck