A functional dependency XY is trivial if. (A)X>ay (C)xX>y (B) Yax (D)X>Y Consider the relation R(ABCD) with FD set Ft ABCD,C->A,D-B}. Which of the following is False? (A) CA isa partial dependency (B) CA isa transitive dependency (© D> Bisa partial dependency (D) All of these Which of the following statements is/are false? (A)Normal forms are defined to test the redundancy level of relation schemas in Order to ensure good database design 'S represented in soy relations resulting after Position (D)None of these INF was defined to disallow (A) multi-valued attributes (B) composite attributes (C) both (A) & (By ()none of these Let R(ABCDE)be a relational schema & FIABSCDABC SEC. 5} be the set of ‘functional dependencies, highest normal form of R? 2NF (C)3NF (D)BCNF is the (INF @) EXERCISE-I 6. Let R(ABCDE) be a relational and F={AB > CD, ABC Ec be the set of functional dey Schema >A dependences 1, rhumber of candidate keys ig (A)1 (B)2 ©3 (D)4 Every binary relation is in form (A) INF but not in 2NF (8) 2NF but not in 3NF (©) 3NF but not in BCNF () BCNF Consider ABC 123 2 a3 533 Wich ofthe following dependencies docs ot hold in R? AsB ®)BC>4 (©B>c into BONP as '(4B)R3(BC)R, (cp) eason(r): RuRaR, decomposition are lossless Which of the ; following is true P to the iven ion. Feasoning statements ae assertion. (A)Both (a) @)and ( are false ©)G)is true but @ ig false Find out the set of ich, the ret, : 2 Telatic R(ABcD) 'Sin2NF but notin ap “nmcae 12. 13. (A) {AB CD, A605} (BH {AB>CD,BCC 5H, A (2) (AB CD.C4D, DI Ac} (D) {ABCD BE-> p} »D) ies (FF) as, ADB, CoD.ESFBS } The highest normal form of the above (A)INF (B)2NF (C)3NF (D)BCNF The decomposition of R into 3NF is (A) (ADC)(DBEF) (B) (ABCD)(BEF) (© (ADC)(DB)(BE)(EF) (D) None of these Consider a relation R(ABCD) with the FD set F=(AB,B>C,C3D,D>A}, ‘The number of candidate keys for the above relation is__ (Al (B)2 ©3 (D4 Common Data Questions: 14 & 15 Consider relation R with set functional dependencies (F) as: R(ABCDE)F ={A>C,B>D, ABE} |. The highest normal form of above relation is, (A)INF (B)2NF (C)3NF (D)BCNF FR is decomposed into R, (ABE), (AC),R3(BD) then the decomposition is in (A) INF but not in 2NF (B) 2NF but not in (C)3NF but not in BCNF (D)BCNF 16, 7. 18. 19. 20. cs. Let R(ABCD) be a relationalschema and {A> BC,C D} Identify the highest normal form of R. (A)INE (B)2NF (C)3NF — (D)BCNF Consider relation R (ABCD) with set of functional dependencies (F) as: P={AB-+CD,C—>A} ‘The given relation is in (A) INF but not in 2NF (B) 2NF but not in 3NF (C)3NF but not in BCNF (D) BCI If every attribute is a candidate key then the table is in (A) INF but not in 2NF (B) 2NF but not in 3NF (C)3NF but not in BCNF (D) BCNF Consider R(ABCD) andF = {A > B,B—>C,C—> D} then the decomposition Rj (AB),R2(BC),R; (CD) is (A) Lossless and also dependency preserving (B) Lossy but dependency preserving (C)Lossy and also dependencies are not preserved (D)Lossless but preserved dependencies are not Consider two sets of functional dependencies given below: F={A-BC,B->A,C>A} G={A>B,B>C,C>A} Then which of the following is true? (A)F covers G (B)G covers F X (C)F & G are equivalent (D)None of these SS TIC om Br pt BO ny pedo Aa ny a n(ej 2. 23. 24, 25. R(ABCD)and F={A—>B,B->C,C->D} (A) INF but notin 2NF ‘The decomposition R,(ABC)&R, (BCD) is (A) Lossless and also dependency preserving (B) Lossy but dependency preserving 26. (C) Lossy and also dependencies are not preserved (D)Lossless but dependencies are not preserved ‘Common Data Questions: 22, 23 & 24 Consider relation R with set functional dependencies (F) as: R(ABCD)and F{AB—>CD,C->A,A->C} The given relation R is in (A) INF but not in 2NF (B) 2NF but not in 3NF . (©)3NF but not in BCNF (D) BCNF If the above relation is decomposed into Ry (CBD),R, (CA) then the relation i (A) INF but not in 2NF (B) 2NF but not in 3NF 28, (C)3NF but not in BCNF (>) BCNF ‘The above decomposition is (A) Lossless and also dependency preserving (B) Lossy but dependency preserving (C)Lossy and also dependencies are not 29. preserved (D)Lossless but dependencies are not preserved Consider a relation R (ABCDE) with set of functional dependencies (F) as: F={A->BCDE,B>C,D>E} The above relation is in Soy . Consider relation schema R with set (B) 2NF but not in 3NF (C)3NF but not in BONE (D) BCNF Consider relation ‘schema ; R with funciona depensences eax" | R(aBcD)aar=[4> BBC. Doral The decomposition of R into R,(AB),R2(BC),R, (CD)is (A) Lossless and also dependency, B) Lossy but dependency preserving (©) Lossy and also dependencies are aq preserved (D)Lossless but dependencies are, preserved functional dependencies (F) as: R(ABCD) andF {A -»BC,B->CD,C-4} ‘The numbers of candidate keys are I 2 (3 4 Consider relation schema R with set functional dependencies (F) as: R(ABCD) andF{A > B,B->C,C>A} ‘The number of candidate keys is @! @2 ©3 wes Consider relation schema R- with st functional dependencies (F) /AB->CDE, (aBCDe) tee ee ‘The above relation is in (A) INF but not in 2NF (B) 2NF but not in 3NF (©)3NF but not in BONF (D) BCNF REF ny Tana Lara Sao POS, Ra pte is ae a oA a a WA POT. n