Difficulty: Easy
Correct Answer: Correct
Explanation:
Introduction / Context:
Relationship degree is a classic ER concept distinct from cardinality. Degree counts how many entity types participate. Most operational schemas are built from binary relationships, but unary (recursive) and ternary (three-way) relationships occur in practice.
Given Data / Assumptions:
Concept / Approach:
Degree answers “how many entity types?” while cardinality answers “how many instances on each side?” and optionality answers “minimum participation required?” Keeping these distinct helps avoid modeling errors.
Step-by-Step Solution:
Identify participants in a relationship. Count the distinct entity types to determine degree. Separately specify maximum and minimum cardinalities for each participating side.
Verification / Alternative check:
Transform a ternary relationship into associative tables; verify that the relationship truly requires three-way dependency, not two separate binaries.
Why Other Options Are Wrong:
“Incorrect” conflicts with accepted definitions. Limiting to binary or tying to optionality mixes separate properties.
Common Pitfalls:
Forcing ternary relationships into binary pairs without preserving semantics; conflating degree with cardinality.
Final Answer:
Correct
Discussion & Comments