Scribd
Upload
9 views1 page

KCS501 Assignment4

This document is an assignment for a third year Data Base Management Systems course. It contains 5 questions related to concepts like deadlocks, transaction scheduling, recovery mechanisms, and view serializability. The assignment covers unit 4 of the course and is due on December 11th, 2023 for a total of 25 marks. The faculty members for the course are listed as Mr. Vikas Porwal and Ms. Aliza Raza Rizvi, and recommended references are provided.

Uploaded by

Kartikey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views1 page

KCS501 Assignment4

This document is an assignment for a third year Data Base Management Systems course. It contains 5 questions related to concepts like deadlocks, transaction scheduling, recovery mechanisms, and view serializability. The assignment covers unit 4 of the course and is due on December 11th, 2023 for a total of 25 marks. The faculty members for the course are listed as Mr. Vikas Porwal and Ms. Aliza Raza Rizvi, and recommended references are provided.

Uploaded by

Kartikey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Bachelor of Technology – Third Year (CSE)

BABU BANARASI DAS


NORTHERN INDIA INSTITUTE OF TECHNOLOGY
Affiliated to Dr. A.P.J. Abdul Kalam Technical University (AKTU Code : 056)
AKTU Code : 056
Approved by All India Council for Technical Education (AICTE)
Sector II, Dr Akhilesh Das Nagar, Faizabad Road, Lucknow (UP) – India, 226028
Website : www.bbdniit.ac.in
BTECH THIRD YEAR / FIFTH SEMESTER / 2023-24
ASSIGNMENT NO. : A4
1. Name of Subject: Data Base Management System
2. AKTU Subject Code: KCS 501
3. NBA Subject Code: C301
4. Unit Covered: 4
5. Date of Issue : 5/12/2023 Last Date of Submission: 11/12/23 Marks: 25
Q
Question Description CO BTL MM
#

1. What do you mean by deadlock? What are the various condition under IV 5
I
which deadlock occurs? Discuss the wait-die and wound-wait n detail.

What do you mean by schedule in the context of concurrent execution of


2. transactions in RDBMS? What is serializable schedule? Discuss the various IV II 5
types of serializability with a suitable example.

Compare and contrast the features of log based recovery mechanism versus
3. check pointing based recovery. Suggest applications where you will prefer log IV 5
IV
based recovery scheme over check pointing. Give an example of check
pointing based recovery scheme. Discuss the recoverable schedule also.

Consider schedule S given below Determine whether it is cascadeless,


4. recoverability or non recoverable. Also draw a precedence graph S: r1(P); IV III 5
r2(R); r1(R) ; r3(P); r3(Q) ; w1(P); w3(Q); r2(Q); w3(R);w2(Q);c1;c2;c3

Check whether the given schedule S is view serializable or not-

5 IV V 5

Name of Faculty: Mr.Vikas Porwal /Ms. Aliza Raza Rizvi


Notes:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. https://onlinecourses.nptel.ac.in/noc22_cs91/unit?unit=73&lesson=74

BBDNIIT 2023-24(Odd Semester) Page1

You might also like