adplus-dvertising
frame-decoration

Question

In the entity-relationship diagram, the partial key is sometimes also called

a.

subordinate

b.

discriminator

c.

incremental

d.

Cartesian ordinate

Posted under DBMS

Answer: (b).discriminator

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In the entity-relationship diagram, the partial key is sometimes also called

Similar Questions

Discover Related MCQs

Q. In ER diagrams, the existence dependency is shown by

Q. In entity set, the type of attribute having distinct values for specific entity is classified as

Q. In E-R diagrams, the relationship type with three degrees is classified as

Q. In relational databases, the key which are considered as type of reference attribute is classified as

Q. The step of high level conceptual models designing in which the data requirements are documented by interviewing database users is

Q. The kind of entities without any key attributes are classified as

Q. The most popular high level conceptual model in database management system is

Q. The maximum number of instances that can participate into the binary relationship is classified as

Q. In entity-relationship diagrams, the types of relationships among entities are represented by

Q. If in database of employees, the Age attribute is derived attribute then date of birth is classified as

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

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