mth2102 Tutorial9 PDF

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

MTH2102 Discrete Mathematics

Tutorial 9
1. Let A = {1, 2, 3, 4, 5}, and let R be the relation on A defined as follows:
R = {(1, 3), (1, 4), (2, 1), (2, 2), (2, 4), (3, 5), (5, 2), (5, 5)}
(a) Write down the matrix representation of R
(b) Draw the graphical representation of R.
2. Let R be the relation on {a, b, c, d} defined by the following matrix:

a b c d
a 1
b 0
c 0

d 0

0
1
1
0

1
1
1
0

0
0
0

(a) Draw the graphical representation of R.


(b) State, giving reasons, whether R is reflexive, symmetric or transitive.
3. Determine whether each of the following relations is reflexive,
irreflexive, symmetric, antisymmetric or transitive:
(a) is a sibling (brother or sister) of, on the set of all people;
(b) is the son of, on the set of all people;
(c) is the same sex as, on the set of all people;
(d) is greater than, on the set of real numbers;
(e) the relation R on the set of real numbers, defined by x R y if x2 = y2
(f) has the same integer part as, on the set of real numbers;
(g) is a multiple of, on the set of positive integers
4. Determine which of the relations in question 3 are equivalence relations. For
those that are equivalence relations, describe the equivalence classes.
5. A computer program consists of five modules: M1 , M2 ,M3 , M4 , M5.
A relation R on the set of modules is defined by the rule Mi R Mj if Mi is in the
calling sequence of Mj .The relation matrix for R is shown below:

M1
M2
M3
M4
M5

M1

M2

M3

M4

M5

1
0
0
0
0

0
1
0
0
0

1
1
1
1
1

1
0
0
1
1

0
0
0
0
1

(a) Verify that R is reflexive, antisymmetric and transitive.


(b) Which module is the main program?

You might also like