Scribd
Upload
12 views

Assign 3

This document contains a 12 question assignment on database management systems (DBMS) for a course with code 21CS53. The questions cover topics like update and delete anomalies, Armstrong's inference rules, normalization, transactions, functional dependencies, deadlocks, anomalies, joins, and concurrency control protocols. The assignment is for March 2, 2024 and was issued by the Department of Information Science and Engineering.

Uploaded by

Madhushree C K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assign 3

This document contains a 12 question assignment on database management systems (DBMS) for a course with code 21CS53. The questions cover topics like update and delete anomalies, Armstrong's inference rules, normalization, transactions, functional dependencies, deadlocks, anomalies, joins, and concurrency control protocols. The assignment is for March 2, 2024 and was issued by the Department of Information Science and Engineering.

Uploaded by

Madhushree C K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Assignment No III Scheme 2021


Course Name DBMS Course Code 21CS53

Date 02/03/2024

Q.No Questions C RBT


O
1 Explain types of update and delete anomalies with examples 4 2

2 Explain Amstrong inference rules 5 2

3 What is the need for normalization? Explain 1NF, 2NF with example 4 2

4 . What is transaction. Discuss ACID properties 5 3


what is function dependency? write an algorithm to find minimal cover. construct minimal
5 4 3
cover m for set of functional dependencies which are : E:{B->A, D->A, AB- >D}
6 when deadlock starvation problem occur? explain how these problem can be resolved? 5 2
Explain insertion, deletion and modification anomalies. Why are they considered bad? Illustrate
7 5 2
with example
8 Explain 1NF,2NF,3NF with example 4 2
Define non-additive join property of a decomposition and write an algorithm for testing of non-
9 5 1
additive join property
Given below are two sets of FD’s for a relation R(A,B,C,D,E).Are they equivalent? F={A-
10 4 3
>C,AC->D,E->AD,E->H} and G={A->CD,E->AH}
Find the minimal cover for a sets of FD’s Consider R={A,B,C,D,E,F} .FD’s {A->C,AC->D,E-
11 4 3
>AD,E->H} Find the irreducible cover for this set of FD’s(minimal cover)
Briefly discuss on the two phase locking protocol used in concurrency control. How does it
12 5 1
gurantees serializability

Signature of the Faculty Signature of the HOD

RIT office : 08172-243180 & 08172-243181


E-mail : [email protected], web : www.rithassan.ac.in

You might also like