Which of the following normal forms is achieved when all non-key attributes are fully functionally dependent on the primary key?Question 11Answera.Second Normal Form (2NF)b.Boyce-Codd Normal Form (BCNF)c.First Normal Form (1NF)d.Third Normal Form (3NF)

Which normal form ensures that there are no repeating groups of data and all non-key attributes are fully functionally dependent on the primary key?OptionsFirst Normal Form (1NF)Third Normal Form (3NF)Boyce-Codd Normal Form (BCNF)Second Normal Form (2NF)

Which normal form ensures that there is no non-prime attribute that is transitively dependent on the primary key?a.First Normal Form (1NF)b.Second Normal Form (2NF)c.Third Normal Form (3NF)d.Boyce-Codd Normal Form (BCNF)

Which normalization form eliminates transitive dependencies?Review LaterFirst Normal Form (1NF)Second Normal Form (2NF)Third Normal Form (3NF)Boyce-Codd Normal Form (BCNF)

1. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesA, C, F -> D, EA -> CA, C, F -> B, EF -> A, BA, C -> E, F, GA, F, G -> C, DB, C -> DB -> AThe minimal keys are:{B}{F}{A}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form2. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesF -> E, GA, G -> C, D, EA, B -> FD -> F, GB, E, F -> D, GA, D, E -> B, FB, D, F -> A, EF, G -> B, D, EThe minimal keys are:{D}{F}{A, B}{A, G}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form3. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesB, C, D -> E, GB -> A, ED, E -> CA, C -> B, D, EB -> C, DD, F, G -> AG -> BB, C -> FThe minimal keys are:{B}{G}{A, C}{A, D, E}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form4. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesA, F, G -> CC, F -> GB -> C, FA, D, E -> CE, F, G -> B, CA, B, F -> D, E, GB, C -> A, DA, C, F -> GThe minimal keys are:{B}{C, E, F}{E, F, G}{A, D, E, F}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form5. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesD -> BF -> AB, C, D -> E, FA -> GE, F -> CA, D -> E, FE, F -> GC, F -> A, EThe minimal keys are:{D, F}{C, D}{A, D}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form6. Normal formsWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesC -> EE -> D, GD -> FF -> B, GF -> C, D, EG -> FC -> FC, G -> EThe minimal keys are:{A, E}{A, C}{A, F}{A, G}{A, D}Determine whether these functional dependencies are in the following normal form(s):Boyce Codd normal form

Choose the correct answerWhich one of the following statements about normal forms is FALSE?OptionsBCNF is stricter than 3 NFLossless, dependency–preserving decomposition into BCNF is always possibleAny relation with two attributes is BCNFLossless, dependency-preserving decomposition into 3 NF is always possible