CS 2620
HW 1
DUE: Thursday, September 6th, 2012
1. Construct the truth table for [(p q) (~r p)] [~(r q)]
2. Write the negation of
a. Art is smart or Kate is not a CS major.
b. If John gets an A in CS 2620, then he would get his dream job.
c. Today is Thur
Retrieve the names of all employees in department 5
who work more than 10 hours per week on the
ProductX project.
p10ssn ( essn ( hours > 10 (works-on |X| pno =
pnumber( pnumber ( pname = ProductX (project)
lname, minit, fname ( dno = 5 (employee |X| ssn
'11 m. (inauad.
s ; _ ' .
L 3
$439., mm. mm a um: gt!
J}- TN» W 313ftZAA; SQgQaayoa-m 0W2
ICQVSWWC. m
_
2 i
I G. {Li-D Art «'5 "nut. BMQXL 2.8:. KRTQ (5. 0- QS M499}
*ij Jam 35.23;: as. Q an Q5292.» anti Shy.
«mt. grmdxu gm, sh L019
mmmxaav :3 w. wag
cs 2620 Test 2 4/3/14 NAME: I 00m Geoclgiucbwt
Total points: 103
PleasePrint
YOU MUST SHOW ALL OF YOUR WORK TO GET CREDIT.
1. Prove, using the PMI, that (10 points)
i+L+m+ 1 =i for all positive integers 11.
1-2 2-3 n(n+1) n+1
BORE! Silki Y\ : L
Trees
Chapter 11
Introduction to Trees
Section 11.1
Trees
Definition:Atreeisaconnectedundirectedgraphwithno
simplecircuits.
Example:Whichofthese
graphsare
trees?
Trees (continued)
Theorem:Anundirectedgraphisatreeifandonlyifthere
isauniquesimplepathbetween
Graphs
Chapter 10
Graphs and Graph Models
Section 10.1
Graphs
Definition: A graph G = (V, E) consists of a nonempty set V of vertices (or nodes)
and a set E of edges. Each edge has either one or two vertices associated with it,
called its endpoints. An ed
CS 2620
HW 3
DUE: Thursday, March 13th, 2014.
1. # 6 on page 329
2. Use the P.M. I. to prove that any integer postage from 18 cents on up can be made
using 4-cent and 7-cent stamps.
3. Use the P.M. I. to show that 4 divides (9 n - 5 n ) for any integer no
CS 2620
Homework 5
DUE: April 17th, 2014
1. Is it possible to have an undirected graph with 5 vertices, each of degree 5? If yes, draw such a
graph. If no, state so and provide justification for your answer.
2. An undirected graph has 8 vertices of degree
CS 2620
HW 1
DUE: Thursday, January 30th
1. #36 (e) on page 15. Classify the statement as a tautology, contradiction or
contingency.
2. #12 on page 23
3. #42 on page 24
4. # 24 on page 35
5. # 14 (a, b, and d) on page 53
6. Write the negation of
a. Art is
Symmetric Quiz
1. For p q, assume that p is true, then prove that q must be true.
1.
function
2.
direct proof
3.
relation
4.
indirect proof
2. Denoted by . The statement x P(x) reads "There exists an x in the domain of
discourse such that P(x)."
1.
biject
Power set Notes
power set
The set of all subsets of a set A, denoted P(A). If A = cfw_a, b, then P(A) = cfw_a, cfw_b, cfw_a, b, . The
cardinality of P(A) is 2 raised to the cardinality of A.
cardinality
Denoted | A |, it is the number of distinct elements
CS 2620
8/23/12 Quiz 1
NAME:_
Please Print
1. Construct a truth table for [(p (q r)] [(p q) r]. Classify this statement as a
tautology, a contradiction, or a contingency. (9 points)
p
q
r
T
T
T
T
F
T
F
T
T
F
F
T
T
T
F
T
F
F
F
T
F
F
F
F
2.
Write the conver
7.1 Discrete Probabilty
What is the probability that a card chosen from an ordinary deck of 52 cards is an
ace?
What is the probability that a randomly selected integer chosen from the first 100
positive integers is odd?
What is the probability that the s
CS 2620 A
Fall 2012
Discrete Structures
Catalog Description:
CS 2620 - Discrete Structures
Credits: 3.00
Prerequisite: MATH 1261 or MATH 2261, with a grade of C or better. Propositional and
predicate logic mathematical induction, and recursion. Sets, rela
CS 2620
HW 1
DUE: Tuesday, September 11th, 2012
1. Construct the truth table for [(p q) (~r p)] [~(r q)]
2. Write the negation of
a. Art is smart or Kate is not a CS major.
b. If John gets an A in CS 2620, then he would get his dream job.
c. Today is Thur