Back to the 2024 paper
Similar questions
Database Management SystemRelation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (i) Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist?20227mDatabase Management SystemYou are given the following set F of functional dependencies for a relation: R(A, B, C, D, E, F): F = {ABC → D, ABD → E, CD → F, CDF → B, BF → D} (i) Find all keys of R based on these functional dependencies. (ii) Is this relation in Boyce-Codd normal form? Is it 3NF? Explain your answer. (iii) Can the set F be simplified (by removing functional dependencies or by removing attributes from the left-hand side of functional dependencies) without changing the closure of F (i.e. F+)?20199mDatabase Management SystemCompute the closure of the following set F of functional dependencies for relation schema: R = (A, B, C, D, E). A → BC, CD → E, B → D, E → A List the candidate keys for R.20195mDatabase Management SystemCompute the closure (F+) of the following set of functional dependencies for the relational schema (A, B, C, D, E) = R. List the candidate keys for R: A → BC CD → E B → D E → A202014m