What is the goal of concurrency control protocol?

Schedule should be serializable

Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortage payment and, then apply a 5% interest. 1. T 1 start 2. T 1 B old = 12000 new = 10000 3. T 1 M old = 0 new = 2000 4. T 1 commit 5. T 2 start 6. T 2 Bold = 10000 new = 10500 7. T 2 commit Suppose the database system crashed just before log record 7 is written. When the system is restarted, which one statement is true of the recovery procedure?

We must redo log record 6 set B to 10500.

We must undo log record 6 to set B to 10000 and then redo log records 2 and 3.

We need not redo log records 2 and 3 because transaction T 1 has committed.

We can apply redo and undo operations in arbitrary order because they are idempotent.

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

Both S 1 and S 2 are conflict serializable.

S 1 is conflict serializable and S 2 is not conflict serializable.

S 1 is not conflict serialization and S 2 is conflict serializable.

Both S 1 and S 2 are not conflict serializable.

From transaction scenario given the precedence graph, which of the following is true?

That the transaction schedule is unserializable.

Nothing as there is not enough information in the graph.

That the transaction schedule-is serializable.

That the transaction schedule could be both serializable and unserializable.

Suppose that process P has been running for several days when a new process Q starts up and begins contending with Pfor resources. Which of the following is true?

In a wait-die system, if P needs a resource held by Q, then Pwaits.

In a wait-die system, if Q needs a resource held by P, then Q waits.

In wound-wait system, if P needs a resource held by Q, then Q yields and waits.

in a wound-wait system, if Q needs a resource held by P, then Q dies.

For the schedule given below, which of the following is correct? 1 Read A 2 Read B 3 Write A 4 Read A 5 Write A 6 Write B 7 Read B 8 Write B

This schedule is serializable and can occur in a scheme using 2PL protocol.

This schedule is serializable but cannot occur in a scheme using 2PL protocol.

This schedule is not serializable but can occur in a scheme using 2PL protocol.

This schedule is not serializable and cannot occur in a scheme using 2PL protocol.

Consider three data items D1, D2, and D3, and the following execution schedule of transactions T1, T2 and T3. In the diagram, R(D) and W(D) denote the actions reading and writing the data item D respectively.

The schedule is seriaiizabie as T2; T3; T1;

The schedule is serializable as T2; T1; T3;

The schedule is serializable as T3; T2; T1;

The schedule is not serializable

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

Both S 1 and S 2 are conflict seriaIizabIe

S 1 is conflict seriaiizabie and S 2 is not conflict serializable

S 1 is not conflict serializable and S 2 is conflict seriaIizabIe

Both S 1 and S 2 are not conflict serializable

An index is clustered, if

It is on a set of fields that form a candidate key.

It is on a set of fields that include the primary key.

The data record of the file are organized in the same order as the date entries of the index.

The data records of the file are organized not in the same order as the data entries of the index.

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?

r 1 (x); r 2 (x); w 1 (x); r 3 (x); w 2 (x)

r 2 (x); r 1 (x); w 2 (x); r 3 (x); w 1 (x)

r 3 (x); r 2 (x); w 1 (x); r 2 (x); w 1 (x)

r 2 (x); r 3 (x); w 2 (x); r 1 (x); w 1 (x)

Transactions and Concurrency Control- 2 Free MCQ Practice Test with Solutions

EduRev

All Courses

Open App

Important Questions for Transactions & Concurrency Control- 2

Find all the important questions for Transactions & Concurrency Control- 2 at EduRev.Get fully prepared for Transactions & Concurrency Control- 2 with EduRev's comprehensive question bank and test resources. Our platform offers a diverse range of question papers covering various topics within the Transactions & Concurrency Control- 2 syllabus. Whether you need to review specific subjects or assess your overall readiness, EduRev has you covered. The questions are designed to challenge you and help you gain confidence in tackling the actual exam. Maximize your chances of success by utilizing EduRev's extensive collection of Transactions & Concurrency Control- 2 resources.

Transactions & Concurrency Control- 2 MCQs with Answers

Prepare for the Transactions & Concurrency Control- 2 within the Computer Science Engineering (CSE) exam with comprehensive MCQs and answers at EduRev. Our platform offers a wide range of practice papers, question papers, and mock tests to familiarize you with the exam pattern and syllabus. Access the best books, study materials, and notes curated by toppers to enhance your preparation. Stay updated with the exam date and receive expert preparation tips and paper analysis. Visit EduRev's official website today and access a wealth of videos and coaching resources to excel in your exam.

Online Tests for Transactions & Concurrency Control- 2

Practice with a wide array of question papers that follow the exam pattern and syllabus. Our platform offers a user-friendly interface, allowing you to track your progress and identify areas for improvement. Access detailed solutions and explanations for each test to enhance your understanding of concepts. With EduRev's Online Tests, you can build confidence, boost your performance, and ace Transactions & Concurrency Control- 2 with ease. Join thousands of successful students who have benefited from our trusted online resources.

Education Revolution