WorksheetsQ5. Normalization of Database Table
Total questions: 17
Worksheet time: 10mins
(a) is the process of organizing data in a database.
A relation is in (a) form if every attribute in that relation is single-valued attribute.
(a) is based on the concept of fully functional dependency.
A table is in 1NF if it contains repeating groups or arrays in a single column.
True
False
A table that has a primary key and contains only atomic (indivisible) values is in 1NF.
True
False
A table in 1NF ensures that all attributes depend on the primary key.
True
False
A table that allows multi-valued attributes in a column is still in 1NF.
True
False
If a table has a composite primary key, it can still be in 1NF.
True
False
A table is in 2NF if it is in 1NF and has no partial dependency.
True
False
A table in 2NF can still have transitive dependencies.
True
False
A table is in 3NF if it is in 2NF and has no transitive dependencies.
True
False
Transitive dependency occurs when a non-key attribute depends on another non-key attribute rather than the primary key.
True
False
A table in 3NF must have a primary key.
True
False
If a table is in 2NF and all non-key attributes depend only on the primary key, it is in 3NF.
True
False
Normalization reduces data redundancy and improves data integrity.
True
False
All database designs must be fully normalized up to 3NF or higher.
True
False
Normalization eliminates all redundancy in a database.
True
False
