adplus-dvertising
frame-decoration

Question

The first step in designing high level conceptual data model is

a.

logical design analysis

b.

conceptual design analysis

c.

functional requirement analysis

d.

requirement analysis

Posted under DBMS

Answer: (d).requirement analysis

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. The weak entities and their identifying relationship in the ER diagrams are represented by

Q. In ER diagrams, the rectangles are used to denote

Q. In entity-relationship diagrams, the participating entities are represented by

Q. The relationship type in which one attribute is migrated to the N-side of relationship is classified as

Q. The entities that have key attributes to be distinct are considered as

Q. The schema which specifies that all the database users requirements have been met is called

Q. For a relationship type, the participation constraints and cardinality ratio are considered together to make

Q. The parent entity type or identifying entity type are considered as other names of

Q. The relationship type with two degrees is classified as

Q. The constraint which specifies the minimum number of relationship instances is classified as

Q. In the commercial database management system, the relational database model is also known as

Q. In constructing ER diagrams, the double ovals are used to denote

Q. The total participation constraint is also known as

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