Scribd
Upload
176 views4 pages

Assignment Mod2

This document contains an assignment for a course on data management systems. It includes 14 questions related to relations, properties of relations, number of possible relations, transitive closure, directed graphs, Hasse diagrams, and types of lattices. Students are asked to define terms, check properties of sample relations, calculate the number of possible relations given properties, determine reflexive/symmetric/transitive closures, and identify characteristics of diagrams. The deadline for submission is February 21, 2021.

Uploaded by

Rock V2
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
176 views4 pages

Assignment Mod2

This document contains an assignment for a course on data management systems. It includes 14 questions related to relations, properties of relations, number of possible relations, transitive closure, directed graphs, Hasse diagrams, and types of lattices. Students are asked to define terms, check properties of sample relations, calculate the number of possible relations given properties, determine reflexive/symmetric/transitive closures, and identify characteristics of diagrams. The deadline for submission is February 21, 2021.

Uploaded by

Rock V2
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/ 4

Assignment [Module2]

CSE 208[DMS ][Submission Deadline:21 st Feb ,2021]

Q .1: Define the following : a¿ Identity relation b ¿ Universal relation c ¿ Void relation

Q .2 Let A be a set on integers∧R 1, R 2⊆ A × A where


R 1={(a , b):a<b } and R 2={(a , b):a>b }.
Check whether the following relations satisfy the properties of relations (Write “Yes” or “No”
in the column against each relations)
Note that R 1∪ R 2= {( a , b ) : a<b∨a> b }∧R 1 ∩ R 2=ϕ

Relation Reflexive Symmetric Asymmetric Antisymmetri Transitive


c
R1 no no yes no yes
R2 no no yes no yes
R 1∪ R 2 no yes no no No
R 1∩ R 2 no yes yes yes yes
R1-R2 No no yes no Yes
R2-R1 no no yes no yes

Q.3: Consider a set A with n elements, find the total number of possible relation R (in column
B), if the given relation R as given in Column A.

S. Column A Column B (Total no of possible


No. relations)
2
1. Reflexive 2
n −n

2. Irreflexive 2n2-n
3. Symmetric 2(n2+n)/2
4. Asymmetric 3(n2-n)/2
5. Antisymmetric 2n . 3(n2-n)/2
2 2
6. Either Reflexive or Irreflexive 2n −n +2n −n
7. Both Reflexive and symmetric 2(3n2-n)/2
2
8. Both Reflexive and Antisymmetric n −n
2 .3(n2-n)/2 .2n
2
9. Both Reflexive and Asymmetric 2n −n .3(n2-n)/2
10. Both Irreflexive and symmetric 2(3n2-n)/2
11. Both symmetric and Antisymmetric 2(n2+n)/2 . 3(n2-n)/2 .2n
12. Both symmetric and Asymmetric 2(n2+n)/2 . 3(n2-n)/2
13. Both Antisymmetric and asymmetric 2n . 3n2-n

Q.4: Let S be the relation on the set N of +ve integers, defined by the equation x+3y=13 i.e.
S={(x,y): x+3y=13}. Find the relation S?

Q.5: Find the inverse of the following relations


a) is shorter than b) “is younger than” c) “is child of” d) “is a sibling of”
e) “is parallel to” f) “lies above” g) “is perpendicular to”

Q.6 Consider the following five relations on the set A = {1, 2, 3, 4, 5}:
R1 = {(1, 1), (1, 2), (2,2),(2, 3), (1, 3), (3,3),(4,2),(4, 4),(5,5)}
R2 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
R3 = {(1, 3), (2, 1)}
R4 = Ø, the empty relation
R5 = A X A, the universal relation

Determine which of the relations are


(i) Reflexive (ii) Irreflexive (iii) Symmetric (iv) Asymmetric
(v) Anti-symmetric (vi) Transitive

Q.7 Write Reflexive, Symmetric and transitive closure for the following given relations

Consider A={1,2,3,4 } r(R) s(R) t(R)


R 1={(1,1),( 2,2),(3,3),(3,4)} {(4,4)} {(4,3)} Ø
R 2={(1,2),(2,1) ,(2,3),(3,4) } {(1,1), {(3,2) , {(1,1) , (1,3) ,
(2,2), (4,3)} (2,2) , (2,4) ,
(3,3), (1,4)}
(4,4)}
R 3={(1,2),(3,1) ,(4,3)} {(1,1), {(2,1) , {(3,2) , (4,1) ,
(2,2), (1,3) , (4,2)}
(3,3), (3,4)}
(4,4)}
R3=ϕ {(1,1), Ø Ø
(2,2),
(3,3),
(4,4)}

Q.8: Draw the directed graph of the following relation on a set A={1,2,3,4} and determine
whether the relation is Antisymmetric or transitive or not?
i. R={(1,2)(2,2),(2,4),(3,2),(3,4)(4,1),(4,3)} – not antisymmetric , not transitive
ii. R={(1,1),(2,2),(2,3),(3,2),(4,2),(4,4)(2,4)} – not antisymmetric , yes transitive
iii. R={(3,2),(3,3)(1,3)} – yes antisymmetric , not transitive

Q.10 Let A= {a,b,c,d,e} and let R and S be the relations on A described by

M M

[ ] [ ]
10101 01010
10010 11001
R =¿ 1 0 0 0 0 ¿ S =¿ 1 1 10 0 ¿
00110 01000
10100 01010

Use Warshall’s algorithm to compute the Transitive closure of R ∪S .


Q.12:

Q.13: Consider the following Hasse Diagram and find the following for the given subset B, :

Subset B Minimal Maximal Lower Upper LUB GLB


element Element bound Bound
{a , b , c , d , e , f , g , h} a h a h h a
{b , c , d , e } null null a {f,g,h} null a
{a , b , c } a null a {e,f,g,h} e a
{d , e } null null {a,b} {f,h} f b

Q.14 Determine which of the following Hasse diagram (fig. ‘a’ to fig. ‘g’) represent a lattice?
Give proper reason.
Q.15: Justify which of the following is a Distributive lattice and which one is a complemented
lattice:

*******************************************

You might also like