edited by
1,560 views
2 votes
2 votes

Which one of the following pairs is correctly matched in the context of database design ?

$\begin{array}{|l|l|l|l|}\hline &  \text{List-I(Database term)} && \text{List-II(Definition)}  \\\hline \text{I.} & \text{Specialization}  & \text{A.} & \text{ Result of taking the union of two or more} \\ &&&\text{disjoint (lower-level) entity sets to produce} \\&&&\text{a higher-level entity set.} \\\hline \text{II.} & \text{Generalization}  & \text{B.} & \text{Express the number of entities to which} \\ &&& \text{another entity can be associated via a} \\ &&& \text{relationship set.} \\\hline \text{III.} & \text{Aggregation}  & \text{C.} & \text{Result of taking a subset of a higher-level} \\ &&& \text{entity set to form a lower-level entity set.} \\\hline \text{IV.} & \text{Mapping cardinality}  & \text{D.} & \text{An abstraction in which relationship sets} \\&&& \text{(along with their associated entity sets) are} \\ &&& \text{treated as higher-level entity sets, and can} \\ &&& \text{participate in relationships. } \\\hline \end{array}$

Codes :

  1. I-D, II-A, III-B, IV-C
  2. I-D, II-C, III-B, IV-A
  3. I-C, II-D, III-A, IV-B
  4. I-C, II-A, III-D, IV-B
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
3 answers
4
makhdoom ghaya asked Oct 4, 2016
4,057 views
Which formal system provides the semantic foundation for Prolog ?Predicate calculusLambda calculusHoare logicPropositional logic