Scanned by CamScanner
00
.
/
Y
;
\
Vx
P9 \
k
_a


,
s
.
m

Je d
l
tvp
r
O S
em w
a
E
nv
i
k
w
0
w
w
*
t $o+
_

rm
wi n h
Scanned by CamScanner
:
:
k
&
_
w
.
\ t


.
.
.
wa
<)
P
,
I
R in
.
P
b :
+
,
:
t l
n
1
*L
1
w w
h
S
."
e
y
J
.
<
1.2
Consistent should not contain conflicting requirements that could be used to derive
contradiction
IE:
The diagnostic message is stored in the buffer or it is retransmitted.
The diagnostic message is not stored in the buffer.
If the diagnostic message
CSCI 2610 Homework Assignment 9
3/25/15
Chapter 6
Section 1
26. How many strings of four decimal digits
a) do not contain the same digit twice?
Answer: 5040
b) end with an
A mathematics proof is a verification of a propostion by chain of logical deductions from
a set of axioms.
Propostion: statement that either true or false, we may not know which one bu it has to
be one or the other
Axioms: are the same thing as propositio
CSCI 2610, Spring 2016
HW#5
Due: April 28, 2016 (hardcopy in class)
1) Review chapter 5.1 on Mathematical Induction and solve the following exercises (page
329 to 331 of the textbook). (35 points)
Question 4a, b, c, d, e (10 points)
Question 6 (5 points)
Ref:
Day 7 Shortest Path Algorithm
www.myteacherpages.com
Suppose you have five towns surrounding you. You determine the amount of
time it takes between certain cities on connecting oneway roads. You would
like to determine the shortest path from your to
CSCI 2610, Spring 2016
Due: Feb 23, 2016 (hardcopy in class)
1. Review chapter 2.1 and solve the following exercises (page 125 and 126 of the textbook).
Question 2 a, b (6 points)
Question 4 a, b, c (8 points)
Question 10 a, b, c, d, e, f, g (14 points
CSCI 2610, Spring 2016
Due: Feb 1, 2016 (hardcopy in class)
1. Review chapter 1.1 on Propositional Logic and solve the following exercises (page 13 to 16 of
the textbook). (60 points)
Question 8 c, f (8 points)
Question 10 b, g (8 points)
Question 16 a
CSCI 2610, Spring 2016
HW#4
Due: Mar 14, 2016 (hardcopy in class)
1. Review chapter 2.3 on Functions and solve the following exercises (page 152 to 155 of the
textbook). (46 points)
Question 2a, b, c
(8 points)
Question 8f, g, h
(8 points)
Question 12a, b
CSCI 2610, Spring 2016
Due: Feb 11, 2016 (hardcopy in class)
1. Review chapter 1.4 on Predicates and Quantifiers, and solve the following exercises (page
53 to 57 of the textbook). (45 points, each 5 points)
Question 8 a, d
Question 10 a, d
Question 12
Discrete Probability
DISCRETE MATH
CSCI 2610  CHAPTER 7
Chapter Summary
Introduc8on to Discrete Probability
Probability Theory
Bayes Theorem
CSCI 2610  CHAPTER 7
2
Why do we study probability?
Anything that happens in life is uncertain !
INDUCTION AND
RECURSION
D I S C R E T E M AT H
CSCI 2610  Chapter 5
CHAPTER SUMMARY
Mathematical Induction
Recursive Definitions
Structural Induction
Recursive Algorithms
CSCI 2610  Chapter 5
2
MATHEMATICAL
INDUCTION
SECTION 5.1
CSCI 2610  Chapter
Scanned by CamScanner
\
I
l
L
\
L
,
\
\
;
\
.
.
.
93
/
/
j
/
L
f
/
/
+
s a
an u

.
4
F
:
j
w
j
=
1
Scanned by CamScanner
T
j l
; l
.
c
M p.
.
o
R
cecfw_
L 1
o
.
\
1
u k
a i
m
!
B
0
lmn n l
!
\m
<
t5
h
:
,
0
Scanned by CamScanner
l
L
.
r
q
C S C I 2 6 10
Feb
P
1
be
a
.
u t,
I
. E
.
Yo
t
u r
A
n a a Ja e
,
B
s u rj e c t iv e
L e
,
a
n
o n
t h e
d c
f u n c t io n
be
p a p e r
be
se t s
Sh o
.
&
.
w
E
.
W
.
L
et
t h a t
l
, n ie n t
9
0
o
1 8
c l e a r l y
:
f
Sp r
,
r u a r y
r it e
A
f

CSCI 2610 TEST 1 STUDY GUIDE
Major concepts and important nit picky points (so basically everything and anything
you can think of)
Chapter 1  The Foundations: Logics and Proofs
Section 1.1
: Propositional Logic
Propositions
Proposition declarative sent
CSCI 2610  List of topics for the final exam (Spring 2016)
Logic
Tautologies, Contradictions and logical equivalences
Predicates and Quantifiers
Rules of Inference
Proofs
Sets, Functions, Sequences and Sums
Sets, Subsets & Proper sets
Cardinality & Power