Silicon Institute of Technology

Silicon Hills, Bhubaneswar

| An Autonomous Institute |

4th Semester B.Tech. End Term Examination 2020-21

DATABASE MANAGEMENT SYSTEMS(18CS1T02)
Duration: 03:00 Full Marks: 60

1 Answer All
a Differentiate database schema and database state.
1
b P
1
A B
a1 b1
a2 b1
a3 b1
a4 b2
a1 b2
a5 b1
a5 b2
Q
B
b1
b2
Find P ÷ Q ?

c Define 4NF.
1
d What is a query graph?
1
e What do you understand by compatibility mode of locking?
1
f What is a distributed database system? What are its limitations?
1
2 Answer All
a With suiatble example explain the differnce among relational model, network model and
3
hierarchical model.
b Given: R: A B C S: D C F 3
x 1 2 x 3 4
 y 2 3 z 2 3
z 3 4
Evaluate the following relational algebra operators :
a) R U S b) R - S c) R X S d) R |X| S
c Given
3
R = {A, B, C, D, E, F, G, H, I, J}
F = { (A,B) → C, A → (D,E), B → F, F → (G,H), D → (I,J)}.
Determine if the following decomposition satisfies the lossless join property.
D= {R1, R2, R3, R4, R5} ; R1 = {A,B,C} R2 = {A,D,E}, R3 = {B,F} R4 =
{F,G,H} R5 = {D,I,J}
d What is the advantage of multi-level indexing? Explain with a suitable example.
3
e What is a transaction? Draw the state transition diagram of a transaction and explain each state
3
briefly.
f Differentiate between horizontal fragmentation and vertical fragmentation with suitable
3
examples.
3 Answer any One
a Draw the architecture of database system. Discuss each component of database system in
6
details.
b Convert the following ER-diagram into Relational model.
6

4 Answer any One

a Consider the following relational schema in which the key fields are underlined:
6
SAILOR (sid, sname, rating, age)
BOAT (bid, bname, colour)
RESERVE (sid, bid, day)

Write the following queries in TRC and DRC:

a) Find the name and id of the sailors who have reserved a yellow and a blue colour boat?
b) Find the sailors who have not reserved any boats?
c) Find the IDs of sailors with age over 42 and who have not reserved any green colour boat?
d) Find the colours of boats reserved by Ramesh?
 b SAILOR ( SID, SNAME, AGE ) 6
RESEARVE (SID, BID, DAY_RES )
BOAT (BID, BNAME, COLOUR )
Write Relational algebra, TRC, DRC and QBE for the following queries:
a) Show all sailors who have not reserved a RED colour boat?
b) Find all the sailor names and their boat names which they will sail on 22 / 12 / 92?

5 Answer any One

a Given a relation schema R = { A, B, C, D } and a set of functional dependencies F = { AC →
6
D , B → CA }, find the minimal cover of F.
b Let F and G be two sets of functional dependencies. What is the condition for checking that F
6
and G are equivalent?
Given F = { A → B,C; B → D; A,E → F} and G = { A → C,F,B; B→D,E; E→A,B},
Check whether F and G are equivalent or not.
6 Answer any One
a Insert the following keys to a 5-way B-tree:
6
23, 11, 19, 3, 7, 9, 45, 1, 5, 14, 25, 24, 13, 8, 4, 31, 56, 35
b Construct a B-tree by inserting the following nodes into it :
6
4 , 7 , 10 , 25 , 2 , 15 , 17 , 6 , 1 , 19 , 23 , 20 , 3 , 12 , 14 , 26 , 13.
Given the order of the tree is 5.

7 Answer any One

a Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1:
6
r1(X);r1(Z);w1(X);w1(Z)T2: r2(Y);r2(Z);w2(Z) T3: r3(Y);r3(X);w3(Y). Analyze which one of
the schedules is conflict-serializable?

1. S1:r1(X);r3(Y);r3(X);r2(Y);r2(Z);w3(Y);w2(Z);r1(Z);w1(X);w1(Z)
2. S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);r2(Z); w3(Y); w1(X); w2(Z); w1(Z).

b Test whether the following schedules are conflict serializable or not. If they are, then obtain
6
their equivalent serial schedules :
i) S1 : r1(x) ; r1(y) ; r2(x) ; r2(y) ; w2(y) ; w1(x) ;
ii) S2 : r1(x) ; r2(x) ; r2(y) ; w2(y) ; r1(y) ; w1(x) ;

8 Answer any One

a What are the different ways in which data can be stored at different sites in a distributed
6
database system? Explain each type with suitable examples.
b With suitable examples, discuss the difference between parallel database and distributed
6
database.