CSE 3901 FINAL EXAM FULL REVISION NOTES
WITH SYSTEM DESIGN AND SOFTWARE
DEVELOPMENT LIFE CYCLE CONCEPTS
◉ 2NF is based on the concept of ____.
Answer: Full functional dependency
◉ Define prime attribute.
Answer: A member of some candidate key of R
◉ What issue arises in 2NF?.
Answer: Transitive dependence
◉ Define superkey.
Answer: Data attributes(s) that uniquely identify a tuple
◉ Define a key.
Answer: Minimal superkey
◉ Define a candidate key.
Answer: One of several possible keys
,◉ Define a primary key.
Answer: Preferred candidate key for an entity type
◉ Define an alternate key.
Answer: AKA secondary key, another unique identifier
◉ Define a foreign key.
Answer: Attribute(s) in an entity type that relates to a primary key
in another relation
◉ Define a surrogate key.
Answer: Row-ids, sequential numbers assigned as keys (artificially)
◉ Define a natural key.
Answer: Key that is formed of attributes that already exist in the real
world (like SSN)
◉ Define a composite key.
Answer: Key of two or more attributes
◉ Conditions that violate 3NF:
, 1) A ____ determines another ____
2) A proper subset of a key of R ____.
Answer: 1) A nonprime attribute determines another nonprime
attribute (transitive dependency violates 3NF)
2) A proper subset of a key of R functionally determines a nonprime
attribute (partially dependency violates 2NF)
◉ Two important properties of decompositions regarding the
normalization process:
1) ____ or ____ of the corresponding join
2) Preservation of ____.
Answer: 1) Non-additive or loss-lessness of the corresponding join
2) Preservation of the functional dependencies
◉ Distinguish between prime & nonprime attributes.
Answer: 1) Prime: Attribute that is part of any candidate key of R
2) Nonprime attribute: All other attributes are called non-prime
attributes
◉ Define Boyce-Codd Normal Form.
Answer: If X --> A holds in R, then X is a superkey of R
◉ Concisely define 4NF:.
WITH SYSTEM DESIGN AND SOFTWARE
DEVELOPMENT LIFE CYCLE CONCEPTS
◉ 2NF is based on the concept of ____.
Answer: Full functional dependency
◉ Define prime attribute.
Answer: A member of some candidate key of R
◉ What issue arises in 2NF?.
Answer: Transitive dependence
◉ Define superkey.
Answer: Data attributes(s) that uniquely identify a tuple
◉ Define a key.
Answer: Minimal superkey
◉ Define a candidate key.
Answer: One of several possible keys
,◉ Define a primary key.
Answer: Preferred candidate key for an entity type
◉ Define an alternate key.
Answer: AKA secondary key, another unique identifier
◉ Define a foreign key.
Answer: Attribute(s) in an entity type that relates to a primary key
in another relation
◉ Define a surrogate key.
Answer: Row-ids, sequential numbers assigned as keys (artificially)
◉ Define a natural key.
Answer: Key that is formed of attributes that already exist in the real
world (like SSN)
◉ Define a composite key.
Answer: Key of two or more attributes
◉ Conditions that violate 3NF:
, 1) A ____ determines another ____
2) A proper subset of a key of R ____.
Answer: 1) A nonprime attribute determines another nonprime
attribute (transitive dependency violates 3NF)
2) A proper subset of a key of R functionally determines a nonprime
attribute (partially dependency violates 2NF)
◉ Two important properties of decompositions regarding the
normalization process:
1) ____ or ____ of the corresponding join
2) Preservation of ____.
Answer: 1) Non-additive or loss-lessness of the corresponding join
2) Preservation of the functional dependencies
◉ Distinguish between prime & nonprime attributes.
Answer: 1) Prime: Attribute that is part of any candidate key of R
2) Nonprime attribute: All other attributes are called non-prime
attributes
◉ Define Boyce-Codd Normal Form.
Answer: If X --> A holds in R, then X is a superkey of R
◉ Concisely define 4NF:.
