The first one is easy enough. When we trace the dependencies of F we see that F depends on B and E, so we get something like this:
A->D->B->F C->E->F -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] Sent: Tuesday, April 30, 2002 3:23 PM To: [EMAIL PROTECTED] Subject: Functional dependency I got this problem from a friend and was wondering if anyone could help out. The following is a set of functional dependency for a relation R (A,B,C,D,E,F) with A->D, BE->CDF, C->E, D->B where A->D implies A determines D or D is functionally dependent on A. Questions: 1. Show with explanation that the functional dependency AC->F is implied by the set. 2. Compute the closure(A,C) for the above set. 3. Is the set A,C a super key for the given relation R. __________________ William Ampeh (x3939) Federal Reserve Board -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
