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. |
Type of diagram in which operations are specified on objects is considered as |
| A. | Functional diagrams |
| B. | Class diagrams |
| C. | Attribute diagrams |
| D. | Entity diagrams |
| Answer» C. Attribute diagrams | |
| 2. |
Considering binary relationships, possible cardinality ratios are |
| A. | One : one |
| B. | 1 : N |
| C. | M : N |
| D. | All of above |
| Answer» E. | |
| 3. |
Set of all entities having same attributes is classified as |
| A. | Entity type |
| B. | Attribute type |
| C. | Function type |
| D. | Hierarchy type |
| Answer» B. Attribute type | |
| 4. |
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 | |
| 5. |
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 | |
| 6. |
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. | |
| 7. |
Particular database and 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. | |
| 8. |
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 | |
| 9. |
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 | |
| 10. |
In designing of software, functional requirements are specified with help of |
| A. | Sequence diagrams |
| B. | Dataflow diagrams |
| C. | Scenarios |
| D. | All of above |
| Answer» E. | |
| 11. |
In database, 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 | |
| 12. |
In entity-relationship, 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 | |
| 13. |
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 | |
| 14. |
IN DBMS, 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. | |
| 15. |
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 binary relationship, 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 | |
| 17. |
Number of entity types participating in 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 | |
| 18. |
Identifying entity type is also known as |
| A. | Owner entity type |
| B. | String entity type |
| C. | Evidence entity |
| D. | Floating entity |
| Answer» B. String entity type | |
| 19. |
Step in database design in which high level data model is converted into model of data implementation is considered as |
| A. | Physical design of database |
| B. | Data model mapping |
| C. | Logical design |
| D. | Both a and c |
| Answer» E. | |
| 20. |
In UML diagrams, relationship between object and component parts is represented by |
| A. | Ordination |
| B. | Aggregation |
| C. | Segregation |
| D. | Increment |
| Answer» C. Segregation | |
| 21. |
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 | |
| 22. |
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 | |
| 23. |
Databases which are used to represent reference attributes are classified as |
| A. | Ternary databases |
| B. | String databases |
| C. | Floating databases |
| D. | Object databases |
| Answer» E. | |
| 24. |
Universal Modeling Language in database management system is classified as |
| A. | Object modeling methodology |
| B. | Query modeling methodology |
| C. | Entity modeling methodology |
| D. | Attribute modeling methodology |
| Answer» B. Query modeling methodology | |
| 25. |
In entity-relationship diagram, partial key is sometimes also called |
| A. | Subordinate |
| B. | Discriminator |
| C. | Incremental |
| D. | Cartesian ordinate |
| Answer» C. Incremental | |
| 26. |
In ER diagrams, existence dependency is shown by |
| A. | Double dotted line |
| B. | Triple dotted line |
| C. | Single line |
| D. | Double line |
| Answer» E. | |
| 27. |
In entity set, type of attribute having distinct values for specific entity is classified as |
| A. | Functional attribute |
| B. | Logical attribute |
| C. | Key entity |
| D. | Key attribute |
| Answer» E. | |
| 28. |
In E-R diagrams, relationship type with three degrees is classified as |
| A. | Binary relationship |
| B. | Ternary relationship |
| C. | Extension association |
| D. | Intension association |
| Answer» C. Extension association | |
| 29. |
In relational databases, key which are considered as type of reference attribute is classified as |
| A. | Foreign keys |
| B. | Composite keys |
| C. | String keys |
| D. | Floating keys |
| Answer» B. Composite keys | |
| 30. |
Step of high level conceptual models designing in which data requirements are documented by interviewing database users is |
| A. | Host server analysis |
| B. | Requirement collection and analysis |
| C. | Client server analysis |
| D. | Entity attribute analysis |
| Answer» C. Client server analysis | |
| 31. |
Kind of entities without any key attributes are classified as |
| A. | Weak entity |
| B. | Strong entity |
| C. | Single entity |
| D. | Foreign entity |
| Answer» B. Strong entity | |
| 32. |
Most popular high level conceptual model in database management system is |
| A. | Close end relation model |
| B. | Query relation model |
| C. | Entity relationship model |
| D. | Attribute relationship model |
| Answer» D. Attribute relationship model | |
| 33. |
Maximum number of instances that can participate into binary relationship is classified as |
| A. | Floating ratio |
| B. | Cardinality ratio |
| C. | Intensive ratio |
| D. | Extensive ratio |
| Answer» C. Intensive ratio | |
| 34. |
In entity-relationship diagrams, 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 | |
| 35. |
If in database of employees, 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. | |
| 36. |
In ER diagrams, partial participation is shown by |
| A. | Single line |
| B. | Double line |
| C. | Double dotted line |
| D. | Triple dotted line |
| Answer» B. Double line | |
| 37. |
Partial key is differentiated by other keys in database by underlining key with |
| A. | Dotted line |
| B. | Double line |
| C. | Red line |
| D. | Red dotted line |
| Answer» B. Double line | |
| 38. |
In entity-relationship diagram, 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 | |
| 39. |
In traditional DBMS, application programs are considered to be part of domain of |
| A. | Database designs |
| B. | Software engineering |
| C. | Network design utility |
| D. | Utility designs |
| Answer» C. Network design utility | |
| 40. |
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 | |
| 41. |
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. | |
| 42. |
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. | |
| 43. |
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. | |
| 44. |
Weak entities and their identifying relationship in 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. | |
| 45. |
In ER diagrams, rectangles are used to denote |
| A. | Entity types |
| B. | Attribute types |
| C. | Key types |
| D. | Structure types |
| Answer» B. Attribute types | |
| 46. |
In entity-relationship diagrams, participating entities are represented by |
| A. | Oval shaped box |
| B. | Rectangular box |
| C. | Squared box |
| D. | Diamond shaped box |
| Answer» C. Squared box | |
| 47. |
Relationship type in which one attribute is migrated to N-side of relationship is classified as |
| A. | 4:N |
| B. | 3:N |
| C. | 1:N |
| D. | 2:N |
| Answer» D. 2:N | |
| 48. |
Entities that have key attributes to be distinct are considered as |
| A. | Weak entity |
| B. | Strong entity |
| C. | Single entity |
| D. | Foreign entity |
| Answer» C. Single entity | |
| 49. |
Schema which specifies that all database users requirements have been met is called |
| A. | High level conceptual schema |
| B. | High level logical schema |
| C. | High level structural schema |
| D. | High level detailed schema |
| Answer» B. High level logical schema | |
| 50. |
For a relationship type, participation constraints and cardinality ratio are considered together to make |
| A. | Intensive constraints |
| B. | Recursive constraints |
| C. | Composite constraints |
| D. | Structural constraints |
| Answer» E. | |