2. Question 1
Second Normal form is designed
to
A. Ensure that a table is in
first normal form is
decomposed into two
fields
C. Ensure that every non
key field in a record has
a corresponding foreign
key in atleast one other
table
B. Ensure that a table that is
in first normal form is
decomposed into two
or more tables
D. Ensure that every non
key field in a record is
fully functionally
dependant upon the
key field
3. Question 2
A Foreign key is
A.A field in a table that
contains data that is
also contained
elsewhere in another
table
C. A key that consists of
more than one field
B. A field in a table that
has the same name
as a key field in
another table
D. A field in a table that
matches a key field
in another table
4. The model for a relational
database was proposed in the
A. 1990’s
C. 1980’s
Question 3
B. 1970’s
D.1960’s
5. Question 4
A foreign key must
A. Have either a
matching value in
the
reffering(Primary)
table or be Null
C. Not be Null
B. Have a matching
value in the
referring(Primary)
table
D. Not contain the same
value more than
once
6. Question 5
Normalization is
A. The process of ensuring
that each table has a
key
C. A process whereby a
limit is put on the
number of fields a
record can contain
B. A process whereby the
design of a
table(relation) is
decomposed into more
tables that more
precisely fit the
relational model
D. The process of ensuring
that a relational
database has at least
two tables in it
7. Question 6
Third Normal form is designed to
A. Ensure there are no
dependencies between
keys & foreign keys
C. Ensure that the database
contains three tables
B. Ensure that a table that is
in second normal form
is decomposed into two
or more tables
D. Ensure that there are no
transitive dependencies
between non-key fields
8. Question 7
A transitive dependency
A. Is where field does
not always depend
upon the key field
C. Is where field A
depends upon
field B and field B
is not a key field
B. Is where field A
depends upon field B
and field B is a key
field
D. Is allowed in third
normal form
9. Bonus Question
A one to many relationship(of table A to
table B) is
A. Where each record in
table B can have one
or more matching
records in table A
C. Where each record in
table A can have one
or more matching
records in table B
B. Where each record in
table A is required to
have a match in table B
D. Where each record in
table B is required to
have a match in table A
10. Key
• 1) D
• 2) D
• 3) B
• 4) A
• 5) B
• 6) D
• 7) C
