| Name (PRINTED): |
|
| Student ID #: |
|
| Section # (or TA's: |
|
| name and time) |
|
|
CMSC 250 |
Quiz #11 |
Monday, Nov. 19, 2001 |
|
Write all answers legibly in the space provided. The number of points
possible for each question is indicated in square brackets - the total
number of points on the quiz is 30, and you will have exactly 15 minutes
to complete this quiz. You may not use calculators, textbooks or any other
aids during this quiz.
- [10 pnts.] Let
and let
.
Let
be defined by
Explicitly state the elements of
.
ANSWSER:
GRADING:
-1 for any one element of the set missing
-1 for any that are there that shouldn't be to a max of -10
- [10 pnts.] Indicate with a ``YES'' or ``NO'' in each blank
if the following relations are
Reflexive, Symmetric, and/or Transitive.
Assume all are relations over the set
.
GRADING:
-1 for each incorrect answer (or blank answer)
-1 if didn't use yes and no
-
- YES Reflexive
- YES Symmetric
- NO Transitive
-
- NO Reflexive
- NO Symmetric
- YES Transitive
-
- YES Reflexive
- YES Symmetric
- YES Transitive
- [10 pnts.] Let
and let
be defined as
Give the list of the elements in the set R' (the transitive closure of R).
ANSWER:
or
GRADING:
up to -5 for missing elements that were in R
-3 if the (1,2) is not added
-2 for anything else added
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 quiz11ans.tex
The translation was initiated by Deep Saraf on 2001-11-29
Deep Saraf
2001-11-29