Scribd
Upload
53 views6 pages

Excercises 4 - Questions PDF

This document contains 13 questions about relations and their properties like reflexivity, symmetry, transitivity, and equivalence relations. The questions cover topics such as determining if given relations have certain properties, representing relations with matrices, finding compositions and closures of relations, drawing digraphs of relations, and working with partitions and equivalence relations.

Uploaded by

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

Excercises 4 - Questions PDF

This document contains 13 questions about relations and their properties like reflexivity, symmetry, transitivity, and equivalence relations. The questions cover topics such as determining if given relations have certain properties, representing relations with matrices, finding compositions and closures of relations, drawing digraphs of relations, and working with partitions and equivalence relations.

Uploaded by

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

CS 100 T

First semester of the academic year 1442 H

Exercises 4-Lecture 4

Relations

Prepared by : Dr. Sarah Alhammad


CS 100 T
First semester of the academic year 1442 H

Question#1:

Determine whether each of the following relations are reflexive,


symmetric and transitive:
(i) Relation R in the set A = {1, 2, 3…13, 14}
defined as R = {(x, y): 3x − y = 0}
(ii) Relation R in the set N of natural numbers
defined as R = {(x, y): y = x + 5 and x < 4}
(iii) Relation R in the set A = {1, 2, 3, 4,
5, 6} as R = {(x, y): y is divisible by x}
(iv) Relation R in the set Z of all integers
defined as R = {(x, y): x − y is as integer}

Question#2:

Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R =


{(a, b): b = a + 1} is reflexive, symmetric or transitive.

Question#3:

Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive


and transitive but not symmetric.
Question#4:

Let A = {1, 2, 3} and B = {1, 2, 3, 4}. The relation R1 is on A

and the relation R2 is on B:

R1 = {(1, 1), (2, 2), (3, 3)} and


R2 = {(1, 1), (1, 2), (1, 3), (1, 4)}.

Determine the following relations.


CS 100 T
First semester of the academic year 1442 H

a. R1 ∪ R2

b. R1 ∩ R2

c. R1 − R2

d. R2 − R1

Question#5:

LetR be a relation from {1, 2, 3} to{1,2, 3, 4} and

let S be the relation from {1, 2, 3, 4} to {0, 1, 2} where,

R ={(1,1),(1,2),(2,4),(3,2),(4,3)}

S ={(1,0),(2,4),(3,1),(3,2),(4,1)}

What is the composite of the relations R and S, S ◦ R?


S◦R=

Question#6:

Let P = {2, 3, 4, 5}. Consider the relation R and S on P defined by


R = {(2, 2), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5), (5, 3)}
S = {(2, 3), (2, 5), (3, 4), (3, 5), (4, 2), (4, 3), (4, 5), (5, 2), (5, 5)}.

Find the matrices of the above relations.


Use matrices to find the following composition of the relation R and S.
(i)RoS (ii)RoR (iii)SoR
CS 100 T
First semester of the academic year 1442 H

Question#7:

Represent each of these relations on {1, 2, 3} with a matrix (with the


elements of this set listed in

increasing order).

a {(1, 1),(1, 2),(1, 3)}

b {(1, 2),(2, 1),(2, 2),(3, 3)}

c {(1, 1),(1, 2),(1, 3),(2, 2),(2, 3),(3, 3)}

Question#8:

Draw the directed graphs representing each of the relations

a. {(1, 2),(1, 3),(1, 4),(2, 3),(2, 4),(3, 4)}


b. {(1, 1),(1, 4),(2, 2),(3, 3),(4, 1)}
c. {(1, 2),(1, 3),(1, 4),(2, 1),(2, 3),(2, 4),(3, 1),(3, 2),(3, 4),(4, 1),(4,
2),(4, 3)}

Question#9:

Determine whether the relation represented by the digraph shown below


are reflexive, symmetric, antisymmetric, and/or transitive.

a.
CS 100 T
First semester of the academic year 1442 H

b.

Question#10:

Let R be the relation on the set {0, 1, 2, 3} containing the ordered pairs

(0, 1),(1, 1),(1, 2),(2, 0),(2, 2),(3, 0).

Find a) reflexive closure of R

b) symmetric closure of R

Question#11:

Are these equivalence relations on {0, 1, 2}

(a) {(0, 0),(1, 1),(0, 1),(1, 0)}

(b) {(0, 0),(1, 1),(2, 2),(0, 1),(1, 2)}

(c) {(0, 0),(1, 1),(2, 2),(0, 1),(1, 2),(1, 0),(2, 1)}

(d) {(0, 0),(1, 1),(2, 2),(0, 1),(0, 2),(1, 0),(1, 2),(2, 0),(2, 1)}

(e) {(0, 0),(1, 1),(2, 2)}


CS 100 T
First semester of the academic year 1442 H

Question#12:

Give one possible partition for {1, 2, 3, 4, 5, 6,7,8}

Question#13:

Consider the equivalence relation R induced by the partition

P={{1},{3},{2,4,5,6}}

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

(a) Write the equivalence classes for this equivalence relation. (b) Write
the equivalence relation as a set of ordered pairs.

You might also like