Register

rc test series

1,439 views
0 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.

Voting & Accepting an answer helps improve the community
← Previous · ME TestNext → · Median
← Previous in category · Database Dependency ...Next in category → · DBMS transaction
Position:
Show:

Related questions

0 0 votes
0 0 answers
663
663 views
Gate Fever asked Jan 8, 2019
663 views
rc test
Let G be a graph with 100 vertices numbered from 1 to 100. Two vertices i and j are adjacent if $\left | i-j \right |=8 $ or $\left | i-j \right |=12$the number of conn...
0 0 votes
0 0 answers
924
924 views
Gate Fever asked Jan 8, 2019
924 views
rc test series
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 0 votes
0 0 answers
491
491 views
Gate Fever asked Jan 8, 2019
491 views
rc test series
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
0 0 votes
0 0 answers
471
471 views
Gate Fever asked Jan 8, 2019
471 views
rc test series
A graph is said to be 2 colorable if each vertex can be colored either red or blue and no two vertices of the same color are connected by an edge.If some graph is not 2 c...