Answer: B. Attribute values determine other values. A functional dependency states that one attribute set determines another.
What does first normal form require?
A No foreign keys
B No composite candidate keys
C Atomic attribute values
D Every table has one row
Answer: C. Atomic attribute values. First normal form requires each field to hold an atomic value in the model.
What does second normal form remove?
A Partial dependency on candidate key
B Every transitive dependency
C All foreign keys
D Every multivalued dependency
Answer: A. Partial dependency on candidate key. Second normal form removes partial dependencies on a proper subset of a candidate key.
What does third normal form address?
A Transitive dependency on key
B Duplicate indexes
C Null values everywhere
D Nonunique table names
Answer: A. Transitive dependency on key. Third normal form removes certain transitive dependencies of nonkey attributes on keys.
What is the BCNF condition?
A Every table has one attribute
B No candidate keys
C All columns are nullable
D Every determinant is a superkey
Answer: D. Every determinant is a superkey. Boyce Codd normal form requires each nontrivial determinant to be a superkey.
Which anomaly can normalization reduce?
A Update anomaly
B Network collision
C Compiler warning
D Disk partition error
Answer: A. Update anomaly. Normalization reduces redundant storage patterns that can cause update anomalies.
What is an insertion anomaly?
A Duplicate query column name
B Reads another value
C Cannot add fact alone
D A row is sorted incorrectly
Answer: C. Cannot add fact alone. An insertion anomaly arises when a fact cannot be inserted without adding unrelated data.
What is a lossless decomposition?
A Each table has primary key
B No tables share attributes
C Join restores original relation exactly
D All dependencies disappear
Answer: C. Join restores original relation exactly. A lossless decomposition reconstructs the original relation without spurious tuples.
What does dependency preservation mean?
A Every query uses an index
B Constraints enforceable without joining tables
C All columns are primary keys
D Rows remain sorted
Answer: B. Constraints enforceable without joining tables. A decomposition preserves dependencies when constraints can be checked on the decomposed relations.
What does fourth normal form address?
A Every primary key
B All join conditions
C Physical data layout
D Nontrivial multivalued dependencies
Answer: D. Nontrivial multivalued dependencies. Fourth normal form reduces certain independent multivalued facts in one relation.
What is denormalization?
A Add redundancy for access performance
B Remove every duplicate value
C Convert rows to objects
D Encrypt a database
Answer: A. Add redundancy for access performance. Denormalization deliberately adds redundancy to improve some read patterns.
What is a transaction?
A One database column
B A permanent lock
C A query plan node
D Logical unit of database work
Answer: D. Logical unit of database work. A transaction groups operations treated as one unit.
What does atomicity mean in ACID?
A Results survive every failure
B Concurrent work is isolated
C All or nothing execution
D Constraints always stay true
Answer: C. All or nothing execution. Atomicity prevents partial transaction effects from being committed.
What does consistency mean in ACID?
A Run without locks
B Preserve database rules
C Use a sorted index
D Always finish immediately
Answer: B. Preserve database rules. Consistency means a committed transaction preserves defined invariants and constraints.
What does isolation mean in ACID?
A Concurrent transactions avoid interference
B Committed data survives restart
C Transaction has one query
D All rows become private
Answer: A. Concurrent transactions avoid interference. Isolation controls how concurrent transactions interact and what intermediate results they see.