KIPM – College of Engineering &Technology
(Approved by AICTE, New Delhi & Affiliated to Dr. A. P. J. Abdul Kalam University, Lucknow)
Department of Computer Science and Engineering
Assignment- 4
Branch : Computer Science and Engineering/ CSE AIML
Subject Name : Database Management System
Subject Code : BCS 501
Year/ Semester : 3rd Year/ Vth Semester
Faculty Name : Mr. Vivek Patel
Session : 2024-25
Q. 1- Explain ACID properties of transaction.
Q. 2- What is transaction? Draw a state diagram of a transaction showing its states.
Q. 3- Discuss conflict serializability with example.
Q. 4- What is precedence graph? How can it be used to test the conflict serializability of a schedule?
Q. 5- Test the serializability of the following schedule:
i. r1 (x); r3 (x); w1 (x); r2 (x); w3 (x)
ii. r3 (x); r2 (x); w3 (x); r1 (x); w1 (x)
Q. 6- What is the difference between conflict and view serializability?
Q. 7- Which of the following schedules are conflicts serializable? For each serializable schedule find the
equivalent schedule.
S1: r1(x); r3(x); w3(x); w1(x); r2(x)
S2: r3(x); r2(x); w3(x); r1(x); w1(x)
S3: r1(x); r2(x); r3(y); w1(x); r2(z); r2(y); w2(y)
Q. 8- What is deadlock? How it can be detected and avoided?
Q. 9- Discuss about deadlock prevention schemes?
Q. 10- Explain data fragmentation with types?
