adplus-dvertising
frame-decoration

Question

In binary relationship, the participation cardinality is also known as

a.

intensive cardinality constraint

b.

recursive cardinality constraint

c.

minimum cardinality constraint

d.

maximum cardinality constraint

Posted under DBMS

Answer: (c).minimum cardinality constraint

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In binary relationship, the participation cardinality is also known as

Similar Questions

Discover Related MCQs

Q. The number of entity types participating in the E-R diagrams is represented by

Q. The identifying entity type is also known as

Q. The step in database design in which the high level data model is converted into the model of data implementation is considered as

Q. In UML diagrams, the relationship between the object and component parts is represented by

Q. In the modeling of union type classes, the partial category of super class is represented by

Q. The type of classes which specifies the operations and attributes but the corresponding classes are not available are classified as

Q. The entity type from which the subgroups can be made is classified as

Q. Considering the conceptual synthesis and refinement, the generalization process is classified as

Q. The kind of class which does not have its own subclasses is called

Q. The root super class in diagrams of generalization and specialization is considered as

Q. The association between aggregate and primitive objects is classified as

Q. The concept which describes the domain of knowledge is considered as

Q. Considering abstraction concepts, the process of assigning the similar entities to similar entity types systematically is called

Q. The category which considers the subset of union of entities included in super class is classified

Q. The kind of class whose entities belongs to some other data class is called

Q. According to enhanced-entity relationships, the association between super class and subclass is as

Q. The possible specialization constraint includes

Q. The hierarchy in which each subclass participates in one subclass relationship is classified as

Q. The type of lattice in which a subclass can be class or subclass in more than one association of subclasses is classified as

Q. In the process of specialization, the subclasses are attached by