Scribd
Upload
45 views3 pages

BCS403 - DBMS - Assignment2 (3 Sets)

Uploaded by

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

BCS403 - DBMS - Assignment2 (3 Sets)

Uploaded by

ankitkrypton123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering


Semester: 4 Section(s): A Lectures/week: 04
Subject: Database Management System Code: BCS403
Course Instructor(s): Prof.Ann Mathews
Course duration: April 2024- August 2024.
Assignment # 02
Prerequisite: Transaction
Portion: Module-3,4,5
Instructions:

⮚ ON THE FRONT COVER OF THE ASSIGNMENT BOOK write Name, USN, Branch,
Semester, Section due date and date of submission details, put your signature in place of
‘signature of the student’.
⮚ ANSWER NEATLY AND LEGIBLY on assignment book only .

⮚ Sketch diagrams wherever relevant.

⮚ An incomplete assignment is not acceptable for submission.

⮚ Once you submit your assignment, you will be expected to answer all the questions there

INDEPENDENTLY. You may be asked to answer any question of the assignment in the
class.

⮚ Leave a clear left margin on every page

Assignment 2: Set-1
Sl.No Questions Mark CO RBT
. s

1 Explain types of update anomalies with examples. 10 CO2 L2

2 Define Transaction .Explain ACID properties 10 CO4 L2

3 What is the need of Normalization? Explain 1NF,2 NF and 3 10 CO3 L2


NF?

4 Explain Join,EquiJoin,Natural Join,inner join,outer join and 10 CO2 L2


full outer join with example?

5 Consider the relation schema R(A,B,C,D,E,F) and the 10 CO3 L3


functional dependencies A->B,C->DF,AC->E, D->F.What
is the candidate key of this relation R?What is its highest
normal form?

Assignment 2: Set-2
Sl.No Questions Marks CO RBT
.

1 With a neat diagram explain transaction diagram of a 10 CO4 L2


transaction

2 .Explain Armstrong axioms rules 10 CO3 L2

3 Explain schedules based on recoverability? 10 CO4 L2

4 Explain properties of transaction? 10 CO4 L3

5 Check whether given schedule is serializable or not using 10 CO4 L3


precedence graph. Explain with algorithm. S1:R1(X) R2(Z)
R1(Z) R3(X) R3(Y) W1(X) W3( Y) R2(Y) W2(Z) W2(Y)

Assignment 2: Set-3
Sl.No Questions Marks CO RBT
.

1 Explain two phase locking protocol 10 CO5 L2

2 With an example, explain basic Timestamp Ordering 10 CO5 L2


algorithm for Concurrency Control

3 Explain with syntax the six clauses of an SQL select 10 CO4 L3


statement?

4 i. Write down the steps for finding closure of a given FD. 10 CO3 L3

ii. Find closure of the given FDs. Also find the candidate keys.

R (A,B,C,D,E).
FDs: A->B, BC->D, E->C, D->A

5 Explain view serializability and conflict serializability with 10 CO4 L3


example?

You might also like