Total No. of Questions : 8] SEAT No.

8
23
PB3777 [6262]-35
[Total No. of Pages : 3

ic-
T.E.(Computer Engineering/AIDS )

tat
4s
DATABASE MANAGEMENT SYSTEMS

3:1
(2019 Pattern) (Semester -I) (310241)

02 91
9:3
Time : 2½ Hours] [Max. Marks :70

0
40
Instructions to the candidates:
6/0 13
1) Answer Q.1or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
5/2
.23 GP

3) Figures to the right indicate full marks.

4) Assume suitable data, if necessary.
E
81

8
C

23
ic-
Q1) a) What is functional dependency? Explain its use in database design. [9]
16

tat
Consider the following schema.
8.2

4s
Student (RollNo, Branch_code, Marks_Obtained, Exam_Name,
.24

Total_Marks)
3:1
91
Identify the functional dependencies and check whether the given schema
49

9:3
is in 3NF or not. If not justify and convert the schema into 3NF.
30
40
01
02

b) Explain following Codd’s rules with suitable examples: [8]

5/2
GP

i) Guaranteed Access Rule

6/0

ii) Comprehensive Data Sub-Language Rule

CE

iii) Integrity Independence

81

8
23
iv) Systematic Treatment of NULL Values.
.23

ic-
16

tat
OR
8.2

4s
.24

3:1

Q2) a) What is the impact of insert, update & delete anomaly on overall design
91
49

9:3

of database? How normalization is used to remove these anomalies? [8]

30
40
01

b) What is decomposition? Consider the relation F (FN, PN, C, D) with the

02

following Functional Dependencies: [9]

5/2
GP

FD1: FN, PN ->C

6/0

FD2: C ->D
CE
81

FD3: D -> F
.23

If F is decomposed in to F1 (FN,PN,C) and F2 (C,D). check

16

decomposition is lossless or lossy?

8.2
.24

[6262]-35 1 P.T.O.
49
 8
23
Q3) a) What is recoverable schedule? Why is recoverability of schedule

ic-
desirable?Are there any circumstance under Which it could be desirable

tat
to allow non recoverable schedular? Explain your answer. [9]

4s
3:1
b) State and explain the ACID properties. During its execution a transaction

02 91
9:3
passes through several states, until it finally commits or aborts. List all

0
possible sequences of states through which a transaction may pass.

40
6/0 13
Explain the situations when each state transition occours. [9]
0
5/2
.23 GP

OR
E
81

8
C

23
ic-
Q4) a) What is R-timestamp (Q) and W-timestamp(Q). Explain the necessary
16

tat
condition used by time stamp ordering protocol to execute for a
8.2

4s
read/write operation. [9]
.24

3:1
91
49

9:3
30

b) What is conflict serializability? Check following schedule is conflict

40

serializable or not? Also, explain the concept of conflict equivalent

01
02

schedule. [9]
5/2
GP

T1 T2 T3 T4
6/0

R(X)
CE

R(Z)
81

8
23
W(X)
.23

R(Y) ic-
16

tat
W(Y)
8.2

4s

W(X)
.24

3:1

W(Y)
91
49

W(Z)
9:3
30
40

R(X) denotes read operation on data item X by transaction Ti.

01
02

W(X) denotes read operation on data item X by transaction Ti.

5/2
GP
6/0

Q5) a) List the different NOSQL data models. Explain document store NOSQL
CE

data model with example. [8]

81

b) Draw and explain architecture of Distributed database system. State the

.23

reasons for building distributed database systems. [9]

16
8.2

OR
.24

[6262]-35 2
49
 8
Q6) a) Explain Structured, Semi-structured and Unstructured data types with

23
examples. [9]

ic-
b) Describe the following operations with MongoDB syntax: [8]

tat
i) Map-Reduce ii) Aggregation pipeline

4s
3:1
02 91
Q7) a) What is the significance of XML databases? Explain with proper example

9:3
when to use XML database. [9]

0
40
b) 6/0 13
Explain how encoding and decoding of JSON object is done JAVA with
example. [9]
0
5/2
.23 GP

OR
E

Q8) a) Write a short note on complex data types: [9]

81

8
C

23
i) Semi-structured data

ic-
ii) Features of semi-structured data models
16

tat
8.2

4s
.24

3:1
b) What is Deductive Database. Explain its features and state its
91
49

9:3
advantanges over traditional database. [9]
30
40
01
02
5/2
GP
6/0


CE
81

8
23
.23

ic-
16

tat
8.2

4s
.24

3:1
91
49

9:3
30
40
01
02
5/2
GP
6/0
CE
81
.23
16
8.2
.24

[6262]-35 3
49