|
CMSC 250 |
Quiz #12 KEY |
Monday, Dec. 3, 2001 |
|
- [18 pnts.] For each of the following, give the new relation
requested. Make sure to use the representation specified to show the
relation.
- Let R be a relation on the set
where R is defined as
.
Give the transitive closure of R using the MATRIX notation.
ANSWER:
GRADING:
9 points possible
-2 for each 1 or 0 out of place to max of -9
or -4 if correct relation given, but did used digraph or set notation form
(more off in addition to the -3 for any incorrect entries in the relation)
The labels I have put here on the rows and columns are not necessary.
- Let P be a relation on the set
where the Matrix representation
of the relation P is
Give the matrix representation of X where X is the
symmetric closure of P.
ANSWER:
GRADING:
9 points possible
-2 for each 1 or 0 out of place to max of -9
or -4 if correct relation given, but did used digraph or set notation form
(more off in addition to the -3 for any incorrect entries in the relation)
- [12 pnts.] Write a ``YES'' or ``NO'' in each blank
to indicate if the relation described has the listed property.
- Let M be a relation on the set
where
.
- YES Reflexive
- NO Symmetric
- NO Transitive
- NO Irreflexive
- NO Antisymmetric
- NO Asymmetric
- Let N be a relation on the set of
where
- NO Reflexive
- NO Symmetric
- NO Transitive
- YES Irreflexive
- YES Antisymmetric
- YES Asymmetric
GRADING:
1 point per blank (12 blanks - 12 points)
This document was generated using the
LaTeX2HTML translator Version 99.1 release (March 30, 1999)
Copyright © 1993, 1994, 1995, 1996,
Nikos Drakos,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999,
Ross Moore,
Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -show_section_numbers -split 0 -no_navigation -no_footnode quiz12ans.tex
The translation was initiated by Deep Saraf on 2001-12-12
Deep Saraf
2001-12-12