Deck 9: A: Relations

Full screen (f)
exit full mode
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all subsets of {1, 2, 3, 4} where SR T means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on the set of all subsets of {1, 2, 3, 4} where SR T means  <div style=padding-top: 35px>
Use Space or
up arrow
down arrow
to flip the card.
Question
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.
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means  <div style=padding-top: 35px>
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means  <div style=padding-top: 35px>
Question
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)}.
Question
List the reflexive relations on the set {0, 1}.
Question
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.
Question
List the transitive relations on the set {0, 1}.
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.  <div style=padding-top: 35px>
Question
List the asymmetric relations on the set {0, 1}.
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.  <div style=padding-top: 35px>
Question
List all the binary relations on the set {0, 1}.
Question
List the symmetric relations on the set {0, 1}.
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means  <div style=padding-top: 35px>
Question
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)}.
Question
List the relations on the set {0, 1} that are reflexive and symmetric.
Question
List the irreflexive relations on the set {0, 1}.
Question
List the antisymmetric relations on the set {0, 1}.
Question
List the relations on the set {0, 1} that are neither reflexive nor irreflexive.
Question
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.
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
suppose that the transactions at a fast-food restaurant during one afternoon are {hamburger,
fries, regular soda}, {cheeseburger, fries, regular soda}, {apple, hamburger, fries, regular soda}, {salad, diet
soda}, {hamburger, onion rings, regular soda}, {cheeseburger, fries, onion rings, regular soda}, {hamburger, fries},
{hamburger, fries, regular soda}.
Find the count and support of {cheeseburger}.
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.    <div style=padding-top: 35px> find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.    <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.  <div style=padding-top: 35px>
Question
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.  <div style=padding-top: 35px>
Question
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: 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.<div style=padding-top: 35px> Find which of the three codes is a primary key. If none of the three codes is a primary key, explain why.
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
suppose that the transactions at a fast-food restaurant during one afternoon are {hamburger,
fries, regular soda}, {cheeseburger, fries, regular soda}, {apple, hamburger, fries, regular soda}, {salad, diet
soda}, {hamburger, onion rings, regular soda}, {cheeseburger, fries, onion rings, regular soda}, {hamburger, fries},
{hamburger, fries, regular soda}.
Find all frequent itemsets if the threshold level is 0.6.
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
If X=( Fran Williams, 617885197, MTH 202, 248B West ) , find the projections If  X=(  Fran Williams,  617885197, MTH 202, 248B West  ) , find the projections  <div style=padding-top: 35px>
Question
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px> ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  <div style=padding-top: 35px>
Question
If R = {(1, 2), (1, 4), (2, 3), (3, 1), (4, 2)}, find the symmetric closure of R.
Question
Let Let   Determine if  R  is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.<div style=padding-top: 35px>
Determine if R is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.
Question
Let https://storage.examlex.com/TB34225555/Let https://storage.examlex.com/TB34225555/ . Determine if  R  is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.<div style=padding-top: 35px> .
Determine if R is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.
Question
The diagram at the right is the Hasse diagram for a partially ordered set. Referring to this diagram: The diagram at the right is the Hasse diagram for a partially ordered set. Referring to this diagram:  <div style=padding-top: 35px>
Question
Draw the directed graph for the relation defined by the matrix Draw the directed graph for the relation defined by the matrix  <div style=padding-top: 35px>
Question
 <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
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.
Question
Find the transitive closure of Find the transitive closure of   if   is  <div style=padding-top: 35px> if Find the transitive closure of   if   is  <div style=padding-top: 35px> is Find the transitive closure of   if   is  <div style=padding-top: 35px>
Question
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.  <div style=padding-top: 35px>
Question
Draw the directed graph for the relation defind by the matrix  Draw the directed graph for the relation defind by the matrix  <div style=padding-top: 35px>
Question
Find the smallest partial order relation on {1, 2, 3} that contains (1, 1), (3, 2), (1, 3).
Question
Find the smallest equivalence relation on {1, 2, 3} that contains (1, 2) and (2, 3).
Question
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}
Question
What is the covering relation of the partial ordering What is the covering relation of the partial ordering     on the set  {2,4,6,8,10,12} ? <div style=padding-top: 35px> on the set {2,4,6,8,10,12} ?
Question
If R = {(1, 2), (1, 4), (2, 3), (3, 1), (4, 2)}, find the reflexive closure of R.
Question
What is the covering relation of the partial ordering What is the covering relation of the partial ordering   on the set  {1,2,3,4,6,8,12,24} ? <div style=padding-top: 35px> on the set {1,2,3,4,6,8,12,24} ?
Question
Suppose A = {2, 3, 6, 9, 10, 12, 14, 18, 20} and R is the partial order relation defined on A where xR y means Suppose A = {2, 3, 6, 9, 10, 12, 14, 18, 20} and R is the partial order relation defined on A where xR y means  <div style=padding-top: 35px>
Question
If R = {(x, y) | x and y are bit strings containing the same number of 0s}, find the equivalence classes of (a) 1 (b) 00 (c) 101
Question
Draw the Hasse diagram for the relation Draw the Hasse diagram for the relation  <div style=padding-top: 35px>
Question
Suppose |A| = n. Find the number of symmetric binary relations on A.
Question
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.
Question
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)].
Question
Suppose |A| = n. Find the number of reflexive, symmetric binary relations on A.
Question
Suppose the relation R is defined on the set Z where aR b means that ab ≤ 0. Determine whether R is an equivalence relation on Z .
Question
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.
Question
give an example or else prove that there are none.
A relation on {1, 2, 3} that is reflexive and transitive, but not symmetric.
Question
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.
Question
give an example or else prove that there are none.
A relation on {a, b, c} that is reflexive and transitive, but not antisymmetric.
Question
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.
Question
Suppose |A| = n. Find the number of binary relations on A.
Question
give an example or else prove that there are none.
A relation on {1, 2} that is symmetric and transitive, but not reflexive.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/72
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 9: A: Relations
1
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on the set of all subsets of {1, 2, 3, 4} where SR T means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on the set of all subsets of {1, 2, 3, 4} where SR T means
1, 4
2
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, 2
3
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means
1, 2
4
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
5
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)}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
6
List the reflexive relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
7
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.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
8
List the transitive relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
9
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
10
List the asymmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
11
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
12
List all the binary relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
13
List the symmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
14
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
The relation R on Z where aR b means determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive. The relation R on Z where aR b means
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
15
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)}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
16
List the relations on the set {0, 1} that are reflexive and symmetric.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
17
List the irreflexive relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
18
List the antisymmetric relations on the set {0, 1}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
19
List the relations on the set {0, 1} that are neither reflexive nor irreflexive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
20
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.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
21
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
22
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
23
suppose that the transactions at a fast-food restaurant during one afternoon are {hamburger,
fries, regular soda}, {cheeseburger, fries, regular soda}, {apple, hamburger, fries, regular soda}, {salad, diet
soda}, {hamburger, onion rings, regular soda}, {cheeseburger, fries, onion rings, regular soda}, {hamburger, fries},
{hamburger, fries, regular soda}.
Find the count and support of {cheeseburger}.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
24
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
25
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
26
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
27
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.    find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
28
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
29
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
30
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
31
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
32
determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
determine whether the binary relation is: (1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
33
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: 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. Find which of the three codes is a primary key. If none of the three codes is a primary key, explain why.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
34
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
35
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
36
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
37
suppose that the transactions at a fast-food restaurant during one afternoon are {hamburger,
fries, regular soda}, {cheeseburger, fries, regular soda}, {apple, hamburger, fries, regular soda}, {salad, diet
soda}, {hamburger, onion rings, regular soda}, {cheeseburger, fries, onion rings, regular soda}, {hamburger, fries},
{hamburger, fries, regular soda}.
Find all frequent itemsets if the threshold level is 0.6.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
38
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
39
If X=( Fran Williams, 617885197, MTH 202, 248B West ) , find the projections If  X=(  Fran Williams,  617885197, MTH 202, 248B West  ) , find the projections
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
40
supp supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.  ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
supp   ose R and S are relations on {a, b, c, d}, where Find the combination of relations.
Unlock Deck
Unlock for access to all 72 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 72 flashcards in this deck.
Unlock Deck
k this deck
42
Let Let   Determine if  R  is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.
Determine if R is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
43
Let https://storage.examlex.com/TB34225555/Let https://storage.examlex.com/TB34225555/ . Determine if  R  is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive..
Determine if R is: (a) reflexive, (b) symmetric, (c) antisymmetric, (d) transitive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
44
The diagram at the right is the Hasse diagram for a partially ordered set. Referring to this diagram: The diagram at the right is the Hasse diagram for a partially ordered set. Referring to this diagram:
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
45
Draw the directed graph for the relation defined by the matrix Draw the directed graph for the relation defined by the matrix
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
46
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
47
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 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.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
49
Find the transitive closure of Find the transitive closure of   if   is  if Find the transitive closure of   if   is  is Find the transitive closure of   if   is
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
50
find the matrix that represents the given relation. Use elements in the order given to determine
rows and columns of the matrix.
find the matrix that represents the given relation. Use elements in the order given to determine rows and columns of the matrix.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
51
Draw the directed graph for the relation defind by the matrix  Draw the directed graph for the relation defind by the matrix
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
52
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 72 flashcards in this deck.
Unlock Deck
k this deck
53
Find the smallest equivalence relation on {1, 2, 3} that contains (1, 2) and (2, 3).
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
54
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}
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
55
What is the covering relation of the partial ordering What is the covering relation of the partial ordering     on the set  {2,4,6,8,10,12} ? on the set {2,4,6,8,10,12} ?
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
56
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 72 flashcards in this deck.
Unlock Deck
k this deck
57
What is the covering relation of the partial ordering What is the covering relation of the partial ordering   on the set  {1,2,3,4,6,8,12,24} ? on the set {1,2,3,4,6,8,12,24} ?
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
58
Suppose A = {2, 3, 6, 9, 10, 12, 14, 18, 20} and R is the partial order relation defined on A where xR y means Suppose A = {2, 3, 6, 9, 10, 12, 14, 18, 20} and R is the partial order relation defined on A where xR y means
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
59
If R = {(x, y) | x and y are bit strings containing the same number of 0s}, find the equivalence classes of (a) 1 (b) 00 (c) 101
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
60
Draw the Hasse diagram for the relation Draw the Hasse diagram for the relation
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
61
Suppose |A| = n. Find the number of symmetric binary relations on A.
Unlock Deck
Unlock for access to all 72 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)}. R is an equivalence relation. Find the equivalence classes for the partition of A given by R.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
63
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)].
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
64
Suppose |A| = n. Find the number of reflexive, symmetric binary relations on A.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
65
Suppose the relation R is defined on the set Z where aR b means that ab ≤ 0. Determine whether R is an equivalence relation on Z .
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
66
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 72 flashcards in this deck.
Unlock Deck
k this deck
67
give an example or else prove that there are none.
A relation on {1, 2, 3} that is reflexive and transitive, but not symmetric.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
68
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 72 flashcards in this deck.
Unlock Deck
k this deck
69
give an example or else prove that there are none.
A relation on {a, b, c} that is reflexive and transitive, but not antisymmetric.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
70
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 72 flashcards in this deck.
Unlock Deck
k this deck
71
Suppose |A| = n. Find the number of binary relations on A.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
72
give an example or else prove that there are none.
A relation on {1, 2} that is symmetric and transitive, but not reflexive.
Unlock Deck
Unlock for access to all 72 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 72 flashcards in this deck.