adplus-dvertising

Welcome to the Concurrency Control MCQs Page

Dive deep into the fascinating world of Concurrency Control with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Concurrency Control, a crucial aspect of DBMS. In this section, you will encounter a diverse range of MCQs that cover various aspects of Concurrency Control, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within DBMS.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Concurrency Control. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of DBMS.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Concurrency Control. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Concurrency Control MCQs | Page 10 of 15

Explore more Topics under DBMS

Q91.
Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other
Discuss
Answer: (a).Concurrency
Q92.
All lock information is managed by a __________ which is responsible for assigning and policing the locks used by the transactions.
Discuss
Answer: (c).Lock manager
Q93.
The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
Discuss
Answer: (d).Field-level
Q94.
Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?
Discuss
Answer: (d).Two phase lock
Q95.
The situation where the lock waits only for a specified amount of time for another lock to be released is
Discuss
Answer: (a).Lock timeout
Q96.
A deadlock exists in the system if and only if the wait-for graph contains a ___________
Discuss
Answer: (a).Cycle
Q97.
In a granularity hierarchy the highest level represents the
Discuss
Answer: (a).Entire database
Q98.
In a database the file is contained in ________
Discuss
Answer: (c).One area
Q99.
If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called
Discuss
Answer: (a).Intention lock modes
Q100.
If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks.
Discuss
Answer: (a).Intention lock modes

Suggested Topics

Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!