adplus-dvertising
frame-decoration

Question

The total participation constraint is also known as

a.

recursive dependency

b.

existence dependency

c.

existence independency

d.

recursive independency

Posted under DBMS

Answer: (b).existence dependency

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The total participation constraint is also known as

Similar Questions

Discover Related MCQs

Q. The weak entities are represented in UML diagrams by using aggregations called

Q. The attributes which have only more than one value for a specific entity are classified as

Q. The derived attributes in entity relationship diagrams are denoted by

Q. In designing of software, the functional requirements are specified with the help of

Q. In the database, the set of all entities related to a particular entity type is classified as

Q. In entity-relationship, the entity type which has existence dependency constraint is classified as

Q. The set of key attributes that identify weak entities related to some owner entity is classified as

Q. In DBMS, the set of associations can be defined among different entities from different entity types as

Q. The two main types of constraints of entity relationships are

Q. In ER diagrams, the partial participation is shown by

Q. The partial key is differentiated by other keys in database by underlining the key with

Q. In entity-relationship diagram, the key attributes are represented by

Q. In traditional DBMS, the application programs are considered to be the part of domain of

Q. The type of relationship between attributes in which similar entity participates more than once by playing different roles is classified as

Q. The other names of weak entity types are

Q. The user defined operations which includes update transactions and retrieval transactions are classified as

Q. The type of association which associates a owner entity to weak entity is classified as

Q. The type of attributes that can be easily divided into smaller parts is classified as

Q. The weak entities are used in entity relationship diagrams and are denoted by

Q. The databases which are used to represent reference attributes are classified as