628 views
0 votes
0 votes

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?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Gate Fever asked Jan 8, 2019
472 views
Assume G is a connected planar graph that has 12 vertices and 17 regions.all interior regions are bounded by a cycle of length 3(ie 3 edge).find the number of edges bound...
0 votes
0 votes
0 answers
2
Gate Fever asked Jan 8, 2019
213 views
consider a simple graph G with k components.If each component has n1,n2,.....nk vertices,then the maximum number of edges in G is
1 votes
1 votes
0 answers
4
Gate Fever asked Jan 3, 2019
489 views
If A=$\begin{bmatrix} 1 & 2\\ -1& 3 \end{bmatrix}$then $\ A^{6} -4A^{5}+8A^{4}-12A^{3}+14A^{2}$=?a)0b)4Ac)4A+5Id)-4A+5Iam gettind d