Consider the following table:
Company
Area
Service
Green Pastures
Sandton
Carpeting
Cleaning
Fourways
Midrand
Strong Arm Security
Seapoint
Armed Response
Neighborhood Patrol
Camps Bay
Stellenbosch
Each row in the table is unique and there are no non-key attributes.
What is the highest (in the order they appear in the list) normal form that the table satisfies?
1. None, it is not normalized at all
2. 1st Normal Form
3. 2nd Normal Form
4. 3rd Normal Form
5. Boyce-Codd Normal Form
6. 4th Normal Form
7. 5th Normal Form
I'm going with 1st Normal Form.
Urghhhh thats an ugly table. I am going with No. 1
If you say its different I will not agree because I would never implement a table like that and I dont care how normal it is
Please mark me right... next question please?
[comments removed] - sticking with No.1
No 2 : 1st Normal form
Japie Botma
I think that I would go with :
My reasoning: "there are no non-key attributes" = the 3 columns form the primary key.
First normal form (1NF or Minimal Form) is a normal form used in database normalization. First normal form excludes the possibility of repeating groups by requiring that each field in a database hold an atomic value, and that records be defined in such a way as to be uniquely identifiable by means of a primary key.
Second normal form (2NF) is a normal form used in database normalization. A table that is in first normal form (1NF) must meet additional criteria if it is to qualify for second normal form. Specifically: a 1NF table is in 2NF if and only if none of its non-prime attributes are functionally dependent on a part (proper subset) of a candidate key. A non-prime attribute is one that does not belong to any candidate key.
The third normal form (3NF) is a normal form used in database normalization to check if all the non-key attributes of a relation depend only on the candidate keys of the relation. This means that all non-key attributes are mutually independent or, in other words, that a non-key attribute cannot be transitively dependent on another non-key attribute.A relation in 3NF must also be in 2NF. The 3NF differs from the second normal form in that all non-key attributes in 3NF are required to be directly dependent on each candidate key of the relation.
The third normal form (3NF) is a normal form used in database normalization to check if all the non-key attributes of a relation depend only on the candidate keys of the relation. This means that all non-key attributes are mutually independent or, in other words, that a non-key attribute cannot be transitively dependent on another non-key attribute.
A relation in 3NF must also be in 2NF. The 3NF differs from the second normal form in that all non-key attributes in 3NF are required to be directly dependent on each candidate key of the relation.
Boyce-Codd normal form (or BCNF) is a normal form used in database normalization. It is a slightly stronger version of the third normal form (3NF). Boyce-Codd normal form follows the same rules as 3NF, but only allows functional dependencies where the left side of a functional dependency, , is a superset of a candidate key.
Fourth normal form (4NF) is a normal form used in database normalization. 4NF ensures that independent multivalued facts are correctly and efficiently represented in a database design. 4NF is the next level of normalization after Boyce-Codd normal form (BCNF). The definition of 4NF relies on the notion of a multivalued dependency. A table with a multivalued dependency is one where the existence of more than one independent many-to-many relationships in a table causes redundancy; and it is this redundancy which is removed by fourth normal form.
Fourth normal form (4NF) is a normal form used in database normalization. 4NF ensures that independent multivalued facts are correctly and efficiently represented in a database design. 4NF is the next level of normalization after Boyce-Codd normal form (BCNF).
The definition of 4NF relies on the notion of a multivalued dependency. A table with a multivalued dependency is one where the existence of more than one independent many-to-many relationships in a table causes redundancy; and it is this redundancy which is removed by fourth normal form.
(Source: Wikipedia)
These two ensure that the table is at least First Normal Form.
This ensures that the table is in Second, Third AND Boyce-Codd Normal Form.
This statement proves that the table does NOT satisfy Fourth Normal form.
Answer: 5. Boyce-Codd normal form. The table satisfies all requriements up to and including Boyce-Codd.
I wrote a brief blog post explaining what 4th normal form is and how to normalize your Boyce-Codd tables into 4th normal form.
Take a look at it here: What exactly is 4th normal form?