MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 99 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
What is the default “SORT” order for a SQL? |
| A. | Ascending |
| B. | Descending |
| C. | As specified by the user |
| D. | None of the mentioned |
| Answer» B. Descending | |
| 52. |
A selection of the form giving all the records not satisfying simple individual conditions is ______ |
| A. | Conjunctive selection |
| B. | Disjunctive selection |
| C. | Negation |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 53. |
The files from which algorithms are selected for records are called |
| A. | scan files |
| B. | spanned files |
| C. | non dense files |
| D. | indexed files |
| Answer» B. spanned files | |
| 54. |
The procedure of sorting the algorithms for larger records that does not fit in the main memory and are stored on disk is classified as |
| A. | parser sorting |
| B. | external sorting |
| C. | internal sorting |
| D. | secondary sorting |
| Answer» C. internal sorting | |
| 55. |
When two inputs that we desire to pipeline into the join are not already sorted it is the _____________ technique. |
| A. | Hash join |
| B. | Buffer join |
| C. | double-pipelined hash join |
| D. | double-pipelined join |
| Answer» E. | |
| 56. |
Which of the following functions does an iterator not provide |
| A. | Open() |
| B. | Next() |
| C. | Close() |
| D. | Wait() |
| Answer» E. | |
| 57. |
The full form of DDL is |
| A. | Dynamic Data Language |
| B. | Detailed Data Language |
| C. | Data Definition Language |
| D. | Data Derivation Language |
| Answer» D. Data Derivation Language | |
| 58. |
If a query is optimized without providing specific values for its parameters the technique is called __________ |
| A. | Complex query handling |
| B. | Multi query optimization |
| C. | Complex query optimization |
| D. | Parametric query optimization |
| Answer» E. | |
| 59. |
The Statement that requests a retrieval of information from database is called as ________. |
| A. | Manipulation Statement |
| B. | Query |
| C. | Control Statement |
| D. | None of these |
| Answer» C. Control Statement | |
| 60. |
________ it requires a user to specify what data are needed without specifying how to get those data. |
| A. | Procedural DML |
| B. | Non Procedural DML |
| C. | Abstract DML |
| D. | None of the above |
| Answer» C. Abstract DML | |
| 61. |
If on every legal database instant, the two expressions generate the same set of tuples, the expressions are called as |
| A. | Equal |
| B. | Equivalent |
| C. | Similar |
| D. | Identical |
| Answer» C. Similar | |
| 62. |
The procedure of choosing a suitable query out of all the queries is classified as |
| A. | query optimization |
| B. | parser optimization |
| C. | processing optimization |
| D. | all of above |
| Answer» E. | |
| 63. |
The files that can fit in available buffer space in phase of external sorting must be read into |
| A. | multilevel indexes |
| B. | search nodes |
| C. | main memory |
| D. | processing unit |
| Answer» D. processing unit | |
| 64. |
Which view that contains more than one table in the top-level FROM clause of the SELECT statement: |
| A. | Join view |
| B. | Datable join view |
| C. | Updatable join view |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 65. |
The processor used to run the code of the queries of interpreted mode or compiled mode is classified as |
| A. | runtime database processor |
| B. | query optimization processor |
| C. | parser runtime processor |
| D. | query graphic processor |
| Answer» B. query optimization processor | |
| 66. |
Caching and reuse of query plans is called as ________ |
| A. | Query caching |
| B. | Plan caching |
| C. | Plan memorizing |
| D. | None of the mentioned |
| Answer» C. Plan memorizing | |
| 67. |
Reducing the complexity of complex queries by similarly handling sub-queries is known as ______ |
| A. | Complex query handling |
| B. | Multi query optimization |
| C. | Complex query optimization |
| D. | Parametric query optimization |
| Answer» C. Complex query optimization | |
| 68. |
________ it requires a user to specify what data are needed and how to get those data. |
| A. | Procedural DML |
| B. | Non Procedural DML |
| C. | Abstract DML |
| D. | None of the above |
| Answer» B. Non Procedural DML | |
| 69. |
State true or false: Multiple equivalence rules can be used one after the other on a query |
| A. | True |
| B. | False |
| C. | May be |
| D. | Can't say |
| Answer» B. False | |
| 70. |
Storage structure and Access methods used by database system are specified using ____________. |
| A. | Data Storage and Definition Language |
| B. | Data Dictionary |
| C. | Data Manipulation Language |
| D. | None of these |
| Answer» B. Data Dictionary | |
| 71. |
What technique is used for the evaluation of a query with a nested sub query? |
| A. | Caching |
| B. | Decorrelated evaluation |
| C. | Correlated evaluation |
| D. | Time based evaluation |
| Answer» D. Time based evaluation | |
| 72. |
Which of the following is a multi-query optimization technique |
| A. | Shared scan optimization |
| B. | Parametric query optimization |
| C. | Index optimization |
| D. | All of the mentioned |
| Answer» B. Parametric query optimization | |
| 73. |
A sequence of primitive operations that can be used to evaluate a query are called as __________ |
| A. | Query evaluation algebra |
| B. | Query evaluation plan |
| C. | Query evaluation primitive |
| D. | Query evaluation engine |
| Answer» C. Query evaluation primitive | |
| 74. |
A selection of the form satisfying the union of all records satisfying individual simple conditions is |
| A. | Conjunctive selection |
| B. | Disjunctive selection |
| C. | Negation |
| D. | None of the mentioned |
| Answer» C. Negation | |
| 75. |
Data Manipulation Languages are used for |
| A. | Delete Information |
| B. | Insert Information into Database |
| C. | Retrieve Information from Database |
| D. | All of these |
| Answer» E. | |
| 76. |
Size estimation can be done for which of the following processes? |
| A. | Projection |
| B. | Aggregation |
| C. | Set operation |
| D. | All of the mentioned |
| Answer» E. | |
| 77. |
Search algorithms that use an index are referred to as _________ |
| A. | Index scans |
| B. | Search scans |
| C. | Primary scans |
| D. | Equality scans |
| Answer» B. Search scans | |
| 78. |
The iterator maintains the __________ of its execution in between calls, so that successive next() requests receive successive result tuples. |
| A. | State |
| B. | Transition |
| C. | Rate |
| D. | Block |
| Answer» B. Transition | |
| 79. |
DML is provided for |
| A. | Description of logical structure of database |
| B. | Addition of new structures in the database system |
| C. | Manipulation & processing of database |
| D. | Definition of physical structure of database system |
| Answer» D. Definition of physical structure of database system | |
| 80. |
The DBMS language component which can be embedded in a program is |
| A. | The data definition language (DDL) |
| B. | The data manipulation language (DML) |
| C. | The database administrator (DBA) |
| D. | A query language |
| Answer» C. The database administrator (DBA) | |
| 81. |
The procedure of storing the data on a medium of storage which is controlled by database management system is considered as |
| A. | retrieving the database |
| B. | controlling the database |
| C. | constructing the database |
| D. | manipulating the database |
| Answer» D. manipulating the database | |
| 82. |
The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is |
| A. | A2 |
| B. | A4 |
| C. | A5 |
| D. | A6 |
| Answer» E. | |
| 83. |
Relational schema and other metadata about relations are stored in a structure called the ____________ . |
| A. | Metadata |
| B. | Catalog |
| C. | Log |
| D. | Data Dictionary |
| Answer» E. | |
| 84. |
Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold:AB->CDDE->PC->EP->CB->GThe relation schema R is |
| A. | in BCNF |
| B. | in 3NF, but not in BCNF |
| C. | in 2NF, but not in 3NF |
| D. | not in 2NF |
| Answer» E. | |
| 85. |
The planning program which consolidates the functions of organizations such as sales, marketing, human resources and finance is classified as |
| A. | enterprise resource planning |
| B. | structural resource planning |
| C. | spatial resource planning |
| D. | logical resource planning |
| Answer» B. structural resource planning | |
| 86. |
Which of the following can be implemented? |
| A. | Conjunctive selection using one index |
| B. | Conjunctive selection using composite index |
| C. | Conjunctive selection by intersection of identifiers |
| D. | All of the mentioned |
| Answer» E. | |
| 87. |
The standardized types of database queries and methods of updating database are called |
| A. | beta transactions |
| B. | canned transactions |
| C. | occasional transactions |
| D. | conceptual transactions |
| Answer» C. occasional transactions | |
| 88. |
The usage of two buffers, with one continuing execution of the algorithm while the other is written is called as __________ |
| A. | Double execution |
| B. | Multi tasking |
| C. | Double buffering |
| D. | Double algorithm |
| Answer» D. Double algorithm | |
| 89. |
There are _______ types of Data Manipulation Languages. |
| A. | 3 |
| B. | 2 |
| C. | 1 |
| D. | 4 |
| Answer» C. 1 | |
| 90. |
Which of the following set operations does the selection operation distribute over? |
| A. | Union |
| B. | Intersection |
| C. | Difference |
| D. | All of the mentioned |
| Answer» E. | |
| 91. |
Tuples are generated ___________ in producer-driven pipelining, they are generated ________ on demand, in demand-driven pipelining. |
| A. | Lazily, Eagerly |
| B. | Eagerly, Lazily |
| C. | Slowly, Eagerly |
| D. | Eagerly, Slowly |
| Answer» C. Slowly, Eagerly | |
| 92. |
Cursor that reflects the changes made to the database table even after the result set is returned |
| A. | Static |
| B. | Dynamic |
| C. | FORWARD_ONLY |
| D. | Keyset |
| Answer» C. FORWARD_ONLY | |
| 93. |
Problems occurs if we don’t implement proper locking strategy |
| A. | Dirty reads |
| B. | Phantom reads |
| C. | Lost updates |
| D. | Unrepeatable reads |
| Answer» C. Lost updates | |
| 94. |
Which of the following creates a virtual relation for storing the query ? |
| A. | Function |
| B. | View |
| C. | Procedure |
| D. | None of the mentioned |
| Answer» C. Procedure | |
| 95. |
Which of the following is a physical storage media ? |
| A. | Tape Storage |
| B. | Optical Storage |
| C. | Flash memory |
| D. | All of the mentioned |
| Answer» E. | |
| 96. |
Which of the following is correct regarding Aggregate functions? |
| A. | it takes a list of values and return a single values as result |
| B. | it takes a list of values and return a list of values as result |
| C. | it takes a single value and returns a list of values as result |
| D. | it takes a single value and returns a single value as result |
| Answer» B. it takes a list of values and return a list of values as result | |
| 97. |
Select course_idfrom physics_fall_2009where building= ’Watson’;Here the tuples are selected from the view.Which one denotes the view ? |
| A. | Course_id |
| B. | Watson |
| C. | Building |
| D. | physics_fall_2009 |
| Answer» D. physics_fall_2009 | |
| 98. |
Which of the following option is use to retrieval of data? |
| A. | Stack |
| B. | Data Structure |
| C. | Linked list |
| D. | Query |
| Answer» E. | |
| 99. |
Which of the following is the syntax for views where v is view name ? |
| A. | Create view v as “query name”; |
| B. | Create “query expression” as view; |
| C. | Create view v as “query expression”; |
| D. | Create view “query expression”; |
| Answer» D. Create view “query expression”; | |