MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 26 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
State true or false: It is easier to delete a record from the fixed length records |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
The header in the slotted page structure does not contain which of the following data? |
| A. | The number of record entries in the header |
| B. | The end of free space in a block |
| C. | The size of all the records put together in the header |
| D. | An array containing location and size of each record |
| Answer» D. An array containing location and size of each record | |
| 3. |
The slotted page structure is used for _________ |
| A. | Organizing records in a block |
| B. | Organizing blocks in a database |
| C. | Deleting records from a block |
| D. | None of the mentioned |
| Answer» B. Organizing blocks in a database | |
| 4. |
An attribute(s) that is used to look up for records in a file is called a: |
| A. | Function key |
| B. | Catalog key |
| C. | Access key |
| D. | Search key |
| Answer» E. | |
| 5. |
If a node has K children in B tree, then the node contains exactly _______ keys. |
| A. | K2 |
| B. | K - 1 |
| C. | K + 1 |
| D. | √K |
| Answer» C. K + 1 | |
| 6. |
Consider a table that describes the customers:Customers(custid, name, gender, rating)The rating value is an integer in the range 1 to 5 and only two values (male and female) are recorded for gender. Consider the query “how many male customers have a rating of 5”? The best indexing mechanism appropriate for the query is |
| A. | Linear hashing |
| B. | Extendible hashing |
| C. | B+ tree |
| D. | Bit-mapped index |
| Answer» E. | |
| 7. |
In which of the following hash functions, do consecutive keys map to consecutive hash values? |
| A. | Division method |
| B. | Multiplication method |
| C. | Folding method |
| D. | Mid - square method |
| Answer» B. Multiplication method | |
| 8. |
In a file which contains 1 million records and the order of the tree is 100, then what is the maximum number of nodes to be accessed if B + tree index is used? |
| A. | 5 |
| B. | 4 |
| C. | 3 |
| D. | 10 |
| Answer» C. 3 | |
| 9. |
In linear hashing, if blocking factor bfr, loading factor I and file buckets N are known, the number of records will be |
| A. | cr = I + bfr + N |
| B. | r = I – bfr - N |
| C. | r = I + bfr - N |
| D. | r = I * bfr * N |
| Answer» E. | |
| 10. |
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are |
| A. | 5 |
| B. | 4 |
| C. | 1 |
| D. | 2 |
| Answer» B. 4 | |
| 11. |
Consider the following query :SELECT E.eno, COUNT(*)FROM Employees EGROUP BY E.enoIf an index on eno is available, the query can be answered by scanning only the index if |
| A. | the index is only hash and clustered |
| B. | the index is only B+ tree and clustered |
| C. | index can be hash or B+ tree and clustered or non-clustered |
| D. | index can be hash or B+ tree and clustered |
| Answer» D. index can be hash or B+ tree and clustered | |
| 12. |
Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index |
| A. | \(\frac{13n}{30}\) |
| B. | n/3 |
| C. | n/10 |
| D. | n/30 |
| Answer» B. n/3 | |
| 13. |
A hash table with 10 buckets with one slot per bucket is depicted in fig. The symbols, S1 and S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is |
| A. | 4 |
| B. | 5 |
| C. | 6 |
| D. | 3 |
| Answer» B. 5 | |
| 14. |
A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed searching an item that is not present is0S71S12 3S44S25 6S57 8S69S3 |
| A. | 4 |
| B. | 5 |
| C. | 6 |
| D. | 3 |
| Answer» C. 6 | |
| 15. |
A clustering index is defined on the fields which are of type _____ |
| A. | Non-key and ordering |
| B. | Non-key and non-ordering |
| C. | Key and ordering |
| D. | Key and non-ordering |
| Answer» B. Non-key and non-ordering | |
| 16. |
B+ Trees are considered BALANCED because |
| A. | the lengths of the paths from the root to all leaf nodes are all equal. |
| B. | the lengths of the paths from the root to all leaf nodes differ from each other by at most 1. |
| C. | the number of children of any two non-leaf sibling nodes differ by at most 1. |
| D. | the number of records in any two leaf nodes differ by at most 1. |
| Answer» B. the lengths of the paths from the root to all leaf nodes differ from each other by at most 1. | |
| 17. |
THE_HEADER_IN_THE_SLOTTED_PAGE_STRUCTURE_DOES_NOT_CONTAIN_WHICH_OF_THE_FOLLOWING_DATA??$ |
| A. | The number of record entries in the header |
| B. | The end of free space in a block |
| C. | The size of all the records put together in the header |
| D. | An array containing location and size of each record |
| Answer» D. An array containing location and size of each record | |
| 18. |
State_true_or_false:_It_is_easier_to_delete_a_record_from_the_fixed_length_records$ |
| A. | True |
| B. | False |
| Answer» C. | |
| 19. |
The slotted page structure is used for ________? |
| A. | Organizing records in a block |
| B. | Organizing blocks in a database |
| C. | Deleting records from a block |
| D. | None of the mentioned |
| Answer» B. Organizing blocks in a database | |
| 20. |
The linked list formed by the deleted records is called as ______ |
| A. | Delete list |
| B. | Free list |
| C. | Null list |
| D. | Non-existent list |
| Answer» C. Null list | |
| 21. |
State true or False: Variable length records cannot be implemented |
| A. | True |
| B. | False |
| Answer» C. | |
| 22. |
What does a null bitmap indicate? |
| A. | The database does not exist |
| B. | The record does not exist |
| C. | The attributes of a record do not have a value |
| D. | The attributes are missing from record |
| Answer» D. The attributes are missing from record | |
| 23. |
How can variable length records arise in a file |
| A. | Storage of multiple record types in a file |
| B. | Record types that allow variable lengths for one or more fields |
| C. | Record types that allow repeating fields, such as arrays or multisets |
| D. | All of the mentioned |
| Answer» E. | |
| 24. |
Which of the following is true about file header? |
| A. | It is allocated at the beginning of the file |
| B. | It has information about the file |
| C. | It generally contains the address of the first record in it |
| D. | All of the mentioned |
| Answer» E. | |
| 25. |
The devices that store a lot of optical disks are called as |
| A. | Optical reservoirs |
| B. | Jukeboxes |
| C. | Karaoke machines |
| D. | Sequential access machines |
| Answer» C. Karaoke machines | |
| 26. |
What is the approximate storage capacity of CDs in MB |
| A. | 300 |
| B. | 700 |
| C. | 1100 |
| D. | 1500 |
| Answer» C. 1100 | |