0% found this document useful (0 votes)
9 views2 pages

Assignment 03

This document outlines an assignment for the Database Administration and Management course at the University of Management and Technology, due on January 12th, 2025. It includes instructions on submission, a zero tolerance policy for plagiarism, and details four questions related to transaction management and database consistency. The assignment aims to assess students' understanding of transaction states, serial and concurrent execution of transactions, recoverable schedules, and conflict serializability.

Uploaded by

Awais Ali
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
0% found this document useful (0 votes)
9 views2 pages

Assignment 03

This document outlines an assignment for the Database Administration and Management course at the University of Management and Technology, due on January 12th, 2025. It includes instructions on submission, a zero tolerance policy for plagiarism, and details four questions related to transaction management and database consistency. The assignment aims to assess students' understanding of transaction states, serial and concurrent execution of transactions, recoverable schedules, and conflict serializability.

Uploaded by

Awais Ali
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
You are on page 1/ 2

University of Management and Technology,

Lahore Campus

Assignment – 03: Fall 2024


Database Administration And Credit
Course Name: Course Code: IT3142 4(3,1)
Management Hours:
Course Instructor/s: Muhammad Tahir Program Name BS IT
Semester/ Section: 5th, Y3, Y4 Maximum Marks: 20
Submission Moderator
January 12th, 2025
Deadline: Signature
Instructions:
• Understanding the problem is a part of the task.
• Your assignment should be submitted in PDF on the LMS.
• There is a ZERO tolerance policy for plagiarism. Tasks found with copy-pasted material or copied
from fellows will be marked as ZERO.
• I can take either quiz or in-class viva for this assignment by calling anyone from the class.
• Answer must be to the point.

Course Learning Outcomes (CLO)


Design conceptual, logical and physical database
CLO-2
schemas,

Database Administration Assignment: Transaction Management

Questions# 1: (5)
During its execution, a transaction passes through several states, until it finally
commits or aborts. List all possible sequences of states through which a transaction may pass.
Explain why each state transition may occur.

Questions# 2: (5)
Consider the following two transactions:
T1: read(A);
read(B);
if A = 0 then B := B + 1;
write(B).
T2: read(B);
read(A);
if B = 0 then A := A + 1;
write(A).

Page 1 of 2
Let the consistency requirement be A = 0 ∨ B = 0, with A = B = 0 the
initial values.
a. Show that every serial execution involving these two transactions pre serves the consistency
of the database.
b. Show a concurrent execution of T1 and T2 that produces a nonserializable
schedule.
c. Is there a concurrent execution of T1 and T2 that produces a serializable
schedule?

Questions# 3: (5)
What is a recoverable schedule? Why is recoverability of schedules desirable?
Are there any circumstances under which it would be desirable to allow non recoverable
schedules? Explain your answer.

Questions# 4: (5)
Consider the following precedence graph. Is the corresponding schedule conflict serializable?
Explain your answer.

Page 2 of 2

You might also like