Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the following schedule S of transact...

Join the Discussion on the App

Consider the following schedule S of transactions T1, T2, T3, T4:

Q. Which one of the following statements is CORRECT?

a)
S is conflict-serializable but not recoverab le
b)
S is not conflict-serializable but is recoverable
c)
S is both conflict-serializable and recoverable
d)
S is neither conflict-serializable nor is it recoverable

Correct answer is option 'C'. Can you explain this answer?

FREE This question is part of

Test: Transactions & Concurrency Control- 1

Attempt Test

Attempt this Test

Verified Answer

Consider the following schedule S of transactions T1, T2, T3, T4:Q. Wh...

To check for conflict-serializable, we need to make a precedence graph, if the graph contains a cycle, then it's not conflict serializable, else it is. Here, for the precedence graph there will be only two directed edges, one from T2 -> T3 (Read- Write Conflict), and another from T2 -> T1(Read- Write Conflict), hence no cycle, so the schedule is conflict serializable. Now to check for Recoverable, we need to check for a dirty-read operation(Write by Transaction Ti, followed by Read by Transaction Tj but before Ti commits) between any pair of operations. If no dirty-read then recoverable schedule, if a dirty read is there then we need to check for commit operations. Here no dirty read operation (as T3 and T1 commits before T4 reads the Write(X) of T3 and T1 , and T2 commits before T4 reads the Write(Y) of T2). Therefore the schedule is recoverable. Hence, Option C.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Consider the following schedule S of transactions T1, T2, T3, T4:Which one of the following statements is CORRECT?

View answer

Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?

View answer

Consider the following database schedule with two transactions, T1 and T2.S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2;where ri(Z) denotes a read operation by transaction Ti on a variable Z, wi(Z) denotes a write operation by Ti on a variable Z and ai denotes an abort by transaction Ti . Which one of the following statements about the above schedule is TRUE?

View answer

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation on data item P is denoted by read(P) and the write operation on data item P is denoted by write(P).Q.Suppose that the transaction T1 fails immediately after time instance 9. Which one of the following statements is correct?

View answer

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation on data item P is denoted by read(P) and the write operation on data item P is denoted by write(P)Suppose that the transaction T1 fails immediately after time instance 9. Which one of the following statements is correct?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer?.

Solutions for Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer?, a detailed solution for Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the following schedule S of transactions T1, T2, T3, T4:Q. Which one of the following statements is CORRECT?a)S is conflict-serializable but not recoverab leb)S is not conflict-serializable but is recoverablec)S is both conflict-serializable and recoverabled)S is neither conflict-serializable nor is it recoverableCorrect answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam