rc test series

Question

Consider the relation R with the following information (A,B,C,D) :-

A	B	C	D
a	b	z	1
e	b	r	1
a	d	z	1
e	d	r	1
a	f	z	2
e	f	r	2

find the total number of FD in above relation (ignore the self FD’s X->X,Y->Y,XY->X,XY->Y etc).

i am getting only 10, but it is wrong;

is there any faster and appropriate technique for this?

Comments

which est series it is ?

---

raman classes

u must haven't heard the name!

they must have copied this question from somewhere!

answer given is 12 btw!!

---

actually there are more number, i mean a huge difference,

I want to see their explanation !

---

By the way, these images may help you !

---

I want to see their explanation !

they dont provide explanation, just answers 

---

ok...

---

If ignoring reflexivity fd's,  then given answer is right

---

yes,they have asked to ignore them!

then should i follow same procedure as u have showed in uploaded image?

or to see each FD satisfied in the table given in ques!

---

yes,they have asked to ignore them!

it is saying only avoid self but not reflexive !

 

then should i follow same procedure as u have showed in uploaded image?

or to see each FD satisfied in the table given in ques!

first form the FD's from Data

A --> C

C --> A

B ---> D

AB ---> CD

then follow the procedure !

---

ok,thanks

---

@Shaik Masthan 

sir is there any trick to find no. of super keys also like u showed for FDs

. if u have some image for that, then pls share!

---

Everyone follows same method,

if you want check this, it may helpful ( pages are damaged, but you can get what there written )

---

thanku so much for sharing!!