QUESTIONS AND CORRECT ANSWERS
VERIFIED
●● 2NF.
Answer: is a progression beyond 1NF that organizes the columns into
smaller relation, no partial dependencies
●● 3NF.
Answer: include rules of 2NF but also exclude transitive dependencies. -
No transitive dependencies exist
●● 4NF.
Answer: all requirements meet of 3NF
Further data integrity rules have been applied to remove all potential
data modification anomalies
●● algoirthm.
Answer: defined set of steps to solve a problem
●● atomic value.
Answer: is a piece of data that cannot be meaningfully divided.
, ●● Boyce-Codd Normal Form (BCNF).
Answer: A special type of third normal form (3NF) in which every
determinant is a candidate key
●● candidate key.
Answer: An attribute, or combination of attributes, that uniquely
identifies a row in a relation.
●● Codd's 12 rules.
Answer: defines what is required from a DBMS in order for it to be
considered relational
●● Codd's relational model of data.
Answer: the original normalization process
●● composite key.
Answer: An identifier consisting of a combination of
two or more fields that is used when more than one column is necessary
to make a row unique in a table; also, an index with more than one key
field.
●● data modification anomalies.