Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the following schedule S of transact...
Start Learning for Free
Consider the following schedule S of transactions T1,T2,T3,T4:
Which one of the following statement/s is correct?
- a)S is conflict-serializable but not recoverable.
- b)S is not conflict-serializable but is recoverable.
- c)S is both conflict-serializable and recoverable.
- d)S is neither conflict-serializable not is it recoverable.
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Consider the following schedule S of transactions T1,T2,T3,T4:Which on...
We know that:
Using precedence graph method we can find out Schedule is conflict serializable or not.
If precedence graph has any loop then that schedule is going to be not conflict-serializable.
If precedence graph doesn’t have any loop then that schedule is going to be conflict-serializable.
If one transaction (T1) is writing some value × and that value is read by some other transaction (T2) then T1 should commit first then only (T2) should read that value and commit in order to become recoverable schedule.
There is no loop in this graph so schedule is conflict serializable.
T2: T3: T1: T4 is the only serial schedule that is equivalent to given schedule. (Using Topological Sorting)
There are two write read dependency.
1. T1 write (x) and T4 read (x)
2. T2 write (y) and T4 read (y)
In first case T1 is committed first then read by T4 then T4 is committed so this is recoverable.
In second case T2 is committed first then read by T4 then T4 is committed so this is also recoverable so schedule S is recoverable.
Hence, the correct answer is (C).
Free Test
FREE
| Start Free Test |
Community Answer
Consider the following schedule S of transactions T1,T2,T3,T4:Which on...
We know that:
Using precedence graph method we can find out Schedule is conflict serializable or not.
If precedence graph has any loop then that schedule is going to be not conflict-serializable.
If precedence graph doesn’t have any loop then that schedule is going to be conflict-serializable.
If one transaction (T1) is writing some value × and that value is read by some other transaction (T2) then T1 should commit first then only (T2) should read that value and commit in order to become recoverable schedule.
There is no loop in this graph so schedule is conflict serializable.
T2: T3: T1: T4 is the only serial schedule that is equivalent to given schedule. (Using Topological Sorting)
There are two write read dependency.
1. T1 write (x) and T4 read (x)
2. T2 write (y) and T4 read (y)
In first case T1 is committed first then read by T4 then T4 is committed so this is recoverable.
In second case T2 is committed first then read by T4 then T4 is committed so this is also recoverable so schedule S is recoverable.
Hence, the correct answer is (C).
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct answer is option 'C'. Can you explain this answer?
Question Description
Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct answer is option 'C'. Can you explain this answer?.
Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct answer is option 'C'. Can you explain this answer?.
Solutions for Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Consider the following schedule S of transactions T1,T2,T3,T4:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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:Which one of the following statement/s is correct?a)S is conflict-serializable but not recoverable.b)S is not conflict-serializable but is recoverable.c)S is both conflict-serializable and recoverable.d)S is neither conflict-serializable not is it recoverable.Correct 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
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup