CSE 3901 FINAL EXAM COMPLETE STUDY
GUIDE AND SOFTWARE ENGINEERING
ADVANCED REVIEW 2026
◉ Guideline 2: Design base relation schemas so that:
1) No ____ exists in tuples
2) No ____ will occur.
Answer: 1) No redundant information exists in tuples
2) No update anomalies will occur
◉ What are the three types of update anomalies?.
Answer: Insertion, deletion, modification
◉ Define a functional dependency:
1) A function dependency is between ____
2) Specifies a ____ on the possible tuples that can ____
3) For any two tuples t1 and t2 in r that have t1[X] = t2[X], they must
____.
Answer: 1) Two sets of attributes X and Y that are subsets of R
2) Specifies a constraint on the possible tuples that can form a
relation state r of R
,3) They must also have t1[Y] = t2[Y]
◉ X --> Y means
1) Y ____
2) X____.
Answer: 1) Y is functionally dependent on X
2) X functionally determines Y
◉ Define full functional dependency in english between sets of
attributes X and Y.
Answer: X -- Y and no subset of X can be claimed to also functionally
determine Y; X and only the complete X functionally determines Y
◉ Define 1NF.
Answer: All domain values in R are atomic
◉ Define 2NF.
Answer: 1) R is in 1NF and every non-key attribute is fully
dependent on the key
2) Every nonprime attribute is not partially dependent on any
candidate key
3) EVERY NON-KEY ATTRIBUTE IS FULLY DEPENDENT ON THE KEY
, ◉ Define 3NF.
Answer: R is 2NF and every non-key attribute is non-transitively
dependent on the key
◉ Techniques to achieve 1NF:
1) Remove ____
2) Propagate ____.
Answer: 1) Remove nested relation and non-atomic attributes into a
new relation
2) Propagate the primary key into it
◉ 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
GUIDE AND SOFTWARE ENGINEERING
ADVANCED REVIEW 2026
◉ Guideline 2: Design base relation schemas so that:
1) No ____ exists in tuples
2) No ____ will occur.
Answer: 1) No redundant information exists in tuples
2) No update anomalies will occur
◉ What are the three types of update anomalies?.
Answer: Insertion, deletion, modification
◉ Define a functional dependency:
1) A function dependency is between ____
2) Specifies a ____ on the possible tuples that can ____
3) For any two tuples t1 and t2 in r that have t1[X] = t2[X], they must
____.
Answer: 1) Two sets of attributes X and Y that are subsets of R
2) Specifies a constraint on the possible tuples that can form a
relation state r of R
,3) They must also have t1[Y] = t2[Y]
◉ X --> Y means
1) Y ____
2) X____.
Answer: 1) Y is functionally dependent on X
2) X functionally determines Y
◉ Define full functional dependency in english between sets of
attributes X and Y.
Answer: X -- Y and no subset of X can be claimed to also functionally
determine Y; X and only the complete X functionally determines Y
◉ Define 1NF.
Answer: All domain values in R are atomic
◉ Define 2NF.
Answer: 1) R is in 1NF and every non-key attribute is fully
dependent on the key
2) Every nonprime attribute is not partially dependent on any
candidate key
3) EVERY NON-KEY ATTRIBUTE IS FULLY DEPENDENT ON THE KEY
, ◉ Define 3NF.
Answer: R is 2NF and every non-key attribute is non-transitively
dependent on the key
◉ Techniques to achieve 1NF:
1) Remove ____
2) Propagate ____.
Answer: 1) Remove nested relation and non-atomic attributes into a
new relation
2) Propagate the primary key into it
◉ 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
