Test: Transactions & Concurrency Control- 1


Test Description

10 Questions MCQ Test Question Bank for GATE Computer Science Engineering | Test: Transactions & Concurrency Control- 1

Test: Transactions & Concurrency Control- 1 for Computer Science Engineering (CSE) 2022 is part of Question Bank for GATE Computer Science Engineering preparation. The Test: Transactions & Concurrency Control- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Transactions & Concurrency Control- 1 MCQs are made for Computer Science Engineering (CSE) 2022 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Transactions & Concurrency Control- 1 below.
Solutions of Test: Transactions & Concurrency Control- 1 questions in English are available as part of our Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) & Test: Transactions & Concurrency Control- 1 solutions in Hindi for Question Bank for GATE Computer Science Engineering course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Transactions & Concurrency Control- 1 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
1 Crore+ students have signed up on EduRev. Have you?
Test: Transactions & Concurrency Control- 1 - Question 1

The concept of locking can be used to solve the problem of
1. Lost update
2. Uncommitted dependency
3. Inconsistent data
4. Deadlock

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 1

The concept of locking can be used to solve the problem of lost update, uncommitted dependency and prevents inconsistency among data but it is not capable of preventing the deadlock always.

Test: Transactions & Concurrency Control- 1 - Question 2

What are the potential problems when a DBMS executes multiple transactions concurrently?
1. The lost update problem
2. The dirty read problem
3. The unrepeatable read problem
4. The phantom problem

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 2

Lost update problem, dirty read problem , unrepeatable read problem and phantom problems are the potential problem that might occur when a DBMS executes multiple transactions concurrently.

Test: Transactions & Concurrency Control- 1 - Question 3

A trigger is 

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 3

A trigger is actually a procedural code that is automatically executed in response to certain events on a particular table or view in a database.

Test: Transactions & Concurrency Control- 1 - Question 4

Which of the following schemes are used for ensuring atomicity?

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 4

Following ensure atomicity:
• Log with deferred and immediate modification.
• Shadow paging.

Test: Transactions & Concurrency Control- 1 - Question 5

Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R, it will,

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 5

Since transaction A holds only a shared lock R.
Hence any number of transaction can read the data from the requested item using shared locking. Hence B’s request will be granted immediately Hence option (b) is correct.

Test: Transactions & Concurrency Control- 1 - Question 6

Which of the following cannot be restarted?

Test: Transactions & Concurrency Control- 1 - Question 7

Consider the following transaction schedule:

The labeled precedence graph will be

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 7

As we can see clearly T4 and T7 are followed by T3 and T4 in succeed by T3 and T7 and soon. Hence topological sequence represented by the above transactions is

Test: Transactions & Concurrency Control- 1 - Question 8

Amongst the ACID properties of a transaction, the ‘Durability' property requires that the changes made to the database by a successful transaction persist

Test: Transactions & Concurrency Control- 1 - Question 9

Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y(Y for read, W for write) performed by transaction Non object O.]

Which of the following statements is TRUE?

Detailed Solution for Test: Transactions & Concurrency Control- 1 - Question 9


As we can see S1 and S2 are conflict equivalent to each other. The equivalent serial schedule is

While the schedule S3 is having a conflicting pair hence equivalent serial schedule is not possible. Hence option (d) is correct.

Test: Transactions & Concurrency Control- 1 - Question 10

In case Of timestamp ordering R-timestamp (Q) denotes

Use Code STAYHOME200 and get INR 200 additional OFF
Use Coupon Code
Information about Test: Transactions & Concurrency Control- 1 Page
In this test you can find the Exam questions for Test: Transactions & Concurrency Control- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Transactions & Concurrency Control- 1, EduRev gives you an ample number of Online tests for practice