1. What is Functional dependency ? Junior A. a form in 2NF where no non-key attribute transitively depends on the primary key B. a constraint where one attribute set uniquely determines the values of another C. a dependency where a non-key attribute depends on another non-key attribute D. a form in BCNF that additionally forbids non-trivial multivalued dependencies
2. Which term means: "a constraint where one attribute set uniquely determines the values of another"? Junior A. Boyce-Codd normal form B. Armstrong's axioms C. Functional dependency D. Transitive dependency
3. Which statement is correct? Junior A. Functional dependency — a dependency where a non-key attribute depends on another non-key attribute B. Functional dependency — a form in 1NF where every non-key attribute fully depends on the whole candidate key C. Functional dependency — a constraint where one attribute set uniquely determines the values of another D. Functional dependency — a form in BCNF that additionally forbids non-trivial multivalued dependencies
4. What is First normal form ? Junior A. a stricter 3NF requiring the left side of every non-trivial dependency to be a super key B. a dependency where a non-key attribute depends on another non-key attribute C. deliberately adding redundancy to a schema to improve read performance at the cost of duplication D. a form requiring every attribute to hold only atomic, single-valued, indivisible values
5. Which term means: "a form requiring every attribute to hold only atomic, single-valued, indivisible values"? Junior A. Closure of an attribute set B. Denormalization C. Boyce-Codd normal form D. First normal form
6. Which statement is correct? Junior A. First normal form — a decomposition in which all functional dependencies are still enforceable on individual tables B. First normal form — the full set of attributes that can be functionally determined from a given set C. First normal form — a form requiring every attribute to hold only atomic, single-valued, indivisible values D. First normal form — a constraint where one attribute set uniquely determines the values of another
7. What is Second normal form ? Mid A. a stricter 3NF requiring the left side of every non-trivial dependency to be a super key B. a form in 2NF where no non-key attribute transitively depends on the primary key C. a form in 1NF where every non-key attribute fully depends on the whole candidate key D. the full set of attributes that can be functionally determined from a given set
8. Which term means: "a form in 1NF where every non-key attribute fully depends on the whole candidate key"? Mid A. Fourth normal form B. First normal form C. Second normal form D. Functional dependency
9. Which statement is correct? Mid A. Second normal form — the full set of attributes that can be functionally determined from a given set B. Second normal form — a dependency where a non-key attribute depends on only part of a composite key C. Second normal form — a form in 1NF where every non-key attribute fully depends on the whole candidate key D. Second normal form — a form requiring every attribute to hold only atomic, single-valued, indivisible values
10. What is Third normal form ? Mid A. a form in 2NF where no non-key attribute transitively depends on the primary key B. a sound and complete set of inference rules used to derive all functional dependencies C. a decomposition that lets the original relation be reconstructed exactly by a natural join D. a form in 1NF where every non-key attribute fully depends on the whole candidate key
11. Which term means: "a form in 2NF where no non-key attribute transitively depends on the primary key"? Mid A. Lossless join decomposition B. Third normal form C. Boyce-Codd normal form D. Denormalization
12. Which statement is correct? Mid A. Third normal form — a sound and complete set of inference rules used to derive all functional dependencies B. Third normal form — a form in 2NF where no non-key attribute transitively depends on the primary key C. Third normal form — a decomposition in which all functional dependencies are still enforceable on individual tables D. Third normal form — a form in BCNF that additionally forbids non-trivial multivalued dependencies
13. What is Boyce-Codd normal form ? Senior A. a form in BCNF that additionally forbids non-trivial multivalued dependencies B. the full set of attributes that can be functionally determined from a given set C. a dependency where a non-key attribute depends on only part of a composite key D. a stricter 3NF requiring the left side of every non-trivial dependency to be a super key
14. Which term means: "a stricter 3NF requiring the left side of every non-trivial dependency to be a super key"? Senior A. Boyce-Codd normal form B. Denormalization C. Second normal form D. Armstrong's axioms
15. Which statement is correct? Senior A. Boyce-Codd normal form — a form in 1NF where every non-key attribute fully depends on the whole candidate key B. Boyce-Codd normal form — a stricter 3NF requiring the left side of every non-trivial dependency to be a super key C. Boyce-Codd normal form — a dependency where a non-key attribute depends on another non-key attribute D. Boyce-Codd normal form — a form requiring every attribute to hold only atomic, single-valued, indivisible values
16. What is Fourth normal form ? Senior A. a dependency where a non-key attribute depends on another non-key attribute B. a decomposition that lets the original relation be reconstructed exactly by a natural join C. a form in BCNF that additionally forbids non-trivial multivalued dependencies D. a decomposition in which all functional dependencies are still enforceable on individual tables
17. Which term means: "a form in BCNF that additionally forbids non-trivial multivalued dependencies"? Senior A. Third normal form B. Closure of an attribute set C. First normal form D. Fourth normal form
18. Which statement is correct? Senior A. Fourth normal form — a decomposition in which all functional dependencies are still enforceable on individual tables B. Fourth normal form — a form in 1NF where every non-key attribute fully depends on the whole candidate key C. Fourth normal form — a decomposition that lets the original relation be reconstructed exactly by a natural join D. Fourth normal form — a form in BCNF that additionally forbids non-trivial multivalued dependencies
19. What is Partial dependency ? Mid A. a decomposition that lets the original relation be reconstructed exactly by a natural join B. a dependency where a non-key attribute depends on only part of a composite key C. a dependency where a non-key attribute depends on another non-key attribute D. a decomposition in which all functional dependencies are still enforceable on individual tables
20. Which term means: "a dependency where a non-key attribute depends on only part of a composite key"? Mid A. Functional dependency B. Partial dependency C. First normal form D. Transitive dependency
21. Which statement is correct? Mid A. Partial dependency — a dependency where a non-key attribute depends on another non-key attribute B. Partial dependency — a decomposition in which all functional dependencies are still enforceable on individual tables C. Partial dependency — a dependency where a non-key attribute depends on only part of a composite key D. Partial dependency — a sound and complete set of inference rules used to derive all functional dependencies
22. What is Transitive dependency ? Mid A. a dependency where a non-key attribute depends on only part of a composite key B. a form in BCNF that additionally forbids non-trivial multivalued dependencies C. a constraint where one attribute set uniquely determines the values of another D. a dependency where a non-key attribute depends on another non-key attribute
23. Which term means: "a dependency where a non-key attribute depends on another non-key attribute"? Mid A. Third normal form B. Transitive dependency C. Armstrong's axioms D. Dependency preservation
24. Which statement is correct? Mid A. Transitive dependency — a form in BCNF that additionally forbids non-trivial multivalued dependencies B. Transitive dependency — a form in 2NF where no non-key attribute transitively depends on the primary key C. Transitive dependency — a form requiring every attribute to hold only atomic, single-valued, indivisible values D. Transitive dependency — a dependency where a non-key attribute depends on another non-key attribute
25. What is Lossless join decomposition ? Senior A. a constraint where one attribute set uniquely determines the values of another B. a decomposition that lets the original relation be reconstructed exactly by a natural join C. a form in 1NF where every non-key attribute fully depends on the whole candidate key D. a dependency where a non-key attribute depends on only part of a composite key
26. Which term means: "a decomposition that lets the original relation be reconstructed exactly by a natural join"? Senior A. Armstrong's axioms B. Second normal form C. Denormalization D. Lossless join decomposition
27. Which statement is correct? Senior A. Lossless join decomposition — a stricter 3NF requiring the left side of every non-trivial dependency to be a super key B. Lossless join decomposition — deliberately adding redundancy to a schema to improve read performance at the cost of duplication C. Lossless join decomposition — the full set of attributes that can be functionally determined from a given set D. Lossless join decomposition — a decomposition that lets the original relation be reconstructed exactly by a natural join
28. What is Dependency preservation ? Senior A. a decomposition in which all functional dependencies are still enforceable on individual tables B. a dependency where a non-key attribute depends on another non-key attribute C. a form in BCNF that additionally forbids non-trivial multivalued dependencies D. a sound and complete set of inference rules used to derive all functional dependencies
29. Which term means: "a decomposition in which all functional dependencies are still enforceable on individual tables"? Senior A. Second normal form B. Denormalization C. First normal form D. Dependency preservation
30. Which statement is correct? Senior A. Dependency preservation — a sound and complete set of inference rules used to derive all functional dependencies B. Dependency preservation — a decomposition in which all functional dependencies are still enforceable on individual tables C. Dependency preservation — a constraint where one attribute set uniquely determines the values of another D. Dependency preservation — a form requiring every attribute to hold only atomic, single-valued, indivisible values Showing 30 of 39 DBMS · Normalization questions — the full set, with answers, explanations and an AI tutor on every question, is inside.