Back to the 2022 paper
Similar questions
DATABASE MANAGEMENT SYSTEMFind the highest normal form of a relation R(ABCD) with FD set (B→A, A→C, BC→D, AC→BE).20247mDatabase 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 SystemFor relation R(A,B,C,D,E) functional dependencies are given as follows: * A \rightarrow BC * CD \rightarrow E * B \rightarrow D Find candidate keys.20254mDatabase 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.20195m