Total No. of Questions : 8] SEAT No.

8
23
PB3648 [Total No. of Pages : 3

ic-
[6261]-56

tat
6s
S.E. (Information Technology)

4:5
02 91
DATABASE MANAGEMENT SYSTEMS

3:4
0
(2019 Pattern) (Semester - IV) (214452)

41
2/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8, Q.9 or Q.10.
E

2) Neat diagram must be drawn whenever necessary.

82

8
C

23
3) Figures to the right indicate full marks.

ic-
4) Assume suitable data if necessary.
16

tat
5) Use of Scientific Calculator is permitted.
8.2

6s
.24

4:5
91
49

Q1) a) Write a note on : [8]

3:4
30
41

i) Database Modification using SQL

01
02

ii) Set Operation

5/2
GP
2/0

b) Consider the following relation: [6]

CE
82

8
Customer(cid,cname,caddress,city,state)

23
.23

Order(oid,odate,aamount) ic-
16

tat
8.2

6s

Customer and order are related with one to many relationship. solve the
.24

4:5

following queries.
91
49

3:4

i) List the name of customer who belong to Maharashtra state, sorted

30
41

on city.
01
02
5/2

ii) What are the name of all customer who placed the order between
GP

01/01/2010 to 31/03/2011?
2/0
CE
82

iii) Define constraint on order amount such that it should be always

.23

greater than zero.

16

c) Explain the concept of Dynamic and Embedded SQL. [4]

8.2
.24

OR
49

P.T.O.
Q2) a) Explain in detail with syntax Stored, procedure and Trigger 3-54 [8]

8
23
b) Write the syntax for following SQL command : [6]

ic-
i) Create Table

tat
6s
ii) Alter table

4:5
iii) Drop table

02 91
3:4
iv) Insert

0
41
v) Update
2/0 13
vi) Delete
0
5/2
.23 GP

c) What is view? List two major problem with processing update operations
expressed in terms of views. [4]
E
82

8
C

23
Q3) a) Compute the closure of the following set F of functional dependencies

ic-
16

for relation schema R = (A, B, C, D, E). [7]

tat
8.2

A → BC

6s
.24

4:5
CD → E
91
49

3:4
B→D
30
41

E→A
01
02

List the candidate keys for R.

5/2
GP

b) State and explain armstrong’s axioms and its properties. [6]

2/0

c) Explain Difference between 4NF & BCNF. [4]

CE
82

8
23
OR
.23

Q4) a) Describe the concept of transitive dependency. Explain how this conceptic-
16

tat
is use to define 3NF. [7]
8.2

6s
.24

b) Explain with example Materialized evaluation and pipelining. [6]

4:5
91
49

c) Suppose that we decompose the schema R = (A, B, C, D, E) into [4]

3:4
30

(A, B, C)
41
01
02

(A, D, E).
5/2
GP

Show that this decomposition is a lossless-join decomposition if the

2/0

following set F of functional dependencies holds.

CE
82

A → BC
.23

CD → E
16

B→D
8.2

E→A
.24

[6261]-56
49

2
Q5) a) Explain : [8]

8
23
i) ACID properties

ic-
tat
ii) Explain Timestamp Based Concurrency Control

6s
b) What is the need of Serializability? [6]

4:5
02 91
3:4
c) Check whether given schedule is view serializable? [4]

0
41
T1 2/0 13 T2 T3
0
Read(Q)
5/2
.23 GP

Write(Q)
E
82

8
Write(Q)
C

23
ic-
Write(Q)
16

tat
8.2

OR

6s
.24

4:5
Q6) a) What is Log Based Recovery? Explain Deferred Database Modification
91
49

3:4
and Immediate Database Modification. [12]
30
41

b) Write a note on “Shadow Paging”. [6]

01
02
5/2
GP
2/0

Q7) a) Explain the following : [12]

CE
82

8
23
Internet Databases
.23

Mobile Databases ic-

16

tat
8.2

6s

Cloud Databases
.24

4:5
91

SQLite Databases
49

3:4
30

b) Explain XQuery FLWOR Expressions. [5]

41
01
02

OR
5/2
GP

Q8) a) With a proper diagram, explain the architecture of Distributed Databases.[9]

2/0

b) With a suitable diagram, explain Centralized and Client-Server

CE
82

Architectures. [8]
.23


16
8.2
.24

[6261]-56
49