MAT2612/101

16.2 Self assessment task B

SELF ASSESSMENT TASK B
Chapters 5 and 6 of KBR

1. Consider the following relations on the set A = {1, 2, 3, 4, 5} .

(a) R1 = {(1, 1) , (2, 1) , (3, 3) , (3, 2) , (4, 4)}

(b) R2 = {(1, 1) , (2, 2) , (3, 2) , (4, 4) , (5, 2)}
(c) R3 = {(1, 5) , (2, 5) , (3, 3) , (4, 2) , (5, 1)}

State, with reasons, for (a), (b), (c) whether the relation is:

(i) a function from A to A. (1 each)

(ii) an onto function. (1 each)
(iii) a one-to-one function. (1 each)
(iv) an everywhere defined function. (1 each)

1
2. Let f : R → R be f (x) = √ .
x +4

(a) Is f everywhere defined? If not, give the domain. (3)

(b) Is f onto? If not, give the range. (3)
(c) Is f one-to-one? Explain. (3)
(d) Is f invertible? If so, what is f −1 ? (3)

3. Let f : A → B be an onto function and g : B → C be a 1 − 1 function. Must g ◦ f be

(a) Onto? (4)

(b) 1 − 1? (4)

Prove or give a counterexample.

4. Let f : A → B be a 1 − 1 function and g : B → C be an onto function. Must g ◦ f be

(a) Onto? (4)

(b) 1 − 1? (4)

Prove or give a counterexample.

37
 5. A computer program does an operation (such as sorting) on sets of numbers. Let f (n) be the
computing time for n numbers. For the following functions, describe what happens to the
computing time when the size of the input set is doubled.
(For example, for f (n) = n, when we double the size of the input set from n to 2n the computing
time also doubles.)

(a) f (n) = 1 (3)

(b) f (n) = 2n (3)
2
(c) f (n) = n (3)
(d) f (n) = 3n . (3)

6. Show using only the definition of O (f ) that

(a) n2 + 9n + 10 is O(n2 ). (5)

(b) 5n is O (n!) . (5)
(c) n! is not O(5n ). (5)

7. In the definition of O, do we need k? In other words, if f is O(g) can we not always choose c
large enough such that |f (n)| ≤ c|g(n)| for n ≥ 0? Explain. (5)

8. Use the rules (and if necessary, the definition) for ordering Θ-classes to arrange the following in
order from lowest to highest
√ (8)
lg n, (lg n)6 , lg nn , n4 , n, 5n3 + n2 , 1n , (1, 001)n , 5n .

9. Comment on the following: f is O(g) means that f (n) is never more than a fixed multiple of
g(n). (4)

10. Let A have 5 elements, and let B have 4 elements.

(a) How many everywhere defined functions are there from A to B? (3)
(b) How many one-to-one functions are there from A to B? (4)

11. Which of the following functions f : Z → Z are permutations of Z?

(a) f is defined by f (a) = a − 4. (4)

(b) f is defined by f (a) = a2 − 2. (4)

12. Let A = {1, 2, 3, 4, 5, 6, 7, 8} . Compute the products (composition) and write them in the form
 
1 2 3 4 5 6 7 8
.

38
 MAT2612/101

(a) (2, 3) ◦ (4, 5, 6) ◦ (1, 4, 5, 7) (3)

(b) (5, 2, 3) ◦ (1, 2) ◦ (3, 4, 6, 7) (3)

13. Let  
1 2 3 4 5 6 7 8
p= .
1 8 4 7 3 6 2 5

(a) Write p as a function, e.g. p (1) = 1, p (2) = ... . (2)

(b) Write p as a product of disjoint cycles of length greater than one. (2)
(c) Write p as a product of non-disjoint cycles of length greater than one. (3)
(d) Write p as a product of transpositions. (2)
(e) Is p an even or odd permutation? (2)
(f) Compute p ◦ p. (2)
(g) Compute p−1 . (2)
(h) Determine the period of p, that is, the smallest positive integer k such that
 
k 1 2 3 4 5 6 7 8
p = .
1 2 3 4 5 6 7 8

(3)
(i) Find a permutation q such that
 
1 2 3 4 5 6 7 8
q◦p = .
2 5 1 6 3 8 7 4

(4)

14. Find a permutation on (1, 2, 3, 4, 5, 6) with period 5. (4)

15. Which (if any) of the following relations on the set

A = {1, 2, 3, 4, 5}

are partial orders? Explain.

(a) R1 = {(1, 1) , (1, 2) , (3, 3) , (3, 2)} . (2)

(b) R2 = {(1, 1) , (2, 2) , (2, 3) , (3, 3), (3, 5), (4, 4), (5, 5), (1, 5) , (5, 2)} . (3)
(c) R3 = {(1, 1), (1, 2) , (2, 2), (2, 5) , (3, 3), (4, 4), (5, 5), (1, 4) , (4, 2) , (5, 1)} . (3)

39
 16. Draw a Hasse diagram of a finite partially ordered set satisfying the following (if possible, if not,
explain why not):

(a) The poset contains three maximal elements and no minimal element. (3)
(b) The poset contains a pair of elements having exactly two upper bounds but no least upper
bound. (4)
(c) The poset contains a pair of elements having a least upper bound but no greatest lower
bound. (4)
(d) The poset contains an element with exactly one complement and an element with 2
complements. (4)
(e) The poset contains exactly 3 incomparable elements. (4)

17. (a) Draw the Hasse diagram of Dn where n = 60. (4)

(b) Explain why Dn for any n is always a lattice. (4)
(c) What are ∨ and ∧ here? (4)
(d) Is D60 a complemented lattice? Explain. (4)
(e) Is D60 a Boolean-algebra? Explain. (4)

18. Consider the set Z of integers. Define

aRb if b = ar

for some positive integer r .

(a) Is R a partial ordering of Z? Prove or explain why not. (5)

(b) Is (Z, R) a lattice? Explain. (4)

19. Chapter dependencies of textbooks is a familiar partial ordering of the chapters in the textbook.
Define A < B if chapter A is a prerequisite for chapter B. Let C be the set of chapters and let
the prerequisites be given by

Class Prerequisites
Chapter 1 None
Chapter 2 None
Chapter 3 Chapter 1
Chapter 4 Chapter 2,3
Chapter 5 Chapter 3
Chapter 6 Chapter 4,5
Chapter 7 Chapter 6
Chapter 8 Chapter 6

(a) Draw the Hasse diagram for the partial ordering of the chapters. (5)
(b) Find all minimal and maximal elements of C. (2)
(c) Does C have a least element or a greatest element? If so, give them. (2)

40
 MAT2612/101

Suppose you want to read the entire book, one chapter a month.

(d) Which choice or choices do you have for your first and for your last chapter? (2)
(e) You want to read chapter 6 as soon as possible. How many months before you can? (4)
(f) You want to read chapters 1, 2, 3 in order and chapter 8 last. Find all possible ways that
you could read the book. (4)

20. Draw the Hasse diagram of the poset represented by the following matrix. (Call the elements
a, b, c, d.) (4)
 
1 1 1 1
 0 1 1 1 
 
 0 0 1 1 
0 0 0 1

21. Say for each of the posets represented by the given Hasse-diagram whether the poset is

(i) A lattice (3 each)

(ii) A complemented lattice (3 each)
(iii) A Boolean algebra. (3 each)
a
a) b) a
c)
a b

b c

c d b d

41
 d) a e) a f) a

b c
c
b c

b d
d e f

d e
g h
e
f

22. For the following Hasse diagram, do each of the following. If any do not exist, explain why.

a b

d e f g

i j

(a) Find the maximal elements. (2)

(b) Find the minimal elements. (2)
(c) Is there a greatest element? If so, what is it? (2)
(d) Is there a least element? If so, what is it? (2)
(e) Find all lower bounds of {g, e} . (3)
(f) Find all upper bounds of {e, j} . (3)
(g) Does {h, g} have a LUB? If so, what is it? (3)
(h) Does {i, f } have a GLB? If so, what is it? (2)

42
 MAT2612/101

23. Construct the truth table for the following Boolean function:

f (x, y, z) = (x ∧ z) ∨ (x ∧ y ∧ z 0 ) ∨ x 0 ∧ y .

Write it in the form:

x y z f (x, y, z)
0 0 0 ?
0 0 1 ?
0 1 0 ?
0 1 1 ?
1 0 0 ?
1 0 1 ?
1 1 0 ?
1 1 1 ?
(5)

24. Use a Karnaugh map to simplify the following Boolean expression:

(x 0 ∧ y 0 ∧ z 0 ) ∨ (x 0 ∧ y 0 ∧ z) ∨ (x ∧ y 0 ∧ z 0 ) ∨ (x 0 ∧ y 0 ∧ z).

(6)

43