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 E-R Diagram total participation is represented by |
| A. | Dashed lines |
| B. | Triangle |
| C. | double lines |
| D. | single line |
| Answer» D. single line | |
| 2. |
____________ joins are SQL server default |
| A. | none |
| B. | equi |
| C. | inner |
| D. | outer |
| Answer» D. outer | |
| 3. |
Referential integrity controls relationships between _________ |
| A. | operations of an object |
| B. | tables in a database |
| C. | attributes in a table |
| D. | instances of a class |
| Answer» C. attributes in a table | |
| 4. |
When an E-R diagram is mapped to tables, the representation is redundant for ____________ |
| A. | strong relationship sets |
| B. | strong entity sets |
| C. | weak relationship sets |
| D. | weak entity sets |
| Answer» D. weak entity sets | |
| 5. |
The graphical representation of a query is ________. |
| A. | directed graph |
| B. | Query Tree |
| C. | graph |
| D. | B-Tree |
| Answer» C. graph | |
| 6. |
A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. |
| A. | second |
| B. | fourth |
| C. | first |
| D. | third |
| Answer» E. | |
| 7. |
An advantage of the database management approach is ____________ |
| A. | none of the above |
| B. | data is integrated and can be accessed by multiple programs |
| C. | data redundancy increases |
| D. | data is dependent on programs |
| Answer» C. data redundancy increases | |
| 8. |
The physical location of a record is determined by a mathematical formula that transforms a file key into a record location is _________ |
| A. | Hashed File |
| B. | Sequential file. |
| C. | B-Tree File |
| D. | Indexed File |
| Answer» B. Sequential file. | |
| 9. |
Versatile report generator can provide ? |
| A. | Subtotal |
| B. | ALL |
| C. | Columnar totals |
| D. | Calculation |
| Answer» C. Columnar totals | |
| 10. |
To select all column from the table the syntax is ____________ |
| A. | select all from table_name |
| B. | select * from table_name |
| C. | none |
| D. | select from table_name |
| Answer» C. none | |
| 11. |
Data independence means ____________ |
| A. | both (B) and (C) |
| B. | programs are not dependent on the logical attributes of data |
| C. | programs are not dependent on the physical attributes of data |
| D. | data is defined separately and not included in programs |
| Answer» B. programs are not dependent on the logical attributes of data | |
| 12. |
The relational model feature is that there _________ |
| A. | is much more data independence than some other database models |
| B. | are tables with many dimensions |
| C. | is no need for primary key data |
| D. | are explicit relationships among records |
| Answer» B. are tables with many dimensions | |
| 13. |
If the closure of an attribute set is the entire relation then the attribute set is a |
| A. | not a key |
| B. | primary key |
| C. | candidate key |
| D. | superkey |
| Answer» E. | |
| 14. |
Relational Algebra does not have |
| A. | Projection operator. |
| B. | Division operator. |
| C. | Selection operator. |
| D. | Aggregation operators. |
| Answer» E. | |
| 15. |
The process of reading a database schema and producing a data model from that schema is known as _________ |
| A. | None of the above is correct. |
| B. | reverse engineering. |
| C. | database design. |
| D. | data modeling. |
| Answer» C. database design. | |
| 16. |
_________ table store information about database or about the system |
| A. | none |
| B. | system |
| C. | nested |
| D. | SQL |
| Answer» C. nested | |
| 17. |
The cost of reading and writing temporary files while evaluating a query can be reduced by _________ |
| A. | none of the above |
| B. | join ordering |
| C. | pipelining |
| D. | building indices |
| Answer» D. building indices | |
| 18. |
Which one is true statement ? |
| A. | Locking prevents non – serializable schedules. |
| B. | An exclusive lock on data item X is granted even if a shared lock is already held on X. |
| C. | With finer degree of granularity of locking a high degree of concurrency is possible. |
| D. | Locking cannot take place at field level. |
| Answer» D. Locking cannot take place at field level. | |
| 19. |
It is better to use files than a DBMS when there are _________ |
| A. | Multiple users wish to access the data. |
| B. | All of the above. |
| C. | Stringent real-time requirements. |
| D. | Complex relationships among data. |
| Answer» B. All of the above. | |
| 20. |
The DBMS language component which can be embedded in a program is ____________ |
| A. | A query language |
| B. | The database administrator (DBA) |
| C. | The data manipulation language (DML) |
| D. | The data definition language (DDL) |
| Answer» D. The data definition language (DDL) | |
| 21. |
Relations produced from an E-R model will always be |
| A. | Fourth normal form |
| B. | Third normal form |
| C. | Second normal form |
| D. | First normal form |
| Answer» E. | |
| 22. |
The code that relational database management systems use to perform their database task is referred to as _________ |
| A. | Sequel Server |
| B. | OLAP |
| C. | SQL |
| D. | QBE |
| Answer» D. QBE | |
| 23. |
A transaction is in __________ state after the final statement has been executed. |
| A. | none of the above |
| B. | committed |
| C. | active |
| D. | partially committed |
| Answer» C. active | |
| 24. |
A DBMS query language is designed to ____________ |
| A. | all of the above |
| B. | specify the structure of a database |
| C. | support in the development of complex applications software |
| D. | support end users who use English-like commands |
| Answer» B. specify the structure of a database | |
| 25. |
An entity set that does not have sufficient attributes to form a primary key is a |
| A. | weak entity set |
| B. | primary entity set |
| C. | strong entity set |
| D. | simple entity set |
| Answer» B. primary entity set | |
| 26. |
Before any changes to database structure are attempted one should first _________ |
| A. | All of the above should be done. |
| B. | create a complete backup of the operational database only. |
| C. | test any changes on a test database only. |
| D. | clearly understand the current structure and contents of the database only. |
| Answer» B. create a complete backup of the operational database only. | |
| 27. |
The keyword to eliminate duplicate rows from the query result in SQL is |
| A. | None of the above |
| B. | UNIQUE |
| C. | NO DUPLICATE |
| D. | DISTINCT |
| Answer» C. NO DUPLICATE | |
| 28. |
The ____________ is essentially used to search for patterns in target string. |
| A. | Null predicate |
| B. | out predicate |
| C. | Like predicate |
| D. | in predicate |
| Answer» D. in predicate | |
| 29. |
The RDBMS terminology for a row is _________ |
| A. | degree |
| B. | attribute |
| C. | relation |
| D. | tuple |
| Answer» E. | |
| 30. |
Data are ________ in client/server computing. |
| A. | sent in complete copies for the client to filter and sort |
| B. | sent in very large sections to save processing time |
| C. | never sent to the client machine |
| D. | sent only upon the client's request |
| Answer» E. | |
| 31. |
A set of possible data values is called ____________ |
| A. | degree |
| B. | domain |
| C. | attribute |
| D. | tuple |
| Answer» C. attribute | |
| 32. |
A list consists of last names, first names, addresses and pin codes. If all people in the list have the same last name and same pin code a useful key would be ____________ |
| A. | the last name |
| B. | none of these |
| C. | the pin code |
| D. | the compound key first name and last name |
| Answer» E. | |
| 33. |
Which of the following is another name for weak entity? |
| A. | Owner |
| B. | All of the above |
| C. | Child |
| D. | Dominant |
| Answer» D. Dominant | |
| 34. |
The _________ operator preserves unmatched rows of the relations being joined. |
| A. | Outer join |
| B. | Union join |
| C. | Inner join |
| D. | union |
| Answer» B. Union join | |
| 35. |
Which of the following relational algebra operations do not require the participating tables to be union-compatible? |
| A. | Join |
| B. | Difference |
| C. | Intersection |
| D. | Union |
| Answer» B. Difference | |
| 36. |
The overall design of a database is called ____________ |
| A. | The screen of database |
| B. | View of the database |
| C. | Scheme of the database |
| D. | Structure of the database |
| Answer» D. Structure of the database | |
| 37. |
The data model that is produced from reverse engineering is _________ |
| A. | an internal model |
| B. | None of the above is correct |
| C. | a conceptual model |
| D. | a logical model |
| Answer» C. a conceptual model | |
| 38. |
Changing cardinalities in a database is ____________ |
| A. | is impossible to do, so a new database must be constructed and the data moved into it. |
| B. | a database design task that never occurs. |
| C. | a rare database design task, but does occur. |
| D. | a common database design task. |
| Answer» E. | |
| 39. |
Union operator is a ____________ |
| A. | Not an operator |
| B. | Binary Operator |
| C. | Ternary Operator |
| D. | Unary Operator |
| Answer» C. Ternary Operator | |
| 40. |
The method of access which uses key transformation is known as _________ |
| A. | sequential |
| B. | random |
| C. | hash |
| D. | direct |
| Answer» D. direct | |
| 41. |
SET concept is used in _________ |
| A. | None of these |
| B. | Relational Model |
| C. | Hierarchical Model |
| D. | Network Model |
| Answer» E. | |
| 42. |
Which one of the following is provided by a data dictionary ? |
| A. | Database structure data |
| B. | Functional data |
| C. | User data |
| D. | Sorted data |
| Answer» B. Functional data | |
| 43. |
The database environment has all of the following components except ____________ |
| A. | database administrator |
| B. | database |
| C. | separate files |
| D. | users |
| Answer» E. | |
| 44. |
_________ clause is an additional filter that is applied to the result. |
| A. | Group by |
| B. | order by |
| C. | Having |
| D. | select |
| Answer» D. select | |
| 45. |
Which one of the following is a direct benefit of database normalization? |
| A. | reduced data redundancy |
| B. | reduced I/O for most queries |
| C. | smaller number of tables |
| D. | higher query processing efficiency |
| Answer» B. reduced I/O for most queries | |
| 46. |
What is a disjoint less constraint? |
| A. | An entity can be joined with another entity in the same level entity set. |
| B. | The database must contain an unmatched foreign key value. |
| C. | The same entity may belong to more than one level. |
| D. | It requires that an entity belongs to no more than one level entity set. |
| Answer» E. | |
| 47. |
In an E-R diagram double lines indicate |
| A. | Multiple participation |
| B. | None of the above |
| C. | Total participation |
| D. | Cardinality |
| Answer» D. Cardinality | |
| 48. |
An association of several structure of a data base can be expressed graphically by? |
| A. | Field |
| B. | Relationship |
| C. | Record |
| D. | Tuple |
| Answer» C. Record | |
| 49. |
What is full form of ODBC ? |
| A. | Oral Database Connectivity. |
| B. | Open Database Connectivity. |
| C. | Object Database Connectivity. |
| D. | Oracle Database Connectivity. |
| Answer» C. Object Database Connectivity. | |
| 50. |
It is an abstraction through which relationships are treated as higher level entities |
| A. | Specialization |
| B. | Inheritance |
| C. | Generalization |
| D. | Aggregation |
| Answer» E. | |