Question

If a transaction may release locks but may not obtain any locks, it is said to be in ______ phase

a.

Growing phase

b.

Shrinking phase

c.

Deadlock phase

d.

Starved phase

Posted under Concurrency Control DBMS

Answer: (b).Shrinking phase

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If a transaction may release locks but may not obtain any locks, it is said to be in ______ phase

Add Comment

Similar Questions

Discover Related MCQs

Q. A system is in a _______ state if there exists a set of transactions in which every transaction is waiting for another transaction in the set.

View solution

Q. Which of the following is not a method in deadlock handling

View solution

Q. Deadlocks can be prevented using

View solution

Q. State true or false: Wait die scheme is a non-preemptive technique

View solution

Q. Lock timeouts have which of the following advantages?

View solution

Q. The _________ graph describes deadlocks precisely

View solution

Q. How do we generally recover from a deadlock?

View solution

Q. State true or false: Partial rollback is not possible.

View solution

Q. Which of the following steps must be taken while choosing a victim?

View solution

Q. Which of the following cannot be used to implement a timestamp

View solution

Q. A logical counter is _________ after a new timestamp has been assigned

View solution

Q. W-timestamp(Q) denotes?

View solution

Q. R-timestamp(Q) denotes?

View solution

Q. A ________ ensures that any conflicting read and write operations are executed in timestamp order

View solution

Q. The default timestamp ordering protocol generates schedules that are

View solution

Q. State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol

View solution

Q. Which of the following timestamp based protocols generates serializable schedules?

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. The _________ requires each transaction executes in two or three different phases in its lifetime

View solution

View All MCQs on Concurrency Control

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!

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...