CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
QUESTION: TRUE or FALSE A tree is a
graph. Answer: TRUE
Theorem 5.3: A tree with n vertices has exactly n – 1 edge s . Chapter 5.1
QUESTION: How many edge s are there in a tree with 14 vertice s ? Choos e one answer.
a. 10 b. 13 c. 14 d. 15 e. none of the
above Answer: n – 1 = 14 – 1 = 13
(b)
Counting. Chapter 1.2
QESTION: If there 5 se ctions of Discrete Math with a total enrollment of 31 students,
what is the smallest possible number of students in the section with the
large st enrollment?
Answer: 7 students (31/5 = 6.2 round up to the nearest whole number of students)
Chapter 2.2 Definition
A relation R on a set S may have any of the following special properties.
(1) If for each x in S, x R x is true, then R is called reflexive.
(2) If y R x is true whenever x R y is true, then R is called symm etric.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
,CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
(3) If x R z is true whenever x R y and y R z are both true, then R is called transitive.
QUESTION: Determine which of the reflexive, symm etric, and transitive properties are satisfied b
the given
relation R defined over set S. Se e Definition for the definition of reflexive, symm e
tric, and transitive properties. S={ 1, 2, 3 } and R={(1,1), (1,2), (2,1), (2,2)}
Answer: The relation is symm e tric becaus e x R y implies y R x.
It is not reflexive, however, because 3 R 3 is false.
The relation is transitive sinc e x R y and y R z implies x R z.
Two compound states are called logically equivalent if they have the same truth values
for all possible truth values of their component statem e nt variables. A.2
QUESTION: Is it true that the following 2 statem e nts are logically equivalent? Explain.
(A) If it rains, then my sho e s get wet.
(B) If my sho e s get wet, then it rains.
Answer: False, If P then Q, does not If Q then P. Student can use Truth table to show it.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
, CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
Theorem 4.1: In a graph, the sum of the degre e s of the vertice s equals twice the
number of edge s . Vertices = dots
Edges = lines
Preorder Traversal: The first depth first traversal method we consider is called
preorder traversal . Preorder
traversal is defined recursively as follows. To do a preorder traversal of a general tree:
Chapter 5.5.
1. Visit the root first; and then
2. do a preorder traversal each of the subtree s of the root one by one in the order given.
Preorder traversal gets its name from the fact that it visits the root first. In the cas e of a
binary tree, the algorithm becom e s :
1. Visit the root first; and then
2. traverse the left subtree; and then
3. traverse the right subtree.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
QUESTION: TRUE or FALSE A tree is a
graph. Answer: TRUE
Theorem 5.3: A tree with n vertices has exactly n – 1 edge s . Chapter 5.1
QUESTION: How many edge s are there in a tree with 14 vertice s ? Choos e one answer.
a. 10 b. 13 c. 14 d. 15 e. none of the
above Answer: n – 1 = 14 – 1 = 13
(b)
Counting. Chapter 1.2
QESTION: If there 5 se ctions of Discrete Math with a total enrollment of 31 students,
what is the smallest possible number of students in the section with the
large st enrollment?
Answer: 7 students (31/5 = 6.2 round up to the nearest whole number of students)
Chapter 2.2 Definition
A relation R on a set S may have any of the following special properties.
(1) If for each x in S, x R x is true, then R is called reflexive.
(2) If y R x is true whenever x R y is true, then R is called symm etric.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
,CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
(3) If x R z is true whenever x R y and y R z are both true, then R is called transitive.
QUESTION: Determine which of the reflexive, symm etric, and transitive properties are satisfied b
the given
relation R defined over set S. Se e Definition for the definition of reflexive, symm e
tric, and transitive properties. S={ 1, 2, 3 } and R={(1,1), (1,2), (2,1), (2,2)}
Answer: The relation is symm e tric becaus e x R y implies y R x.
It is not reflexive, however, because 3 R 3 is false.
The relation is transitive sinc e x R y and y R z implies x R z.
Two compound states are called logically equivalent if they have the same truth values
for all possible truth values of their component statem e nt variables. A.2
QUESTION: Is it true that the following 2 statem e nts are logically equivalent? Explain.
(A) If it rains, then my sho e s get wet.
(B) If my sho e s get wet, then it rains.
Answer: False, If P then Q, does not If Q then P. Student can use Truth table to show it.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
, CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
Theorem 4.1: In a graph, the sum of the degre e s of the vertice s equals twice the
number of edge s . Vertices = dots
Edges = lines
Preorder Traversal: The first depth first traversal method we consider is called
preorder traversal . Preorder
traversal is defined recursively as follows. To do a preorder traversal of a general tree:
Chapter 5.5.
1. Visit the root first; and then
2. do a preorder traversal each of the subtree s of the root one by one in the order given.
Preorder traversal gets its name from the fact that it visits the root first. In the cas e of a
binary tree, the algorithm becom e s :
1. Visit the root first; and then
2. traverse the left subtree; and then
3. traverse the right subtree.
CS208 FINAL EXAM STUDY GUIDE QUESTIONS AND ANSWERS
BEST EXAM SOLUTIONS GUARANTEED SUCCESS LATEST
UPDATE 2021/2022 RATED A+
