Printed Pages: 02
Paper Id:
Sub Code:KCS-501
231456
Roll No.
B.TECH.
(SEM V) THEORY EXAMINATION 2022-23
DATABASE MANAGEMENT SYSTEM
Time: 3 Hours
Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.
SECTION A
13
2.
24
5.
3D
(i)
(j)
90
(f)
(g)
(h)
List any four disadvantages of file system approach over database approach.
Differentiate between physical and logical data independence.
What is the difference between DROP and DELETE command?
What are different Integrity Constraints?
List all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD set
F = {AB→C, B→E, C→D}.
Explain MVD with the help of suitable example.
Discuss Consistency and Isolation property of a transaction.
Draw a state diagram and discuss the typical states that a transaction goesthrough
during execution.
Discuss Conservative 2PL and Strict 2PL.
Describe how view serializability is related to conflict serializability.
_2
(a)
(b)
(c)
(d)
(e)
2x10 = 20
P2
.5
SECTION B
10x3 = 30
|1
A database is being constructed to keep track of the teams and games of a sport
league. A team has a number of players, not all of whom participate in each
game. It is desired to keep track of players participating in each game for each
team, the positions they play in that game and the result of the game.
(i) Design an E-R schema diagram for this application.
(ii) Map the E-R diagram into relational model
What are Joins? Discuss all types of Joins with the help of suitable examples.
A set of FDs for the relation R{A, B, C, D, E, F} is AB →C, C → A, BC →
D,ACD → B, BE → C, EC → FA, CF → BD, D→ E. Find a minimum cover
forth is set of FDs
What is a schedule? Define the concepts of recoverable, cascade less and strict
schedules, and compare them in terms of their recoverability.
Discuss the immediate update recovery technique in both single-user and
multiuser environments. What are the advantages and disadvantages of
immediate update?
02
3
|1
(e)
01
-2
(d)
2-
(b)
(c)
13
:
23
:2
5
(a)
17
Attempt any three of the following:
Q
2.
2
Attempt all questions in brief.
P1
1.
SECTION C
3.
Attempt any one part of the following:
(a)
(b)
10x1 = 10
Describe the three-schema architecture. Why do we need mappings between
schema levels? How do different schema definition languages support this
architecture?
What are the different types of Data Models in DBMS? Explain them.
Downloaded
from : uptukhabar.net
QP23DP1_290
| 12-01-2023
13:23:25 | 117.55.242.132
Attempt any one part of the following:
(a)
(b)
5.
10 x1 = 10
Consider the following schema for institute library:
Student (RollNo, Name, Father_ Name, Branch)
Book (ISBN, Title, Author, Publisher)
Issue (RollNo, ISBN, Date-of –Issue)
Write the following queries in SQL and relational algebra:
(i) List roll number and name of all students of the branch ‘CSE’.
(ii) Find the name of student who has issued a book published by ‘ABC’ publisher.
(iii) List title of all books and their authors issued to a student ‘RAM’.
(iv) List title of all books issued on or before December 1, 2020.
(v) List all books published by publisher ‘ABC’
Explain different types of Triggers in SQL/PL SQL.
Attempt any one part of the following:
(a)
Given the following set of FDs on schema R (V,W,X,Y,Z)
{Z→V, W→Y, XY→Z, V→WX}State whether the following decomposition are
loss-less-join decompositions or not.
(i) R1=(V,W,X) , R2=(V,Y,Z)
(ii) R1=(V,W,X), R2=(X,Y,Z)
Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of
functional dependencies F = { {A, B}→{C}, {A}→{D, E}, {B}→{F},
{F}→{G,H}, {D}→{I, J} }. What is the key for R? Decompose R into 2NF and
then3NF relations.
2.
_2
Attempt any one part of the following:
24
5.
Consider schedules S1, S2, and S3 below. Determine whether each schedule is strict,
cascade less, recoverable, or non recoverable. (Determine the strictest recoverability
condition that each schedule satisfies.)
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z); w2
(Y); c2;
S2: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
c1;c2; c3;
S3: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2
(Y);c3; c2;
Consider the three transactions T1, T2, and T3, and the schedules S1 and S2given
below. State whether each schedule is serializable or not. If a schedule is serializable,
write down the equivalent serial schedule(s).
T1: r1 (X); r1 (Z); w1 (X);
T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);
T3: r3 (X); r3 (Y); w3 (Y);
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);
Attempt any one part of the following:
(a)
(b)
|1
7.
2-
01
-2
02
3
13
:
(b)
23
:2
5
|1
Q
17
P2
.5
3D
(a)
10x1 = 10
P1
6.
13
90
(b)
10x1 = 10
2
4.
10x1 = 10
Discuss the timestamp ordering protocol for concurrency control. How does strict
timestamp ordering differ from basic timestamp ordering?
How do optimistic concurrency control techniques differ from other concurrency
control techniques? Why they are also called validation or certification techniques?
Discuss the typical phases of an optimistic concurrency control method.
Downloaded
from13:23:25
: uptukhabar.net
QP23DP1_290
| 12-01-2023
| 117.55.242.132
Subject Code: XXXXX
Roll No:
BTECH
(SEM-5) DATABASE MANAGEMENT SYSTEM 2021-22
TIME:3 HOUR
Total Marks: 100
Instruction: Attempt the questions as per the given instructions. Assume missing data suitably.
SECTION - A
Attempt All Parts in Brief
Q1
2*10 = 20
Questions
Marks
(a)
What is the significance of Physical Data Independence?
2
(b)
List the four functions of DBA.
2
(c)
When a relation set is called a recursive relationship set ?
2
(d)
What do you mean by currency with respect to database ?
2
(e)
What is Relational Calculus ?
2
(f)
What is Equi-Join in database ?
2
(g)
What is a CLAUSE in terms of SQL ?
2
(h)
Define the closure of an attribute set.
2
(i)
When is a transaction Rolled Back ?
2
(j)
List the various levels of locking?
2
SECTION - B
Attempt Any Three of the following
Q2
3*10 = 30
Questions
Marks
(a)
Draw the overall structure of DBMS and explain its various components.
10
(b)
Which relational algebra operations require the participating tables to be union-compatible ? Give the reason
in detail.
10
(c)
What do you understand by transitive dependencies ? Explain with an example any two problems that can
arise in the database if transitive dependencies are present in the database.
10
(d)
List ACID properties of transaction. Explain the usefulness of each. What is the importance of log ?
10
(e)
What do you mean by time stamping protocol for concurrency controlling ? Discuss multi version scheme of
concurrency control.
10
SECTION - C
Attempt Any One of the following
Q3
5*10 = 50
Questions
Marks
(a)
What are the different types of Data Models in DBMS ? Explain them.
10
(b)
State the procedural DML and non-procedural DML with their differences.
10
Q4
(a)
(b)
Q5
Questions
Consider the following schema for institute library :
Student (RolINo, Name, Father_ Name, Branch)
Book (ISBN, Title, Author, Publisher)
Issue (RolINo, ISBN, Date-of-Issue)
Write the following queries in SQL and relational algebra:
I. List roll number and name of all students of the branch CSE.
II. Find the name of student who has issued a book published by ‘ABC’ publisher.
III. List title of all books and their authors issued to a student RAM.
IV. List title of all books issued on or before December 1, 2020.
V. List all books published by publisher 'ABC'.
What do you mean by trigger ? Explain it by a suitable example.
Questions
Marks
10
10
Marks
(a)
Describe Armstrong's axioms in detail. What is the role of these rules in database development process ?
10
(b)
Describe the term MVD in the context of DBMS by giving an example. Discuss 4NF and 5NF also.
10
Q6
Questions
Marks
(a)
Describe serializable schedule. Discuss con flict serializability with suitable example.
10
(b)
Discuss the procedure of deadlock detection and recovery in transaction ?
10
Q7
Questions
Marks
(a)
Given a schedule S for transactions T1 and T2 with set of read and write operations,
S: R1(X) R2(X) R2(Y) W2(Y) R1(Y) W1(X).
Identify, whether given schedule is equivalent to serial schedule or not ?
10
(b)
Discuss 2 phase commit (2PC) protocol and time stamp based protocol with suitable example. How the
validation based protocols differ from 2PC?
10
Printed Page: 1 of 2
Subject Code: KCS501
0Roll No:
0
0
0 0
0
0
0
0
0
0
0
0
0
BTECH
(SEM V) THEORY EXAMINATION 2020-21
DATABASE MANAGEMENT SYSTEM
Time: 3 Hours
Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
Marks
2
2
2
2
2
2
2
2
2
2
29
0Q
P
What is Data Independency in DBMS?
Write the difference between DDL and DML.
What are different Integrity Constraints?
Explain different Features of SQL.
What are advantages of normalization?
Write different Inference Rule for Functional Dependency?
What are ACID properties of Transaction?
What are various reasons for transaction failure?
What are Concurrent Transactions?
What is Lock in Transaction Management?
P2
_Q
17
.5
Marks
CO1
|1
TU
What is ER Diagram? Explain different Components of an ER 10
Diagram with thier Notation. Also make an ER Diagram for Employee
Project Management System.
What is Relational Algebra? Explain Different Operations of 10
Relational Algebra with Example.
(i) What is highest normal form of the Relation R(W,X,Y,Z) with the 10
set F= { WY → XZ, X →Y }
CO
4
:2
13
CO2
CO3
09
:
c.
Question
AK
b.
3 x 10 = 30
5.
Attempt any three of the following:
Qno.
a.
24
SECTION B
2.
CO
CO1
CO1
CO2
CO2
CO3
CO3
CO4
CO4
CO5
CO5
0E
a.
b.
c.
d.
e.
f.
g.
h.
i.
j.
Question
1
Qno.
2 x 10 = 20
13
Attempt all questions in brief.
2.
1.
Explain the method of testing the serializability. Consider the schedule 10
S1 and S2 given below
CO4
|2
3-
Fe
d.
b2
02
1
(ii) Consider a relation R(A,B,C,D,E) with set F= { A→CD,
C→B,B→AE} What are the prime attributes of this Relation and
Decompose the given relation in 3NF.
S1: R1(A),R2(B),W1(A),W2(B)
S2: R2(B),R1(A),W2(B), W1(A)
e.
Check whether the given schedules are conflict equivalent or not?
Explain the Validation Based protocol for concurrency control.
10
CO5
1|Page
AKTU_QP20E290QP | 23-Feb-2021 09:13:24 | 117.55.242.131
Printed Page: 2 of 2
Subject Code: KCS501
0Roll No:
0
0
0 0
0
0
0
0
0
0
0
0
0
SECTION C
3.
Attempt any one part of the following:
Qno.
a.
b.
4.
Question
What is Data Abstraction? How the Data Abstraction is achieved in 10
DBMS?
Explain the following with example
10
(i)
Generalization
(ii)
Specialization
(iii)
Aggregation
CO
CO1
CO1
Attempt any one part of the following:
Qno.
Question
Marks
b.
What is Aggregate Function in SQL? Write SQL query for different 10
Aggregate Function.
Explain Procedure in SQL/PL SQL.
10
5.
Attempt any one part of the following:
CO
CO2
CO2
1
13
24
17
.5
5.
P2
CO3
|1
4
:2
Question
Marks
What is Conflict Serializable Schedule? Check the given Schedule S1 10
is Conflict Serializable or not?
CO
CO4
09
:
a.
Attempt any one part of the following:
13
Qno.
AK
6.
CO3
0E
What is Functional Dependency? Explain the procedure of 10
calculating the Canonical Cover of a given Functional Dependency
Set with suitable example.
(i) Consider the relation R(a,b,c,d) with Set F={a→c,b→d}. 10
Decompose this relation in 2 NF.
(ii) Explain the Loss Less Decomposition with example.
CO
2.
Marks
TU
b.
Question
_Q
a.
29
Qno.
0Q
P
a.
Marks
7.
Attempt any one part of the following:
10
CO4
b2
Fe
a.
b.
Question
Explain Time Stamp Based Concurrency Control technique.
Explain Recovery from Concurrent Transaction.
|2
3-
Qno.
02
1
b.
S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X)
Explain Deadlock Handling with Suitable Example
Marks
10
10
CO
CO5
CO5
2|Page
AKTU_QP20E290QP | 23-Feb-2021 09:13:24 | 117.55.242.131