Scribd
Upload
13 views3 pages

Matdis

Uploaded by

Admin Anak Panah
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
13 views3 pages

Matdis

Uploaded by

Admin Anak Panah
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/ 3

1.

Relation P on set B = { c, e, g, h} is defined as follows :


P = { (c,e), (g,e), (h,c), (h,g), (g,c), (e,h), (h,g) }

Relation Q on set C = (Anggun. Budi. Chika, DWi, Eka, Fajar, Gita) is defined as follows:
Q= (Anggun, Anggun), (Chika, Eka), (Eka, Eka), (Anggun, Chika), (Chika, Anggun),
(Anggun, Eka), (Eka, Anggun), (Chika, Eka). (Eka, Chika), (Budi, Budi), (Gita, Gita),
(Budi, Fajar), (Gita, Budi), (Dwi, Dwi), (Fajar, Fajar), (Dwi, Fajar), (Fajar, Dwi), (Anggun,
GIta)}

a. Complete the following tables of matrix representation Mp and Mq, that represent P and Q
respectively. Note: in Mq, each element in the set C is denoted by the initial letter of their
names.

b. Determine the property of relation P and Q by completíng the following table with "Yes" or
"No".
Relation: Reflexive Irreflexive Symmetric Antisymmetric Asymmetric Transitive

2. Given a Hasse diagram of poset R = (A.) Delow where A= {1,2,3,4,5,6,8,10,12) and (a, b)
E R if and only if aļb.

8 12
| / |
4 6 10
| / | |
2 3 5
\ | /
\ | /
1

i. Determine upper bound and least upper bound of (1,3,6,12) in poset R = (A,I)

ii. Determine lower bound and greatest lower bound of (1,2,4,8) in poset R = (A,| )

ii. Determine whether the maximal and greatest Lower Bound !

iv. [21 Determine whether the minimal and smallest Element !

V. [2] Determine the cardinality of R.

VI. Determine the set B where B A. IBI>2 and (B. l) is a totally ordered set, if exists. Itit
doesn't exist, explain why.
vii. Determine the D dimana A ⊂ D, and (D, I) isa lattice, if exists. If it doesn't exist, explain
why

3. Given the following relations:


P= {(x, y)| factory x produces sparepart y, x denotes factory, y denotes sparepart }
e= {(x,y)| car x uses sparepart y, x denotes car, y denotes sparepart }
R= ((x,y)| factory x produces car y, x denotes factory, y denotes car}
S =(x, y) | customer x buys car y,x denotes customer, y denotes car}
I =l(X, y)| customer x does test drive of car y. x denotes customer, y denotes Car}

a. Format U following U = S U ( C(Q) o R)


b. A relation V is tuple (x,y) defined as “customer y not buy car x and sparepart
produced by factory x”
c. A relation is tuple (x,y) defined as “factory x not produce car y and customer y
test drive car x}

4. A software development project team consists of sİx Programming, When doing their
tasks, the team needs to be assignment must follow these rules:
* Dante may be assigned with Armin or Dante
• Eren may be assigned with Boris, or Connie
* Falco may be assigned with Armin
• Armin may be assigned with Eren, or Connie
* Boris may be assigned with Armin, Dane or Falco
• Connie may be assigned with Eren

a. Draw the graph visualization that programmers: Armin, Boris, Connie, Dante, Eren,
and into small teams of 2 people. The small team was divided same team. vertices are
the programmers. Draw an edge e between two programmers if they may be assigned to
the same team

b. Are the graph bipartit? If yes, show the nartition set. If not, explain why.

C. Give an example of a maximum matching in the graph. Is it also a perfect matching?


Explain

d. Does that graph have a maximal matching with.cardinality less than the maximum
matching? If it does, give an example. If it doesn't, explain why.

5. The following table presents the availability of bus routes. Each terminal is coded as
the following {A,B,C,D,E,F,G,H,I}. If bus route between two terminal exists, then it is
coded 1 the table and 0 otherwise if no bus route !
A B C D E F G H I

A 0 0 0 1 0 0 1 0 1

B 0 0 0 1 0 1 0 0 0

C 0 0 0 0 1 0 0 1 0

D 1 1 0 0 0 1 0 0 1

E 0 0 1 0 0 0 1 0 0

F 0 1 0 1 0 0 0 1 0

G 1 0 0 0 1 0 0 0 0

H 0 0 1 0 0 1 0 0 1

I 1 0 0 1 0 0 0 1 0

a. Draw Visualization of the undirected simple graph that presents the availability of bus
routes between two terminal !

b. Determine the existence of the euler and hamilton path or circuit based on the graph
visualization in question !

c. if terminal A, G, F and I are closed, how many routes that elementary path passing
three terminal ? explain !

You might also like