MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In entity-relationship diagrams, the types of relationships among entities are represented by |
| A. | Squared box |
| B. | Diamond shaped box |
| C. | Oval shaped box |
| D. | Rectangular box |
| Answer» C. Oval shaped box | |
| 2. |
If in database of employees, the Age attribute is derived attribute then date of birth is classified as |
| A. | Logical attribute |
| B. | Physical attribute |
| C. | Conceptual attribute |
| D. | Stored attribute |
| Answer» E. | |
| 3. |
In binary relationship, the participation cardinality is also known as |
| A. | Intensive cardinality constraint |
| B. | Recursive cardinality constraint |
| C. | Minimum cardinality constraint |
| D. | Maximum cardinality constraint |
| Answer» D. Maximum cardinality constraint | |
| 4. |
In the commercial database management system, the relational database model is also known as |
| A. | Implementation data model |
| B. | Attribution data model |
| C. | Sequential data model |
| D. | Functional data model |
| Answer» B. Attribution data model | |
| 5. |
The number of entity types participating in the E-R diagrams is represented by |
| A. | Structure of relationship |
| B. | Instance of relationship |
| C. | Degree of relationship |
| D. | Role of relationship |
| Answer» D. Role of relationship | |
| 6. |
In constructing ER diagrams, the double ovals are used to denote |
| A. | Multi-value table |
| B. | Multi-value entity |
| C. | Multi-value attributes |
| D. | Multi-value key |
| Answer» D. Multi-value key | |
| 7. |
The total participation constraint is also known as |
| A. | Recursive dependency |
| B. | Existence dependency |
| C. | Existence independency |
| D. | Recursive independency |
| Answer» C. Existence independency | |
| 8. |
The weak entities are represented in UML diagrams by using aggregations called |
| A. | Qualified segregation |
| B. | Non-qualified segregation |
| C. | Non-qualified aggregation |
| D. | Qualified aggregation |
| Answer» E. | |
| 9. |
The attributes which have only more than one value for a specific entity are classified as |
| A. | Atomic attributes |
| B. | Diatomic attributes |
| C. | Multi-valued attributes |
| D. | Single valued attributes |
| Answer» D. Single valued attributes | |
| 10. |
The derived attributes in entity relationship diagrams are denoted by |
| A. | Dotted triangle |
| B. | Dotted rectangle |
| C. | Dotted oval |
| D. | Dotted square |
| Answer» D. Dotted square | |
| 11. |
In designing of software, the functional requirements are specified with the help of |
| A. | Sequence diagrams |
| B. | Dataflow diagrams |
| C. | Scenarios |
| D. | All of above |
| Answer» E. | |
| 12. |
In the database, the set of all entities related to a particular entity type is classified as |
| A. | Structural entity set |
| B. | Entity set |
| C. | Functional set of entity |
| D. | Logical set of entity |
| Answer» C. Functional set of entity | |
| 13. |
In entity-relationship, the entity type which has existence dependency constraint is classified as |
| A. | Single entity |
| B. | Foreign entity |
| C. | Weak entity |
| D. | Strong entity |
| Answer» D. Strong entity | |
| 14. |
The set of key attributes that identify weak entities related to some owner entity is classified as |
| A. | Structural key |
| B. | Partial key |
| C. | String key |
| D. | Foreign key |
| Answer» C. String key | |
| 15. |
The two main types of constraints of entity relationships are |
| A. | Intensive ratio |
| B. | Participation |
| C. | Cardinality ratio |
| D. | Both b and c |
| Answer» E. | |
| 16. |
In DBMS, the set of associations can be defined among different entities from different entity types as |
| A. | Relationship string |
| B. | Relationship set |
| C. | Relationship type |
| D. | Both b and c |
| Answer» E. | |
| 17. |
In ER diagrams, the partial participation is shown by |
| A. | Single line |
| B. | Double line |
| C. | Double dotted line |
| D. | Triple dotted line |
| Answer» B. Double line | |
| 18. |
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 |
| Answer» B. Double line | |
| 19. |
In entity-relationship diagram, the key attributes are represented by |
| A. | Oval shape and underline |
| B. | Oval shape and double line |
| C. | Square shape and underline |
| D. | Square shape and double line |
| Answer» B. Oval shape and double line | |
| 20. |
In traditional DBMS, the application programs are considered to be the part of domain of |
| A. | Database designs |
| B. | Software engineering |
| C. | Network design utility |
| D. | Utility designs |
| Answer» C. Network design utility | |
| 21. |
The type of relationship between attributes in which similar entity participates more than once by playing different roles is classified as |
| A. | Intensive relationships |
| B. | Recursive relationship |
| C. | Extensive relationship |
| D. | Floating relationships |
| Answer» C. Extensive relationship | |
| 22. |
The other names of weak entity types are |
| A. | Ordinate entity type |
| B. | Child entity type |
| C. | Subordinate entity type |
| D. | Both b and c |
| Answer» E. | |
| 23. |
The user defined operations which includes update transactions and retrieval transactions are classified as |
| A. | Logical requirements |
| B. | Attribution requirements |
| C. | Structural requirements |
| D. | Functional requirements |
| Answer» E. | |
| 24. |
The type of association which associates a owner entity to weak entity is classified as |
| A. | String relationship |
| B. | Dependency relationship |
| C. | Floating relationship |
| D. | Identifying relationship |
| Answer» E. | |
| 25. |
The type of attributes that can be easily divided into smaller parts is classified as |
| A. | Derived attributes |
| B. | Simple attributes |
| C. | Composite attributes |
| D. | Atomic attributes |
| Answer» D. Atomic attributes | |
| 26. |
The weak entities are used in entity relationship diagrams and are denoted by |
| A. | Double rectangles |
| B. | Double square |
| C. | Double ovals |
| D. | Double squares |
| Answer» B. Double square | |
| 27. |
The type of diagram in which the operations are specified on objects is considered as |
| A. | Functional diagrams |
| B. | Class diagrams |
| C. | Attribute diagrams |
| D. | Entity diagrams |
| Answer» C. Attribute diagrams | |
| 28. |
Considering the binary relationships, the possible cardinality ratios are |
| A. | One : one |
| B. | 1 : N |
| C. | M : N |
| D. | All of above |
| Answer» E. | |
| 29. |
The attributes that can be arranged into hierarchy are called |
| A. | Composite attributes |
| B. | Atomic attributes |
| C. | Derived attributes |
| D. | Simple attributes |
| Answer» B. Atomic attributes | |
| 30. |
The set of all the entities having same attributes is classified as |
| A. | Entity type |
| B. | Attribute type |
| C. | Function type |
| D. | Hierarchy type |
| Answer» B. Attribute type | |
| 31. |
The set of values which specifies which values are to be assigned to individual entities is considered as |
| A. | Domain of values |
| B. | Composition of values |
| C. | Attribution of values |
| D. | Derivation of values |
| Answer» B. Composition of values | |
| 32. |
The type of attributes that can be divided into smaller parts is classified as |
| A. | Multivalve attributes |
| B. | Single valued attributes |
| C. | Composite attributes |
| D. | Atomic attributes |
| Answer» E. | |
| 33. |
The particular database and the set of related programs which helps in implementation of updates and queries is called |
| A. | Implemented applications |
| B. | Backup applications |
| C. | Utility programs |
| D. | Database application |
| Answer» E. | |
| 34. |
The detailed description on entity constraints, entity relationships and entity types is expressed in |
| A. | Low level schema design |
| B. | Physical design |
| C. | Conceptual design |
| D. | Logical design |
| Answer» D. Logical design | |
| 35. |
The types of partial constraints are |
| A. | Total and partial |
| B. | Intensive and extensive |
| C. | Minimum and maximum |
| D. | Floating and string |
| Answer» B. Intensive and extensive | |
| 36. |
The attributes which have only one value for a specific entity are called |
| A. | Multi-valued attributes |
| B. | Single valued attributes |
| C. | Atomic attributes |
| D. | Diatomic attributes |
| Answer» C. Atomic attributes | |
| 37. |
The phase in data designing in which the access paths and database indexes are specified is classified as |
| A. | Structural design |
| B. | Physical design of database |
| C. | Data model mapping |
| D. | Logical design |
| Answer» C. Data model mapping | |
| 38. |
In programming languages, the available data types are |
| A. | Integer |
| B. | String |
| C. | Float and Boolean |
| D. | All of above |
| Answer» E. | |
| 39. |
The kind of constraint which cannot let two entities to have similar values is classified as |
| A. | Derived constraints |
| B. | Composite value constraint |
| C. | Uniqueness constraint |
| D. | Multi valued constraint |
| Answer» D. Multi valued constraint | |
| 40. |
The data model in which the relationships are explained in terms of attributes is classified as |
| A. | Functional data models |
| B. | Binary data models |
| C. | Ternary data models |
| D. | Extension data model |
| Answer» B. Binary data models | |
| 41. |
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 |
| Answer» E. | |
| 42. |
The weak entities and their identifying relationship in the ER diagrams are represented by |
| A. | Oval shape with double line |
| B. | Rectangle shape with double line |
| C. | Square shape with double line |
| D. | Diamond shape with double line |
| Answer» E. | |
| 43. |
In ER diagrams, the rectangles are used to denote |
| A. | Entity types |
| B. | Attribute types |
| C. | Key types |
| D. | Structure types |
| Answer» B. Attribute types | |
| 44. |
An instance of relational schema R (A, B, C) has distinct values of A including NULL values. Which one of the following is true? |
| A. | A is a candidate key |
| B. | A is not a candidate key |
| C. | A is a primary Key |
| D. | Both a and c |
| Answer» C. A is a primary Key | |
| 45. |
Which of the following schema is present at highest level ? |
| A. | Physical Schema |
| B. | Sub-Schema |
| C. | Logical Schema |
| D. | None of these |
| Answer» C. Logical Schema | |
| 46. |
Map of concepts and their relationships is represented by __________ Schema. |
| A. | Conceptual Schema |
| B. | Logical Schema |
| C. | Physical Schema |
| D. | None of these |
| Answer» B. Logical Schema | |
| 47. |
A map of entities and their attributes and relations is represented by ____________. |
| A. | Logical Schema |
| B. | Physical Schema |
| C. | Conceptual Schema |
| D. | None of these |
| Answer» B. Physical Schema | |
| 48. |
Schema Definition is written by _________. |
| A. | Database Manager |
| B. | Database Administrator |
| C. | Application Developer |
| D. | Storage Manager |
| Answer» C. Application Developer | |
| 49. |
In entity-relationship diagrams, the participating entities are represented by |
| A. | Oval shaped box |
| B. | Rectangular box |
| C. | Squared box |
| D. | Diamond shaped box |
| Answer» C. Squared box | |
| 50. |
The relationship type in which one attribute is migrated to the N-side of relationship is classified as |
| A. | 4:N |
| B. | 3:N |
| C. | 1:N |
| D. | 2:N |
| Answer» D. 2:N | |