Back to the 2019 paper
Similar questions
Database Management SystemA relation is in BCNF if: (i) Every non-prime attribute depends on key (ii) Every FD is trivial (iii) Every determinant is a superkey (iv) Every attribute is atomic20252mDatabase 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 SystemFor relation: R(A,B,C); FDs={A \rightarrow B, B \rightarrow A}. Which statement is true? (i) A and B both are candidate keys (ii) Only A is key (iii) Only B is key (iv) Neither A nor B is key20252m
PreviousA level that describes how a record is stored is: (i) physical (ii) logical (iii) user (iv) viewNextConsider 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}
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.