Scribd
Upload
209 views8 pages

Math 2200 Practice Test 3

The document contains a practice test with 17 multi-part math questions covering topics like functions, relations, Boolean algebra, graphs, and equivalence relations. The questions involve tasks like drawing arrow diagrams, evaluating functions, determining if functions are one-to-one or onto, simplifying Boolean expressions, finding degrees of vertices in graphs, determining if sequences are walks or circuits in graphs, performing operations on relations, finding powers and compositions of relations represented as matrices, and partitioning a set into equivalence classes.

Uploaded by

Yousif Kashat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
209 views8 pages

Math 2200 Practice Test 3

The document contains a practice test with 17 multi-part math questions covering topics like functions, relations, Boolean algebra, graphs, and equivalence relations. The questions involve tasks like drawing arrow diagrams, evaluating functions, determining if functions are one-to-one or onto, simplifying Boolean expressions, finding degrees of vertices in graphs, determining if sequences are walks or circuits in graphs, performing operations on relations, finding powers and compositions of relations represented as matrices, and partitioning a set into equivalence classes.

Uploaded by

Yousif Kashat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Math 2200 Practice Test 3

1: Draw an arrow diagram for the following function. Give the range of the
function using set notation.
𝑋 = {1 , 2 , 3 , 4 , 5} and 𝑌 = {0 , 1 , 2 , 3 , 4}; 𝑓: 𝑋 → 𝑌 . 𝑓(𝑥) = |𝑥 − 2|

1
2: Define function 𝑓(𝑥) = ⌊𝑥 + ⌋ 𝑓: ℝ → ℤ
2

Compute A: 𝑓(2.2) B: 𝑓(2.5)

C: 𝑓(2.9) D: 𝑓(2)

E: 𝑓(3)
3: For each of the functions given, indicate whether the function is one-to-one,
onto, neither, or both. If the function is not one-to-one or not onto, give an
example showing why.
A: 𝑓: ℝ → ℝ. 𝑓(𝑥) = 𝑥 2

B: Let 𝐴 = {1 , 2 , 3 , 4 , 5 , 6 , 7 , 8} and let 𝐵 = {1}.


𝑓: 𝑃(𝐴) → 𝑃(𝐴). 𝑓(𝑋) = 𝑋 − 𝐵
(Recall that 𝑃(𝐴) denoted the Power Set of 𝐴.)

4: For each of the following functions, indicated whether the function has a well-
defined inverse. If the inverse is well-defined, give the input/output relationship
of 𝑓 −1 .
A: 𝑓: ℤ → ℤ. 𝑓(𝑥) = 𝑥 + 3

B: 𝑓: ℤ → ℤ. 𝑓(𝑥) = 2𝑥 + 3
5: Consider three functions 𝑓, 𝑔, and ℎ whose domain and target are ℤ. Let
𝑥
𝑓(𝑥) = 𝑥 2 ; 𝑔(𝑥) = 2𝑥 ; ℎ(𝑥) = ⌈ ⌉
5

Find
A: 𝑓 𝑜 𝑔(0) B: 𝑓 𝑜 ℎ(52) C: 𝑔 𝑜 ℎ 𝑜 𝑓(4)

6: For each expression, give an equivalent expression that is a power of 6. That is


your answer should have the form 6∗ where ∗ is an expression with numbers and
possibly the variable k.
62𝑘−1
A: (6𝑘 )𝑘 B: C: 36 ∙ 6𝑘
6−𝑘

7: Evaluate the Boolean expression with 𝑥 = 𝑦 = 1 and 𝑤 = 𝑧 = 0.


̅̅̅̅̅̅̅̅
A: 𝑥𝑦̅ + 𝑧(𝑤 + 𝑧)

̅̅̅̅̅̅̅̅̅̅̅̅̅̅
B: 𝑥𝑦̅ + (𝑥̅ + 𝑤 + 𝑦𝑧̅̅̅)
8: Given a table for a Boolean function, write the function as a sum of minterms.

𝒙 𝒚 𝒇(𝒙, 𝒚)
0 0 1
0 1 0
1 0 0
1 1 1

9: Apply the generalized versions of DeMorgan’s law to convert the following


expression to an equivalent CNF expression.
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
𝑥̅ 𝑦̅𝑧̅ + 𝑥̅ 𝑦𝑧 + 𝑥𝑦̅𝑧 + 𝑥𝑦𝑧

10: For the expression below, give an equivalent expression that uses only
Boolean addition and complement operations. Then give an equivalent expression
that uses only Boolean multiplication and complement operations.
𝑥𝑦 + 𝑤(𝑥 + 𝑧)
11: Draw the arrow diagram and matrix representation for the relation.
Domain of relation R is set A = {1 , 2 , 3 , 4}. R = { (1,2) , (2,1) , (3,3) }

12: For each relation, indicate whether the relation is:


i. Reflexive, anti-reflexive, or neither
ii. Symmetric, anti-symmetric, or neither
iii. Transitive or Not transitive

A: The domain of the relation L is the set of all real numbers.


For , 𝑦 ∈ ℝ , 𝑥𝐿𝑦 if 𝑥 < 𝑦.

B: The domain of the relation A is the set of all real numbers.


For 𝑥 , 𝑦 ∈ ℝ, 𝑥𝐴𝑦 if |𝑥 − 𝑦| ≤ 2.
13: Consider the following directed graph.

A: What is the in-degree of vertex d ?

B: What is the out-degree of vertex c?

C: Is 〈𝑎, 𝑔, 𝑓, 𝑐, 𝑑〉 a walk in the graph?

D: Is 〈𝑎, 𝑔, 𝑓, 𝑑, 𝑏〉 a walk in the graph? Is it a path?

E: Is 〈𝑑, 𝑏, 𝑐, 𝑔, 𝑐, 𝑓, 𝑒, 𝑐, 𝑑〉 a circuit in the graph? Is it a cycle?

F: Give an example of a cycle of length 4.


14: Here are two relations on the set {𝑎, 𝑏, 𝑐, 𝑑}:
𝑆 = {(𝑎, 𝑏), (𝑎, 𝑐), (𝑐, 𝑑), (𝑐, 𝑎)}
𝑅 = {(𝑏, 𝑐), (𝑐, 𝑏), (𝑎, 𝑑), (𝑑, 𝑏)}
Write each relation as a set of ordered pairs.
A: 𝑆 𝑜 𝑅 B: 𝑆 𝑜 𝑅

C: 𝑆 𝑜 𝑆 D: 𝑅 𝑜 𝑅

15: The diagram shows a directed graph G

A: Is (a,b) in 𝐺 2 ? B: Is (g,g) in 𝐺 3 ?

C: Is (g,g) in 𝐺 4 ? D: Is (b,d) in 𝐺 5 ?
16: Give the adjacency matrix for the graph 𝐺 given:

Then use matrix multiplication and addition to find the adjacency matrices for
𝐺 2 , 𝐺 3 , 𝐺 4 , and 𝐺 + .

17: The domain of the equivalence relation 𝐷 is the set


𝑆 = {7, 2, 13, 44, 56, 34, 99, 31, 4, 17}.
For any 𝑥, 𝑦 ∈ 𝑆, 𝑥𝐷𝑦 is 𝑥 has the same remainder as 𝑦 when divided by 4.
Show the partition of 𝑆 defined by the equivalence classes of 𝐷.

You might also like