SPPU-TE-COMP-CONTENT – KSKA Git

Total No. of Questions : 8] SEAT No. :

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

tic
[6003]-346

sta
T.E. (Computer/A.I.D.S.)

:27
1
DATABASE MANAGEMENT SYSTEM

:28
6/2 309
10
(2019 Pattern) (Semester - I) (End Sem.) (310241)

3
01
Time : 2½ Hours]
02 [Max. Marks : 70
GP

Instructions to the candidates:

6/0

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

CE
80

8
2) Neat diagrams must be drawn wherever necessary.

23
.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
49

Q1) a) What is the impact of insert, update & delete anomaly on overall design
0:2
30

of database? How normalization is used to remove these anomalies?

31

[6]
01
02
6/2

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

GP
6/0

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

CE
80

8
23
i) Guaranteed Access Rule
.23

ii) Comprehensive Data Sub-Language Rule ic-

16

tat
8.2

7s

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

.24

8:2
91

OR
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]
.23 GP
6/0

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

E
80
C

i) Physical Data Independence

16

ii) Integrity Independence

8.2

iii) Systematic Treatment of NULL Values

.24
49

P.T.O.
 SPPU-TE-COMP-CONTENT – KSKA Git
Q3) a) State and explain the ACID Properties. During its execution, a

8
-23
transaction passes through several states, until it finally commits or
aborts. List all possible sequences of states through which a transaction

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

sta
:27
b) Check whether following schedule is view serializable or not. Justify
your answer. (Note : T1 & T2 are transactions). Also explain the concept

1
:28
6/2 309
of view equivalent schedules and conflict equivalent schedule

10
considering the example schedule given below : [8]

3
01
02
T1 T2
GP

read (A)
6/0
CE

A := A – 50
80

8
23
.23

read (A)

ic-
16

tat
temp :=A * 0.1
8.2

7s
A := A - temp
.24

8:2
91
49

write (A)
0:2
30
31

read (B)
01
02

write (A)
6/2
GP

read (B)
6/0
CE
80

B := B + 50

8
23
.23

write (B)
ic-
16

tat
B := B + temp
8.2

7s

write (B)
.24

8:2
91
49

0:2

OR
30
31

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

01
02

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

6/2

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

.23 GP

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

b) Write a short note on : [8]

C

i) Log based recovery

16

ii) Shadow Paging

8.2
.24
49

[6003]-346 2
 SPPU-TE-COMP-CONTENT – KSKA Git
Q5) a) BASE Transactions ensures the properties like Basically Available,

8
-23
Soft State, Eventual Consistency. What is soft state of any system,
how it is depend on Eventual consistency property? [6]

tic
sta
b) Enlist the different types of NOSQL databases and explain with suitable
examples. [8]

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

:28
6/2 309
10
OR

3
Q6) a) Explain the CAP theorem referred during the development of any
01
02
distributed application. [6]
GP

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

6/0

environment also explain need of NOSQL databases in social

CE
80

8
networking environment over RDBMS. [6]

23
.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
49

i) Active and Deductive Databases

0:2
30

ii) Main Memory Databases

31
01
02

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

6/2

with example. [8]

GP
6/0

OR
CE
80

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

23
.23

ic-
i) Semi-structured data
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
.23 GP
6/0
E
80
16
.24
C
8.2
49

[6003]-346 3