Total No. of Questions : 8] SEAT No.

8
23
P805 [5870]-1125
[Total No. of Pages : 2

ic-
tat
T.E. (Computer Engineering)

6s
DATABASE MANAGEMENT SYSTEMS

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

02 91
8:5
0
Time : 2½ Hours] [Max. Marks : 70

20
1/0 13
Instructions to the candidates:
1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
0
7/2
2) Figures to the right indicate full marks.
.23 GP

3) Neat diagrams must be drawn wherever necessary.

4) Assume suitable data if necessary.
E
81

8
C

23
Q1) a) Explain 3NF and BCNF and give its example. Also enlist their differences.

ic-
[8]
16

tat
b) What are the desirable properties of decomposition? Explain it with
8.2

6s
example. [9]
.24

8:1
OR
91
49

8:5
Q2) a) Explain partial and transitive dependencies with example. [8]
30

b) Explain why database normalization is required for good relational database

20

design? Explain with example requirements of different normal forms

01
02

like 1NF, 2 NFand 3NF. [9]

7/2
GP
1/0

Q3) a) What is conflict serializability? How to check schedule is conflict

CE

serializable schedule. Give one example. [9]

81

8
23
b) During execution, a transaction passes through several states, until it
.23

ic-
commits or aborts. List all possible sequence of states through which
16

tat
transaction may pass. Explain the situation when each state transition
8.2

6s

occurs. [9]
.24

8:1

OR
91

Q4) a) Consider the following two transactions: [9]

49

8:5

T31: read(A);
30
20

read(B);
01
02

if A = 0 then B:=B+1;
7/2
GP

Write (B)
1/0

T32: read(B);
CE

read(A);
81

if B= 0 then A: = A+1;
.23

write (A).
16

Add lock and unlock instructions to transactions T31 and T32, so that
8.2

they observe the two phase locking protocol. Can the execution of these
.24

transactions result in a deadlock?

49

P.T.O.
 8
23
b) To ensure atomicity despite failures we use Recovery Methods. Explain

ic-
in detail log based recovery method. [9]

tat
6s
Q5) a) Explain following NOSQL database types with examples and also state

8:1
the scenario where it is useful [9]

02 91
8:5
i) Column-oriented

0
ii) Graph

20
1/0 13
iii) Document -oriented
0
b) Explain CAP theorem and BASE properties. [8]
7/2
.23 GP

OR
E
81

8
Q6) a) Describe distributed database. Explain System architecture of distributed
C

23
transaction. [8]

ic-
16

tat
b) Explain following types of data with example [9]
8.2

6s
i) Structured
.24

8:1
ii) Semi-structured
91
49

8:5
iii) Unstructured
30
20

Q7) a) Write short note on [9]

01
02
7/2

i) Active database
GP

ii) Deductive database

1/0
CE

b) Explain how encoding and decoding of JSON object is done JAVA with
81

8
23
example. [9]
.23

ic-
16

tat
OR
8.2

6s

Q8) a) Write short note on [9]

.24

8:1
91

i) Geometric data
49

8:5

ii) Geographic data

30
20

b) What is object relational database? What are its advantages and

01
02

disadvantages? [9]
7/2
GP
1/0
CE
81


.23
16
8.2
.24
49

[5870]-1125 2
Total No. of Questions : 8] SEAT No. :

8
23
PA-1441 [Total No. of Pages : 2

ic-
[5926]-57

tat
T.E. (Computer / A.I.D.S. Engg)

0s
DATABASE MANAGEMENT SYSTEMS

2:4
02 91
(2019 Pattern) (Semester - I) (310241)

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

1) Solve Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

2) Neat diagrams must be drawn wherever necessary.
E
81

8
3) Figures to the right indicate full marks.
C

23
4) Assume suitable data, if necessary.

ic-
16

tat
Q1) a) Justify the impact of normalization on database? Explain 2nd normal form,
8.2

0s
3rd normal form and BCNF with example. [8]
.24

2:4
b) Elaborate the significance of codd’s rule. Explain 12 rules proposed by
91
49

3:3
codd’s. [9]
30

OR
31

Q2) a) What is the impact of insert, update and delete anomaly on overall design
01
02

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

1/2
GP

b) Explain 3NF and BCNF and give its example. Also enlist their differences.[8]
3/0
CE
81

8
Q3) a) Suppose a transaction Ti issues a read command on data item Q.How

23
.23

time-stamp based protocol decides whether to allow the operation to be

ic-
16

executed or not using time-stamp based protocol of concurrency control.

tat
8.2

Explain in detail time stamp based protocol. [9]

0s

b) Explain the concept of conflict serializability with suitable example. Since

.24

2:4
91

every conflict-serializable schedule is view serializable, why do we

49

3:3

emphasize conflict serializability rather than view serializability? [9]

30
31

OR
01
02

Q4) a) State and explain the ACID properties. During its execution a transaction
1/2

passes though several states, until it finally commits or aborts. List all
GP

possible sequences of states through which a transaction may pass.

3/0

Explain the situations when each state transition occurs. [9]

CE
81

b) A transaction may be waiting for more time for an Exclusive (X) lock on
.23

an item, while a sequence of other transactions request and are granted

16

as Shared (S) lock on the same item. What is this problem? How is it
8.2

solved by two phase lock protocol? [9]

.24

P.T.O.
49
Q5) a) Explain how NOSQL databases are different than relational databases?

8
23
Describe in detail the key value store NOSQL data model with example.[9]

ic-
b) Explain BASE properties with its significance. How soft state of system

tat
is depending on Eventual consistency property? [8]

0s
OR

2:4
Q6) a) List the different NOSQL data models. Explain document store NOSQL

02 91
data model with example. [9]

3:3
0
b) State and explain the concept of CAP theorem and BASE properties

31
3/0 13
with example. [8]
0
1/2
.23 GP

Q7) a) Write short note on : [9]

i) Active databases
E
81

8
ii) Deductive databases
C

23
b) What is the significance of XML databases? Explain with proper example

ic-
when to use XML database. [9]
16

tat
OR
8.2

0s
Q8) a) Difference between relational databases and object relational databases
.24

2:4
91
with example [9]
49

3:3
b) Describe the significance of JSON data type and object. Discuss with
30
31

syntax all JSON data types with suitable example. [9]

01
02
1/2


GP
3/0
CE
81

8
23
.23

ic-
16

tat
8.2

0s
.24

2:4
91
49

3:3
30
31
01
02
1/2
GP
3/0
CE
81
.23
16
8.2
.24

[5926]-57 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P-268 [Total No. of Pages : 3

ic-
[6003]-346

tat
7s
T.E. (Computer/A.I.D.S.)

8:2
02 91
DATABASE MANAGEMENT SYSTEM

0:2
0
(2019 Pattern) (Semester - I) (End Sem.) (310241)

31
6/0 13
0
Time : 2½ Hours] [Max. Marks : 70
6/2
.23 GP

Instructions to the candidates:

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

8
2) Neat diagrams must be drawn wherever necessary.
C

23
3) Figures to the right indicate full marks.

ic-
16

tat
4) Assume suitable data, if necessary.
8.2

7s
.24

8:2
91
Q1) a) What is the impact of insert, update & delete anomaly on overall design
49

0:2
of database? How normalization is used to remove these anomalies?
30
31

[6]
01
02

b) Explain different features of good relational database design. [6]

6/2
GP
6/0

c) Explain following Codd’s rules with suitable examples : [6]

CE
80

8
i) Guaranteed Access Rule

23
.23

ii) Comprehensive Data Sub-Language Rule ic-

16

tat
8.2

7s

iii) High-Level Insert, Update, and Delete Rule

.24

8:2

OR
91
49

0:2
30

Q2) a) Explain entity and referential integrity constraints used in SQL. [6]
31
01
02

b) Define 3NF. Explain with example, how to bring the relation in 3NF?
6/2

[6]
GP
6/0

c) Explain following Codd’s rules with suitable examples : [6]

CE
80

i) Physical Data Independence

.23

ii) Integrity Independence

16
8.2

iii) Systematic Treatment of NULL Values

.24
49

P.T.O.
Q3) a) State and explain the ACID Properties. During its execution, a

8
transaction passes through several states, until it finally commits or

23
aborts. List all possible sequences of states through which a transaction

ic-
may pass. Explain the situations when each state transition occurs. [9]

tat
7s
b) Check whether following schedule is view serializable or not. Justify

8:2
your answer. (Note : T1 & T2 are transactions). Also explain the concept

02 91
0:2
of view equivalent schedules and conflict equivalent schedule

0
considering the example schedule given below : [8]

31
6/0 13
T1 T2
0
6/2
.23 GP

read (A)
A := A – 50
E
80

8
C

23
read (A)

ic-
16

tat
temp :=A * 0.1
8.2

7s
A := A - temp
.24

8:2
91
write (A)
49

0:2
30

read (B)
31
01
02

write (A)
6/2
GP

read (B)
6/0
CE

B := B + 50
80

8
23
.23

write (B)
ic-
16

tat
B := B + temp
8.2

7s

write (B)
.24

8:2
91
49

OR
0:2
30
31

Q4) a) Suppose a transaction Ti issues a read command on data item Q. How

01

time-stamp based protocol decides whether to allow the operation to

02

be executed or not using time-stamp based protocol of concurrency

6/2
GP

control. Explain the situations when each state transition occurs. [9]
6/0
CE

b) Write a short note on : [8]

80
.23

i) Log based recovery

16

ii) Shadow Paging

8.2
.24
49

[6003]-346 2
Q5) a) BASE Transactions ensures the properties like Basically Available,

8
Soft State, Eventual Consistency. What is soft state of any system,

23
how it is depend on Eventual consistency property? [6]

ic-
tat
b) Enlist the different types of NOSQL databases and explain with suitable

7s
examples. [8]

8:2
c) What is structured and unstructured data. Explain with example. [4]

02 91
0:2
OR

0
31
Q6) a) 6/0 13
Explain the CAP theorem referred during the development of any
distributed application. [6]
0
6/2
.23 GP

b) Analyze the use of NOSQL databases in current social networking

environment also explain need of NOSQL databases in social
E
80

8
networking environment over RDBMS. [6]
C

23
ic-
c) Explain the difference between SQL and NOSQL database. [6]
16

tat
8.2

7s
Q7) a) Write a short note on emerging databases : [9]
.24

8:2
91
i) Active and Deductive Databases
49

0:2
30

ii) Main Memory Databases

31
01

b) What is object relational database system. Explain Table inheritance

02

with example. [8]

6/2
GP
6/0

OR
CE
80

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

8
23
.23

i) Semi-structured data
ic-
16

tat
ii) Features of semi-structured data models
8.2

7s

b) Describe spatial data like Geographic data and Geometric data. [8]
.24

8:2
91
49

0:2


30
31
01
02
6/2
GP
6/0
CE
80
.23
16
8.2
.24
49

[6003]-346 3
Total No. of Questions : 8] SEAT No. :

8
23
P-7537 [Total No. of Pages : 2

ic-
[6180]-45

tat
3s
T.E. (Computer Engg./Artificial Intelligence & Data Science)

4:5
02 91
DATABASE MANAGEMENT SYSTEM

9:4
0
(2019 Pattern) (Semester - I) (310241)

30
9/1 13
0
Time : 2½ Hours] [Max. Marks : 70
1/2
.23 GP

Instructions to the candidates:

1) Answer Q. 1 or Q. 2, Q. 3 orQ. 4, Q. 5or Q. 6, Q.7 or Q.8.
E
82

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

3s
.24

4:5
91
49

Q1) a) What is anomaly in relational model. Explain how normalization can

9:4
30

be used to reduce the anomalies. [9]

30
01
02

b) Explain 2NF and 3NF and BCNF with example. [9]

1/2
GP

OR
9/1
CE
82

Q2) a) What are relational integrity constraints. Explain with example Domain

8
23
constraints, Referential-Integrity and enterprise constraints. [9]
.23

ic-
16

tat
b) Elaborate the significance of codd’s rule. Explain 12 rules proposed
8.2

3s

by codd’s. [9]
.24

4:5
91
49

9:4
30

Q3) a) Explain the concept of conflict serializability with suitable example.

30

Since every conflict-serializable schedule is view serializable, why do

01
02

we emphasize conflict serializability rather than view serializability?

1/2
GP

[9]
9/1
CE

b) Explain the two-phase lock protocol for concurrency control. Also

82

explain its two versions: strict two-phase lock protocol and rigorous
.23

two-phase lock protocol. [8]

16
8.2

OR
.24
49

P.T.O.
Q4) a) What is R-timestamp(Q) and W-timestamp(Q) Explain the necessary

8
condition used by time stamp ordering protocol to execute for a read /

23
write operation. [8]

ic-
tat
b) To ensure atomicity despite failures we use Recovery Methods Explain

3s
in detail following Log-Based Recovery methods with example. [9]

4:5
02 91
i) Deferred Database Modifications

9:4
ii) Immediate Database Modifications

0
30
9/1 13
0
1/2
Q5) a) Compare SQL and NOSQL Database. [6]
.23 GP

b) Explain BASE Properties of NOSQL Database. [6]

E
82

8
C

c) Explain Document Based and Key value data model of NOSQL

23
Database. [6]

ic-
16

tat
OR
8.2

3s
Q6) a) Explain the CRUD operations used in MongoDB with example. [6]
.24

4:5
91
49

b) State and Explain CAP Theorem. [6]

9:4
30
30

c) Explain Map Reduce with example. [6]

01
02
1/2
GP

Q7) a) What are spatial data. Explain Geographic and Geometric data. [8]
9/1

b) What is the significance of XML databases? Explain with proper

CE
82

8
23
example when to use XML database. [9]
.23

OR ic-
16

tat
8.2

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

3s
.24

4:5

i) Semi-structured data
91
49

9:4

ii) Features of semi-structured data models

30
30

b) What is object relational database system. Explain Table inheritance

01
02

with example. [9]

1/2
GP
9/1


CE
82
.23
16
8.2
.24
49

[6180]-45 2
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