Exam 9: Relations
Exam 1: The Foundations: Logic and Proofs200 Questions
Exam 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices214 Questions
Exam 3: Algorithms52 Questions
Exam 4: Number Theory and Cryptography154 Questions
Exam 5: Induction and Recursion53 Questions
Exam 6: Counting156 Questions
Exam 7: Discrete Probability53 Questions
Exam 8: Advanced Counting Techniques128 Questions
Exam 9: Relations74 Questions
Exam 10: Graphs127 Questions
Exam 11: Trees97 Questions
Exam 12: Boolean Algebra77 Questions
Exam 13: Modeling Computation71 Questions
Select questions type
What is the covering relation of the partial ordering
Free
(Short Answer)
4.9/5
(35)
Correct Answer:
{(2, 4), (2, 6), (2, 10), (4, 8), (4, 12), (6, 12)}.
In questions give an example or else prove that there are none.
-
Free
(Short Answer)
4.8/5
(27)
Correct Answer:
If determine if R is:
(a) reflexive
(b) symmetric
(c) antisymmetric
(d) transitive.
Free
(Short Answer)
4.7/5
(41)
Correct Answer:
(a) Yes.
(b) No.
(c) Yes.
(d) Yes.
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)}.
(Short Answer)
4.8/5
(34)
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.
-
(Short Answer)
4.8/5
(28)
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
-
(Short Answer)
4.8/5
(39)
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 .
(Short Answer)
4.8/5
(43)
supp ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
-
(Short Answer)
4.9/5
(41)
Suppose the relation R is defined on the set where aRb means that Determine whether R is an equivalence relation on
(Short Answer)
4.9/5
(32)
Suppwhetherose RR isis thean equivrelationalenceonrelationN whereonaRNb. means that a ends in the same digit in which b ends. Determine
(Short Answer)
4.8/5
(44)
If R= and are bit strings containing the same number of 0s}, find the equivalence classes of
(a) 1 .
(b) 00 .
(c) 101 .
(Essay)
4.7/5
(30)
supp ose R and S are relations on {a, b, c, d}, where
Find the combination of relations.
-
(Short Answer)
4.7/5
(36)
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)] .
(Essay)
4.9/5
(33)
In questions determine whether the binary relation is:
(1) reflexive, (2) symmetric, (3) antisymmetric, (4) transitive.
-
(Short Answer)
4.8/5
(42)
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}) .
(Short Answer)
4.7/5
(34)
In questions find the matrix that represents the given relation. Use elements in the order given to
determine rows and columns of the matrix.
-
(Short Answer)
4.9/5
(33)
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)} .
(Short Answer)
4.8/5
(27)
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
(Short Answer)
4.9/5
(30)
Showing 1 - 20 of 74
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)