This document contains the solutions to a math test from November 29, 2018. It provides instructions for taking the test, multiple choice and fill-in-the-blank questions with answers, and longer response questions showing work for partial and full credit. The document contains the solutions to 10 questions on topics like graph theory, recurrence relations, and equivalence relations.
This document contains the solutions to a math test from November 29, 2018. It provides instructions for taking the test, multiple choice and fill-in-the-blank questions with answers, and longer response questions showing work for partial and full credit. The document contains the solutions to 10 questions on topics like graph theory, recurrence relations, and equivalence relations.
This document contains the solutions to a math test from November 29, 2018. It provides instructions for taking the test, multiple choice and fill-in-the-blank questions with answers, and longer response questions showing work for partial and full credit. The document contains the solutions to 10 questions on topics like graph theory, recurrence relations, and equivalence relations.
This document contains the solutions to a math test from November 29, 2018. It provides instructions for taking the test, multiple choice and fill-in-the-blank questions with answers, and longer response questions showing work for partial and full credit. The document contains the solutions to 10 questions on topics like graph theory, recurrence relations, and equivalence relations.
• No calculators, cell phones or any other electronic devices can be used on this exam.
• Clear your desk of everything excepts pens, pencils and erasers.
• If you need scratch paper, the last page is blank.
• Show all your work unless otherwise indicated. Write your answers clearly! Include enough steps for the grader to be able to follow your work.
• You will be given exactly 60 minutes for this exam.
I have read and understand the above instructions:
. SIGNATURE
Page 1 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
Multiple Choice. Circle the best answer. No work needed. No partial credit available.
1. (5 points) Which of are the following relations on {1, 2, 3} is symmetric?
A. {(1, 2), (2, 3), (2, 1), (3, 2)} B. {(1, 1), (2, 2), (3, 3), (1, 3)} C. {(1, 2), (2, 3), (3, 1)}
2. (5 points) The graph G = (V, E) where
E = {{1, 2}, {2, 3}, {3, 4}, {1, 4}, {2, 4}}
and V = {1, 2, 3, 4} is:
A. a bipartite graph B. NOT a bipartite graph
3. (5 points) If an is the number of bit strings which do not contain four consecutive 0’s, then an satisfies which recurrence: A. an = an−1 + 2an−2 + 3an−3 B. an = an−1 + an−2 + an−3 + an−4 C. an = 2an−1 + 2n−1 D. an = 3an−2 + an−4 .
Extra Work Space.
Page 2 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
Fill in the Blanks. No work needed. No partial credit available.
4. (5 points) If f (1) = 3 and f (n) = f (n/5) + 1, then f (125) = 6 .
5. (5 points) Give an example of a partition of the set {1, 2, x, y, z}:
{{1, x}, {2, y, z}}
6. (5 points) The number of edges in K5 (the complete graph on 5 vertices) is 10 .
Extra Work Space.
Page 3 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
Standard Response Questions. Show all work to receive credit.
7. (15 points) Consider the set Σ∗ of bit strings (i.e. Σ = {0, 1}). Let A ⊆ Σ∗ be the set of bit strings such that any 0 is followed by at least two 1’s. Give a recursive definition of the set A and list all bit strings of length 5 that are in A.
Solution: We can define the set A by the following properties:
• λ∈A
• w1 ∈ A if w ∈ A
• w011 ∈ A if w ∈ A
The bit strings of length 5 in A are:
01111, 10111, 11011, 11111
Page 4 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
8. (20 points) Solve the recurrence relation bn = 72 bn−1 − 32 bn−2 with b0 = 2 and b1 = 3.
Solution: The characteristic equation is
7 3 1 r2 − r + = (r − )(r − 3) 2 2 2 and so n 1 bn = A + B(3)n 2 for some constants A and B. The initial conditions give us
A+B =2 1 A + 3B = 3 2 which implies −5B = −4. So, we see that B = 4/5 and A = 6/5. Therefore n 6 1 4 n bn = + (3) . 5 2 5
Page 5 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
9. (15 points) We consider the relation
R = {(a, b) ∈ Z × Z : a − b = 5k for some k ∈ Z}
on Z. Prove that R is an equivalence relation.
Solution: For any a ∈ Z we have that
a − a = 0 = 5 · 0.
Thus, (a, a) ∈ R and R is reflexive.
Assume that (a, b) ∈ R, then a − b = 5k for some k ∈ Z. Then b − a = −(5k) = 5(−k) and so (b, a) ∈ R since −k ∈ Z. Hence, R is symmetric. Assume that (a, b) ∈ R and that (b, c) ∈ R. This means that
a − b = 5k1 b − c = 5k2
for some k1 ∈ Z and k2 ∈ Z. We then find
a − c = (a − b) + (b − c) = 5k1 + 5k2 = 5(k1 + k2 )
and so (a, c) ∈ R because k1 + k2 ∈ Z. Therefore R is transitive and hence an equivalence relation.
Page 6 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
10. (20 points) Let Wn be the graph with vertex set V = {1, 2, . . . , n + 1} and edge set
E = {{i, n + 1} : 1 ≤ i ≤ n} ∪ {{i, i + 1} : 1 ≤ i ≤ n − 1} ∪ {{1, n}}.
(a) Draw the graph W7 .
(b) Find the chromatic number of W7 .
Solution: The graph W7 looks like
7 2
6 3
5 4
on the left with vertices labeled and on the right with a proper coloring with 4 colors. Since the vertices {1, 2, 3, 4, 5, 6, 7} make an odd length cycle these vertices need at least 3 colors. Since the vertex 8 is connected to all other vertices it needs to be its own color. Therefore we can conclude the chromatic number of W7 is 4
Page 7 of 8 SC/MATH 1019B Solutions to Test 3 Nov. 29th 2018
