Database Management System Set 28
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 28
Q1 | rollback requires the system to maintain additional information about the state of all the running transactions.
- total
- partial
- time
- commit
Q2 | If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called
- intention lock modes
- explicit lock
- implicit lock
- exclusive lock
Q3 | If a node is locked in explicit locking is being done at a lower level of the tree, but with only shared-mode locks.
- intention lock modes
- intention-shared-exclusive mode
- intention-exclusive (ix) mode
- intention-shared (is) mode
Q4 | If a node is locked in then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.
- intention lock modes
- intention-shared-exclusive mode
- intention-exclusive (ix) mode
- intention-shared (is) mode
Q5 | If a node is locked in the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks.
- intention lock modes
- shared and intention-exclusive (six) mode
- intention-exclusive (ix) mode
- intention-shared (is) mode
Q6 | The requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a read-only or an update transaction.
- validation protocol
- validation-based protocol
- timestamp protocol
- timestamp-ordering protocol
Q7 | denotes the largest timestamp of any transaction that executed write(Q) successfully.
- w-timestamp(q)
- r-timestamp(q)
- rw-timestamp(q)
- wr-timestamp(q)
Q8 | The most recent version of standard SQL prescribed by the American National Standards Institute is
- sql 2016
- sql 2002
- sql – 4
- sql2
Q9 | ANSI-standard SQL allows the use of special operators in conjunction with the WHERE clause. A special operator used to check whether an attribute value is null is
- between
- is null
- like
- in
Q10 | A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a
- database-level lock
- table-level lock
- page-level lock
- row-level lock
Q11 | A condition that occurs when two transactions wait for each other to unlock data is known as a(n)
- shared lock
- exclusive lock
- binary lock
- deadlock
Q12 | The file organization which allows us to read records that would satisfy the join condition by using one block read is
- heap file organization
- sequential file organization
- clustering file organization
- hash files organization
Q13 | The extent of the database resource that is included with each lock is called the level of
- impact
- granularity
- management
- dbms control
Q14 | DBMS periodically suspends all processing and synchronizes its files and journals through the use of
- checkpoint facility
- backup facility
- recovery manager
- database change log
Q15 | Snapshot isolation is used to give
- transaction a snapshot of the database
- database a snapshot of the transaction
- database a snapshot of committed values in the transaction
- transaction a snapshot of the database and database a snapshot of committed values in the transaction
Q16 | Lost update problem is
- second update overwrites the first
- first update overwrites the second
- the updates are lost due to conflicting problem
- none of the mentioned
Q17 | Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as
- read skew
- update skew
- write lock
- none of the mentioned
Q18 | Which statements are correct regarding indexes?
- when a table is dropped, the corresponding indexes are automatically dropped
- for each dml operation performed, the corresponding indexes are automatically updated
- a non-deferrable primary key or unique key constraint in a table automatically creates a unique index
- all of the mentioned
Q19 | A non-correlated subquery can be defined as
- a set of sequential queries, all of which must always return a single value
- a set of sequential queries, all of which must return values from the same table
- a select statement that can be embedded in a clause of another select statement only
- a set of one or more sequential queries in which generally the result of the inner query is used as the search value in the outer query
Q20 | Which statement is true regarding synonyms?
- synonyms can be created for tables but not views
- synonyms are used to reference only those tables that are owned by another user
- a public synonym and a private synonym can exist with the same name for the same table
- the drop synonym statement removes the synonym, and the status of the table on which the synonym has been created becomes invalid
Q21 | The method of access that uses key transformation is called as
- direct
- hash
- random
- sequential
Q22 | Why do we need concurrency control on B+ trees ?
- to remove the unwanted data
- to easily add the index elements
- to maintain accuracy of index
- all of the mentioned
Q23 | How many techniques are available to control concurrency on B+ trees?
- one
- three
- four
- none of the mentioned
Q24 | In crabbing protocol locking
- goes down the tree and back up
- goes up the tree and back down
- goes down the tree and releases
- goes up the tree and releases
Q25 | The deadlock can be handled by
- removing the nodes that are deadlocked
- restarting the search after releasing the lock
- restarting the search without releasing the lock
- resuming the search