adplus-dvertising
frame-decoration

Question

For every relationship, how many possible types of actions are there when enforcing minimum cardinalities?

a.

Two

b.

Three

c.

Four

d.

Six

Posted under DBMS

Answer: (d).Six

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. For every relationship, how many possible types of actions are there when enforcing minimum cardinalities?

Similar Questions

Discover Related MCQs

Q. Which constraint requires that the binary relationship indicate all combinations that must appear in the ternary relationship?

Q. Each entity is represented as a(n):

Q. For every relationship, how many possible sets of minimum cardinalities are there?

Q. If a relationship has a cascade updates constraint, then if ________ in the parent table is changed, then the same change will automatically be made to any corresponding foreign key value.

Q. Which of the following column properties would be used to specify that cells in a column must contain a monetary value that is less than another monetary value in the same row?

Q. The type of diagram in which the operations are specified on objects is considered as

Q. Considering the binary relationships, the possible cardinality ratios are

Q. The attributes that can be arranged into hierarchy are called

Q. The set of all the entities having same attributes is classified as

Q. The set of values which specifies which values are to be assigned to individual entities is considered as

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

Q. The particular database and the set of related programs which helps in implementation of updates and queries is called

Q. The detailed description on entity constraints, entity relationships and entity types is expressed in

Q. The types of partial constraints are

Q. The attributes which have only one value for a specific entity are called

Q. The phase in data designing in which the access paths and database indexes are specified is classified as

Q. In programming languages, the available data types are

Q. The kind of constraint which cannot let two entities to have similar values is classified as

Q. The data model in which the relationships are explained in terms of attributes is classified as

Q. The first step in designing high level conceptual data model is