This preview shows pages 1–2. Sign up to view the full content.
COT3100.01, Fall 2000
Test #1
Print Name: ______________________________
S. Lang
(10/3/2000)
Social Security No.: ________________________
Instruction:
The test is a closedbook, closednotes, and nocalculator test.
The test has 4
pages, 10 questions, and 100 total points.
The last sheet contains the relevant definitions and
theorems from the notes, which you can tear off and use for reference.
In writing your proofs,
you need to show all the steps, and explain each by using the appropriate definition or theorem,
by either stating the name, stating the actual contents, or giving its reference number as shown on
the reference sheet.
Also, be aware that the subset notation
⊂
used in the test questions means “a
subset of or equal to”, which is denoted
⊆
in the text.
Your signature below indicates you have
read and understood this instruction.
Signature: ______________________________________
Part I.
(42 pts.) True/False questions.
(No explanation is needed.)
1.
Let
A
,
B
,
C
denote arbitrary finite sets.
Answer each of the following True/False questions:
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '09

Click to edit the document details