Back to the 2018 paper
Similar questions
Database 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 SystemConsider the relation scheme R = {E, F, G, H, I, J, K, L, M, N} and the set of functional dependencies {{E, F} → {G}, {F} → {I, J}, {E, H} → {K, L}, K → {M}, L → {N}} on R. What is the key for R? (i) {E, F} (ii) {E, F, H} (iii) {E, F, H, K, L} (iv) {E}20192mDatabase 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 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?20227m
PreviousWhich of the following is not an integrity constraint? (i) Not null (ii) Positive (iii) Unique (iv) Check 'predicate'NextExplain the different integrity constraints in database system with the help of example.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.