adplus-dvertising
frame-decoration

Question

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

a.

dotted line

b.

double line

c.

red line

d.

red dotted line

Posted under DBMS

Answer: (a).dotted line

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. The Universal Modeling Language in database management system is classified as

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

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