Foundations of Discrete Mathematics
COT 2104
Summer 2008
Homework 3
NOTE: This homework will be collected in three stages. The corresponding
deadline appears before each set of questions. The final grade of this homework will
covered the results of the th

Foundations of Discrete Mathematics
COT 2104
Summer 2008
Instructor: Dr. Dalia M. Gil, Ph.D.
Email: dgil2@atlas.valenciaccl.edu
Site: http:/frontdoor.valenciacc.edu/?dgil2 or
Students Services\Faculty Frontdoor Only\Gil, Dalia\http:/frontdoor.valenciacc.e

COT 2104
Homework Assignment 1 (Answers)
1) Classify true or false
4 2 + 2 and 7 < 50. False because one of the two statements is false.
4 = 2 + 2 7 < 50. True because both statements are true.
4 = 2 + 2 7 < 50. True because both statements are true
4 2 +

COT 2104
Foundations of Discrete Mathematics
Practice 3 (Answers)
1.
a) cfw_ 0, 3, 6, 9, 12
cfw_3n | n = 0, 1, 2, 3, 4 or cfw_x | x is a multiple of 3 0 x 12
b) cfw_-3, -2, -1, 0, 1, 2, 3
cfw_x | -3 0 x 3 we are assuming that the universe of discourse is

Foundations of Discrete Mathematics
COT 2104
Chapter 8 (Answer_Review)
1. The word algorithm, like so many mathematical terms, has its
origins in the Greek language.
a) True
b) False x
2. The word algorithm is used today as a synonym for procedure.
a) Tru

Foundations of Discrete Mathematics
COT 2104
Chapters 11 & 12 (Answer Review)
1. If G is a tree and H is a subgraph of G, then H must also be a tree if H
is connected.
a. True x
b. False
2. If G is not a tree and H is a subgraph of G, then H must also not

Foundations of Discrete Mathematics
COT 2104
Chapter 10 (Answer Review)
1. A walk in a graph is a trail in which all edges are distinct.
a. True
b. False x
2. A path is a walk in which all vertices are distinct.
a. True x
b. False
3. A trail is a path.
a.

COT2104
Answers Hwk 2 (parts 1 and 2)
1. a) f is not a function because there is no pair with the form (3, _)
b) f is not a function because there is two pairs with the form (1, _)
c) f is a function
2. A : The set of students registered at U of C.
B: The

Foundations of Discrete Mathematics
COT 2104
Chapter 9 (Answer_Review)
1. A pseudograph is like a graph, but it may contain loops and/or
multiple edges.
a. True x
b. False
2. Two vertices are said to be incident if there is an edge joining
them.
a. True
b

COT2104
Review Chapters 3, 4, and 5 (Answers)
Chapter 3
Question
Answer
1
B
2
B
3
A
4
A
5
T
6
B
7
F
8
T
9
T
10
NO
11
NO
12
A
13
YES
14
YES
15
YES
16
T
Chapter 4
Question
Answer
1
T
2
T
3
F
4
F
5
T
6
F
7
T
8
F
9
T
10
F
11
T
12
T
13
T
14
T
15
F
16
T
17
T
18