MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 105 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
RAID level 5 refers to? |
| A. | Disk arrays with striping at the level of blocks |
| B. | Disk mirroring with block striping |
| C. | Memory style error correcting code |
| D. | Block interleaved distributed parity |
| Answer» E. | |
| 2. |
Which of the following need to be stored in the data dictionary? |
| A. | Name of the relation |
| B. | Domains and lengths of attributes |
| C. | Integrity constraints |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
One approach to standardization storing of data? |
| A. | MIS |
| B. | Structured programming |
| C. | CODASYL specification |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
What is hashing file organization? |
| A. | Any record can be placed wherever there is a space for the record |
| B. | Records are stored in a sequential order according to a search key |
| C. | A hash function is computed on some attribute and that decides the block |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
State true or false: It is easier to delete a record from the fixed length records |
| A. | True |
| B. | False |
| C. | May be |
| D. | Can't say |
| Answer» C. May be | |
| 6. |
What is the full form of LRU (in buffer replacement strategy)? |
| A. | Least Reactive User |
| B. | Least Recently Used |
| C. | Least Read URL |
| D. | Lowest Reading User |
| Answer» C. Least Read URL | |
| 7. |
RAID level 2 refers to? |
| A. | Disk arrays with striping at the level of blocks |
| B. | Disk mirroring with block striping |
| C. | Memory style error correcting code |
| D. | Block interleaved distributed parity |
| Answer» D. Block interleaved distributed parity | |
| 8. |
In Flash memory, the erase operation can be performed on a number of pages, called an _______ at once, and takes about 1 to 2 milliseconds. |
| A. | Delete block |
| B. | Erase block |
| C. | Flash block |
| D. | Read block |
| Answer» C. Flash block | |
| 9. |
Which of the factors need not be taken into consideration while choosing a RAID level? |
| A. | Monetary cost |
| B. | I/O requirements |
| C. | Performance when the disk has failed |
| D. | None of the mentioned |
| Answer» E. | |
| 10. |
Optical disk _______ systems contain a few drives and numerous disks that can be loaded into one of the drives automatically (by a robot arm) on demand. |
| A. | Tape Storage |
| B. | Jukebox |
| C. | Flash memory |
| D. | All of the mentioned |
| Answer» C. Flash memory | |
| 11. |
RAID level 1 refers to? |
| A. | Disk arrays with striping at the level of blocks |
| B. | Disk mirroring with block striping |
| C. | Memory style error correcting code |
| D. | Block interleaved distributed parity |
| Answer» C. Memory style error correcting code | |
| 12. |
Tape storage is referred to as __________ storage. |
| A. | Direct-access |
| B. | Random-access |
| C. | Sequential-access |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 13. |
Which is the cheapest memory device in terms of costs/bit ? |
| A. | Semiconductor memory |
| B. | Magnetic disks |
| C. | Compact disks |
| D. | Magnetic tapes |
| Answer» D. Magnetic tapes | |
| 14. |
The management information system (MIS) structure with one main computersystem is called a |
| A. | Hierarchical MIS structure |
| B. | Distributed MIS structure |
| C. | Centralized MIS structure |
| D. | Decentralized MIS structure |
| Answer» D. Decentralized MIS structure | |
| 15. |
The technique where the blocks which have been used are replaced is called |
| A. | Replacement strategy |
| B. | Forced strategy |
| C. | Crash recovery system |
| D. | Most recently used |
| Answer» E. | |
| 16. |
In the buffer where there is no space for another block, the bllock can be inserted using |
| A. | Pinned block strategy |
| B. | Forced output block |
| C. | Buffer replacement strategy |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 17. |
Considering storage capacity, the 2000 bytes of data are equal to |
| A. | 1 tera bytes |
| B. | 2 kilobytes |
| C. | 1 mega bytes |
| D. | 2 mega bytes |
| Answer» C. 1 mega bytes | |
| 18. |
In external hashing for files of disk, the pointers which contain record position and block address within the block are classified as |
| A. | position pointers |
| B. | address pointers |
| C. | block pointers |
| D. | record pointers |
| Answer» E. | |
| 19. |
In high level programs, the command which is used to copy the current record from buffer to variable of user program is classified as |
| A. | read command |
| B. | find next command |
| C. | modify command |
| D. | insert command |
| Answer» B. find next command | |
| 20. |
If the global depth in extendible hashing is equal to local depth then the operation must be performed in directory array is |
| A. | adding |
| B. | subtracting |
| C. | halving |
| D. | doubling |
| Answer» E. | |
| 21. |
In disks, the tracks having same diameter on different surfaces are classified as |
| A. | sector |
| B. | blocks |
| C. | track |
| D. | cylinder |
| Answer» E. | |
| 22. |
A data dictionary is created when a __________ created. |
| A. | Instance |
| B. | Segment |
| C. | Database |
| D. | Dictionary |
| Answer» D. Dictionary | |
| 23. |
What is a search key in sequential file organization? |
| A. | A number assigned to each record |
| B. | Necessarily the primary key |
| C. | Any attribute or a set of attributes |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 24. |
___________________ frees the space occupied by a block as soon as the final tuple of that block has been processed. |
| A. | Replacement strategy |
| B. | Forced strategy |
| C. | Toss immediate strategy |
| D. | Most recently used |
| Answer» D. Most recently used | |
| 25. |
Data dictionary is also called as ________ |
| A. | Data log |
| B. | System log |
| C. | System catalog |
| D. | System database log |
| Answer» D. System database log | |
| 26. |
What is a multitable clustering file organization? |
| A. | It stores related records of two or more relations in each block |
| B. | It stores related data about the relations in each block |
| C. | It links each and every block by introducing an external attribute |
| D. | None of the mentioned |
| Answer» B. It stores related data about the relations in each block | |
| 27. |
In high level programs, the command which sets the pointer of file to the beginning of that file is classified as |
| A. | modify command |
| B. | open command |
| C. | locate command |
| D. | reset command |
| Answer» E. | |
| 28. |
What is sequential file organization? |
| A. | Any record can be placed wherever there is a space for the record |
| B. | Records are stored in a sequential order according to a search key |
| C. | A hash function is computed on some attribute and that decides the block |
| D. | None of the mentioned |
| Answer» C. A hash function is computed on some attribute and that decides the block | |
| 29. |
An Oracle object type has two parts the _________ and__________ |
| A. | Instance and body |
| B. | Segment and blocks |
| C. | Specification and body |
| D. | Body and segment |
| Answer» D. Body and segment | |
| 30. |
In case the buffer manager do not write the blocks properly then the buffer manager uses |
| A. | Replacement strategy |
| B. | Forced strategy |
| C. | Crash recovery system |
| D. | Both Replacement and Forced strategy |
| Answer» D. Both Replacement and Forced strategy | |
| 31. |
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 | |
| 32. |
The technique which involves the arithmetic function or logical function is classified as |
| A. | clustering technique |
| B. | folding technique |
| C. | spanning technique |
| D. | hashing technique |
| Answer» C. spanning technique | |
| 33. |
An Oracle __________ is a set of tables and views that are used as a read-only reference about the database. |
| A. | Database dictionary |
| B. | Dictionary table |
| C. | Data dictionary |
| D. | Dictionary |
| Answer» D. Dictionary | |
| 34. |
The subsystem responsible for the allocation of buffer space is called as _______ |
| A. | Buffer allocator |
| B. | Buffer manager |
| C. | Buffer enhancer |
| D. | Buffer intermediary |
| Answer» C. Buffer enhancer | |
| 35. |
Metadata about the relations are stored in ________ |
| A. | File header |
| B. | Data dictionary |
| C. | Data query |
| D. | Data analyser |
| Answer» C. Data query | |
| 36. |
The time required to position write or read track on correct place is classified as |
| A. | reel time |
| B. | seek time |
| C. | rotational delay |
| D. | transfer time of block |
| Answer» C. rotational delay | |
| 37. |
The information about data in a database is called _______ |
| A. | Metadata |
| B. | Hyper data |
| C. | Tera data |
| D. | None of the mentioned |
| Answer» B. Hyper data | |
| 38. |
What is heap file organization? |
| A. | Any record can be placed wherever there is a space for the record |
| B. | Records are stored in a sequential order according to a search key |
| C. | A hash function is computed on some attribute and that decides the block |
| D. | None of the mentioned |
| Answer» B. Records are stored in a sequential order according to a search key | |
| 39. |
______________ partitiones data and parity among all N+1 disks, instead of storing data in N-disks and parity in one disk. |
| A. | Block interleaved parity |
| B. | Block interleaved distributed parity |
| C. | Bit parity |
| D. | Bit interleaved parity |
| Answer» C. Bit parity | |
| 40. |
The highest level in the hierarchy of data organization is called |
| A. | Data bank |
| B. | Data base |
| C. | Data file |
| D. | Data record |
| Answer» C. Data file | |
| 41. |
Statement 1: Cache storage is very fastStatement 2: Cache storage is very cheap |
| A. | Both the statements are true |
| B. | Statement 1 is true but statement 2 is false |
| C. | Statement 1 is false but statement 2 is true |
| D. | Both the statements are false |
| Answer» C. Statement 1 is false but statement 2 is true | |
| 42. |
What is buffering? |
| A. | The blocks read from disk are directly accessed |
| B. | The blocks read from disk are temporarily stored in a memory |
| C. | The blocks read from disk are organized in a particular fashion to cater requests. |
| D. | None of the mentioned |
| Answer» C. The blocks read from disk are organized in a particular fashion to cater requests. | |
| 43. |
Which of these data models is an extension of relational data model? |
| A. | Object-oriented data model |
| B. | Object-relational data model |
| C. | Semi structured data model |
| D. | None of the mentioned |
| Answer» C. Semi structured data model | |
| 44. |
The range of capacity for the number of tracks is |
| A. | 80 to 120 Kbytes |
| B. | 10 to 150 Kbytes |
| C. | 20 to 80 Kbytes |
| D. | 50 to 100 Kbytes |
| Answer» C. 20 to 80 Kbytes | |
| 45. |
The storage media that is operated directly from computer's central processing unit is considered as |
| A. | primary storage |
| B. | secondary storage |
| C. | tertiary storage |
| D. | all of above |
| Answer» B. secondary storage | |
| 46. |
The technique which is used to retrieve data from disk in form of continuous blocks of stream and eliminates seek time is classified as |
| A. | concurrent buffering |
| B. | parallel buffering |
| C. | single buffering |
| D. | double buffering |
| Answer» E. | |
| 47. |
The time period required to transfer blocks in consecutive order is classified as |
| A. | reel time |
| B. | seek time |
| C. | rotational delay |
| D. | bulk transfer rate |
| Answer» E. | |
| 48. |
The reserved area that holds one block in main storage is classified as |
| A. | disk address |
| B. | buffer address |
| C. | hardware address |
| D. | software address |
| Answer» C. hardware address | |
| 49. |
The time which is needed for consecutive blocks transferring is classified as |
| A. | rotational delay |
| B. | bulk transfer rate |
| C. | reel time |
| D. | seek time |
| Answer» C. reel time | |
| 50. |
Considering the disks, the command with which the buffer is copied into the block of disk is classified as |
| A. | write command |
| B. | read command |
| C. | paste command |
| D. | cut command |
| Answer» B. read command | |