Back to the 2025 paper
Similar questions
Database Management SystemWhich of the following is true? (i) Every relation in 3NF is also in BCNF (ii) A relation R is in 3NF if very non-prime attribute of R is fully functionally dependent on every key of R (iii) Every relation in BCNF is also in 3NF (iv) No relation can be in both BCNF and 3NF20192mDatabase Management SystemWhich of the following is true? (i) a super-key is always a candidate key. (ii) every 3NF schema is also a BCNF. (iii) generalization is bottom-up approach. (iv) none of these.20222mDATABASE MANAGEMENT SYSTEMA normal form in which every non-prime attribute is fully dependent on prime attribute is - (i) 1 NF - (ii) 2 NF - (iii) 3 NF - (iv) BCNF20237mDatabase 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 query is best solved using division operation? (i) Find students enrolled in DBMS (ii) Find students enrolled in all courses (iii) Find students with marks >80 (iv) Find students from CSENextSuppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The decomposition is lossless if: (i) B \rightarrow A or B \rightarrow C (ii) A \rightarrow B (iii) A \rightarrow C (iv) C \rightarrow B