Database Management System MCQs with Answers
Practice important Database Management System MCQs with answers and explanations.
Chapter: 34
Q581:
Which RAID level uses byte-level striping across several drives?
A. RAID-0
B. RAID-1
C. RAID-3
D. RAID-4
Correct Answer:
C
Chapter: 34
Q582:
What is a common feature of optical disks?
A. They use magnetic encoding
B. They can be erased and rewritten multiple times
C. They use lasers to read and write data
D. They are the fastest type of storage
Correct Answer:
C
Chapter: 34
Q583:
What type of access does a magnetic tape device provide?
A. Random access
B. Sequential access
C. Direct access
D. Parallel access
Correct Answer:
B
Chapter: 35
Q584:
What is the main benefit of using a fixed-size record structure in file organization?
A. Ease of adding records
B. Ease of searching records
C. Batch processing of the entire file
D. Ease of deleting records
Correct Answer:
C
Chapter: 35
Q585:
What is the key characteristic of a sequential file organization?
A. Records can be accessed randomly
B. Records are ordered by a key field
C. Records are stored in an indexed format
D. Records are not stored in any particular order
Correct Answer:
B
Chapter: 35
Q586:
What type of file organization uses an index to improve search speed?
A. Sequential file organization
B. Direct file organization
C. Indexed sequential file organization
D. Relative file organization
Correct Answer:
C
Chapter: 35
Q587:
How does indexed sequential file organization speed up key searches?
A. By performing a linear search across all records
B. By using a single-level index to locate records
C. By storing records in a random order
D. By reducing the size of the records
Correct Answer:
B
Chapter: 35
Q588:
In indexed sequential file organization, what is typically used to mark intervals of data records?
A. Key-pointer pairs
B. A direct file pointer
C. An index file
D. Sequential record numbering
Correct Answer:
C
Chapter: 35
Q589:
Which type of index contains an entry for each record in the main file?
A. Dense index
B. Partial index
C. Secondary index
D. Sparse index
Correct Answer:
A
Chapter: 35
Q590:
In a file with 1,000 records, how many key comparisons are needed on average using a sequential organization?
A. 100
B. 500
C. 1000
D. 200
Correct Answer:
B
Chapter: 35
Q591:
What happens when records are added to a fixed-size record file?
A. The entire file must be reorganized
B. The index is updated only
C. The new record is added without any changes
D. Only the transaction file is updated
Correct Answer:
A
Chapter: 35
Q592:
When defining an indexed sequential file, how many keys are recommended for efficiency?
A. 0 to 255
B. 1 to 10
C. 1 to 8
D. 5 to 10
Correct Answer:
C
Chapter: 35
Q593:
Fill in the blank: In indexed sequential file organization, a key search involves comparing the search key with the index keys to find the highest index key _______ the search key.
A. preceding
B. after
C. matching
D. during
Correct Answer:
A
Chapter: 35
Q594:
Fill in the blank: In direct access file organization, an index file helps to obtain the address of the block that contains the required _______.
A. record
B. identifier
C. key
D. field
Correct Answer:
A
Chapter: 36
Q595:
What is the purpose of a hash function in hashing techniques?
A. To sort records in sequential order
B. To compute the address of a data item
C. To create a new data record
D. To index records by their key value
Correct Answer:
B
Chapter: 36
Q596:
In hashing, what is a bucket?
A. A storage unit for all records
B. A function that computes addresses
C. A key-value pair in a hash table
D. A list of all search keys
Correct Answer:
A
Chapter: 36
Q597:
What happens when two search keys map to the same bucket address?
A. A collision occurs and both records are placed in the same bucket
B. A new bucket is created for the second record
C. The first record is overwritten by the second record
D. The search key is discarded
Correct Answer:
A
Chapter: 36
Q598:
Which technique involves adding records to a list attached to the slot where a collision occurs?
A. Linear probing
B. Overflow areas
C. Chaining
D. Re-hashing
Correct Answer:
C
Chapter: 36
Q599:
What is a perfect hashing function?
A. A function that maps keys to a small number of addresses
B. A function that maps each key to a unique integer
C. A function that maps most keys to unique integers
D. A function that uses multiple hash operations
Correct Answer:
B
Chapter: 36
Q600:
What is the major disadvantage of linear probing in hashing?
A. It can lead to clustering of keys
B. It increases the number of collisions
C. It slows down the hashing process
D. It requires additional memory
Correct Answer:
A