Database Management System Set 29
Computer Science Engineering (CSE),
Bachelor of Science in Computer Science FY (BSc CS),
Bachelor of Science in Computer Science SY (BSc CS),
Bachelor of Science in Information Technology SY (BSc IT),
Bachelor of Computer Applications (BCA),
Bachelor of Business Administration in Computer Applications (BBA [CA]),
Bachelor of Science in Information Technology (BSc IT),
On This Page
This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 29
Q1 | In crabbing protocol, the lock obtained on the root node is in mode.
- shared
- exclusive
- read only
- none of the mentioned
Q2 | If needed to split a node or coalesce it with its siblings, or redistribute key values between siblings, the crabbing protocol locks the parent of the node in mode.
- shared
- exclusive
- read only
- none of the mentioned
Q3 | Instead of locking index leaf nodes in a two-phase manner, some index concurrency- control schemes use on individual key values, allowing other key values to be inserted or deleted from the same leaf.
- b+ tree locking
- link level locking
- key-value locking
- next value locking
Q4 | The recovery scheme must also provide
- high availability
- low availability
- high reliability
- high durability
Q5 | Which one of the following is a failure to a system
- boot crash
- read failure
- transaction failure
- all of the mentioned
Q6 | The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is
- read error
- boot error
- logical error
- system error
Q7 | The transaction can no longer continue with its normal execution because of some internal condition, such as bad input, data not found, overflow, or resource limit exceeded. This is
- read error
- boot error
- logical error
- system error
Q8 | The assumption that hardware errors and bugs in the software bring the system to a halt, but do not corrupt the nonvolatile storage contents, is known as the
- stop assumption
- fail assumption
- halt assumption
- fail-stop assumption
Q9 | The database is partitioned into fixed- length storage units called
- parts
- blocks
- reads
- build
Q10 | The log is a sequence of recording all the update activities in the database.
- log records
- records
- entries
- redo
Q11 | In the scheme, a transaction that wants to update the database first creates a complete copy of the database.
- shadow copy
- shadow paging
- update log records
- all of the mentioned
Q12 | The scheme uses a page table containing pointers to all pages; the page table itself and all updated pages are copied to a new location.
- shadow copy
- shadow paging
- update log records
- all of the mentioned
Q13 | If a transaction does not modify the database until it has committed, it is said to use the technique.
- deferred-modification
- late-modification
- immediate-modification
- undo
Q14 | using a log record sets the data item specified in the log record to the old value.
- deferred-modification
- late-modification
- immediate-modification
- undo
Q15 | In the phase, the system replays updates of all transactions by scanning the log forward from the last checkpoint.
- repeating
- redo
- replay
- undo
Q16 | The actions which are played in the order while recording it is called history.
- repeating
- redo
- replay
- undo
Q17 | A special redo-only log record < Ti, Xj, V1> is written to the log, where V1 is the value being restored to data item Xj during the rollback. These log records are sometimes called
- log records
- records
- compensation log records
- compensation redo records
Q18 | In order to reduce the overhead in retrieving the records from the storage space we use
- logs
- log buffer
- medieval space
- lower records
Q19 | Writing the buffered log to is sometimes referred to as a log force.
- memory
- backup
- redo memory
- disk
Q20 | The policy, allows a transaction to commit even if it has modified some blocks that have not yet been written back to disk.
- force
- no-force
- steal
- no-steal
Q21 | policy allows multiple updates to accumulate on a block before it is output to stable storage, which can reduce the number of output operations greatly for frequently updated blocks.
- force
- no-force
- steal
- no-steal
Q22 | The policy, allows the system to write modified blocks to disk even if the transactions that made those modifications have not all committed.
- force
- no-force
- steal
- no-steal
Q23 | The contains a list of blocks that have been updated in the database buffer.
- latches
- swap space
- dirty block
- none of the mentioned
Q24 | The silicon chips used for data processing are called
- ram chips
- rom chips
- micro processors
- prom chips
Q25 | Which of the following is used for manufacturing chips?
- control bus
- control unit
- parity unit
- semiconductor