KETTERING UNIVERSITY
Department of Computer Science
Quiz 1
CS-211 Discrete Mathematics
Spring 2010
1. (5pts) Use truth tables to verify that
(p
I
't
r
~
0
C
0
0
I
:,?
0
,
D \
I 0
~
I
0
I 0
I I
\ I
(p ~ rJ
o
I, ()
I
~
\ I
I
o \I (
lID i
I I \
I
0
I\
o
,!
r
KETTERING UNIVERSITY /0
Department of Computer Science
Quiz 2 NAME R19: (a 1 5%
08-211 Discrete Mathematics
Winter 2009
(Ur-I] 4 [C r/iéll A [fl-:?(UA$:)} A ~32: *?
1. (lOpts) Give a formal proo supplying explanations for each step, for the following
ass
Discrete Mathematics
CPSC-211
Homework 5
Winter 2001
Solution Set
10.3.3. Let S = cfw_1, 2, 3 and R = cfw_(2, 1), (2, 3), (3, 2).
(a) Find the matrices for R and R2 .
0 0 0
0 0 0
R = 1 0 1 , R2 = 0 1 0
0 1 0
1 0 1
(b) Draw pictures of the relations in pa
KETTERING UNIVERSITY
Department of Computer Science
CSle Winter 2009
Midterm Exam 100 Points
M
NAME PXW ' r30")
This is a closed book exam.
/"/J
Answer all questions in the spaces provided on these sheet {
Partial credit will be given, so Show your work!
Discrete Mathematics
CPSC-211
Homework 6
Winter 2001
Solution Set
4.2.2.a. Show that n3 n is a multiple of 6 for all n in P.
We prove by induction over n. The base case is n = 1; n3 n = 13 1 = 0 is a multiple
of 6: 0 6 = 6.
Suppose n3 n is a multiple of 6
KETTERING UNIVERSITY
Department of Computer Science
Quizl NAME R0 (N a
03-211 Discrete Mathematics
Winter 2009
L5 1. (10pts) Use truth Eidersto vegify theL 03211 Quiz 1 -_ 2
2. (15pts) Three students A, B, and C are believed to have cheated on an examinat
KETTERING UNIVERSITY
Department of Computer Science
IJ
Quiz 1
CS-211 Discrete Mathematics
Spring 2008
NAME
r prQ
ICUs
IJ A fA:$ j Nt
/Il!'~ ri
J
2
08-211 Quiz 1
1
3. (lOpts) Use truth tables to verify that
til [(P
I
->
r) i\ (q -:-: r)]v' !
:,
\
j
I
I
I
I
Discrete Mathematics
CPSC-211
Suggested Exercises 2
Winter 2001
Solution Set
10.1.5. Consider R with the usual order .
(a) Is R a lattice? If it is, what are the meanings of a b and a b in R? Yes.
a b = maxcfw_a, b and a b = mincfw_a, b.
(b) Give an examp
Discrete Mathematics
CPSC-211
Homework 4
Winter 2001
Solution Set
3.3.5. Let A = [aij ] and B = [bij ] be matrices in M4,3 dened by aij = (1)i+j and bij = i+j.
Find the following matrices when they exist.
1 1 1 1
(a) AT = 1 1 1 1
1 1 1 1
3 2 5
2 5 4
(b
KETTERING UNIVERSITY
Department of Computer Science
Quiz 2
NAME
HarD)d A/
CS-211 Discrete Mathematics
Spring 2008
t:
1. (lOpts) Give a formal proof, supplying explanations for each step, or the following
assertion:
2
08-211 Quiz 2
2. (15pts) Let A and B
KETTERING UNIVERSITY J I
Department of Computer Science
'l
Quiz 4 ' NAME
CS211 Discrete Mathematics
Winter 2009
I k 1. (15pts) Consider the poset P0 = ({1,2,3,5,6,9,15, 18,45,90},
a) Draw the Hasse Diagrams for P0. V/
/b) Find all of the upper bounds'fo
Discrete Mathematics
CPSC-211
Homework 8
Winter 2001
Solution Set
5.4.4. How many dierent signals can be created by lining up ags in a vertical column if 3
9!
ags are white, 2 are red and 4 are blue? 3!2!4! = 1260.
5.4.6. Find the number of permutations t
KETTERING UNIVERSITY
Department of Computer Science
NAME
Quiz 3
CS-211 Discrete Mathematics
~,-,-(_Q
J_)_A-':':"-J
~:.:.-'C-=-_
Spring 2008
1. (15pts) Let A = cfw_DOD, 001, 010, 100, 101, 011, 110, Ill, the set of stri gs of Os and Is of
length three. Co