4of4

Page ) 2 2)6
er (a) (b (a (b) g0R1A)
(a)
(b ct
(c) s serializability?
Deferred
with
and Thomas'
view sWhat
l Cornmitr3, S:
tirnestampandexampte
modification
scheme.
Differentiate
What
recovery
database Explain
alordering Readrs(A),
Writers(A), S:Check Explain
protocolC
locking
Differentiate
failure?
system
schemeWhat A-A-500
CommitWrite Write(B)
(A) Read(A) T1:
Check
Readr1(A), its cascadeless T)
Readr1(A),
actions whether whether the
steps modificationsoperatiorns
writc protocol the
using operaiontechnique
modfication, based
need Eetdeh 12
are
between Reada(A),
rule
approach the
RIB)
will or
heckpointsCommit T2:
protocol the toReadrz(B), of
Read(B)
takenWrite(B) B-B100 in so given not.
given
for be log handle
in
the that are
cascadelessrigorous
iftaken
based Writer1(A), the used schedule
by followingDeferreda or
schedule
failure irnmediate a Cormmitr2,
Readr2(A),
a
a done not write Writer1(A),
schedule ( by given and
tolog byrecovery
the schedule
S strjct
recoverbased Read( C
) T3: occurs
schedule: and the S(Q)
according to
WriteTa(A). can is
will
order
operation. time recoverable
immediate g
lotechnique Commitr1, two
fron after database complete
recovery ensure stamp
with phase 2
based using
the an
a
2 2 2 2 2
2T)72
netalp
Unelolt2 -15IT7DRNMS

24)
along techniques
understandandTo
database To given relational
the queries TO
To through
components Marks:
Full 6O
To Programme:
(a) l "Bloom' andfunctional
decomposition
(L3), stransactionnormalizatiorn principles
andconstruct
analyze Subject/Course
Outcome
identifyLearning
(c) Analysindatabase analyze apP
(b) with conceptual user END-SEMESTER
EXAMINATION,
AUGUST-2022
on the and
hitectures. Answet taxonony the
Explain
tierlogical WhatExplain requirenents an
through relational
relational
algebra
calcuhus and
database and Introduction
(LA), the and
and ER
system issues enterprise their and BTech
all concept schema explain
Evaluation levels: database diagram
and is questions,
the design database functionalities
the data interdependence
ER schenas
architecture. architecture
physical role interpret
related the to
the
difference Knowledge of modeling schema
and
indepéndence? Instinute
of Each (L5), ecovery relational express ifferent to
storage designapply
a Creation using Databases of
to for Techniaaf
datadatabasequestion of
(Ll), to
between Taxon
independence. (L6)
Comprehension Level Ecathon
carries L6 L4 L2
administrator.
Differenthate
two (CSE
&
page equal 8 c.7 3a.b,c Research
tier 10
a,
b.a,b, c,9 a,b, a.b,5c.4 a,
c,2 a,b,c, Nos.Ques. Hours
Time: 3
b,ca, a,b,c 2b h
1 b,ca, 6 1
Semester:6t3151)
of mark. (L2),
4
and SOA
between Application Marks G
three 24 10 6 8
12

2 2 2

4PE
NOTE 5 PRO
 Page
4. (a)3.
2 2.
of (b)
4 (a) (c) (b
(c) (b) (a)
Consider
Functional
BCNF
D->B). Justify
dependerncies
|B->A,C->B,AB Consider schema to
cardinality
IllustrateTranslate mapping
Check corresponding
diagram.
schema database details
and department.
anycourse.dept. budget.
courses. represernted isTheuniversity.
acoursecourses
CAD its
Consider weak differentWhat example.
What Distinguish with
or courses represented the by
whether
your corresponding
Comment
not of entity is
is
the resulted the id,
Dependency the the
representing new One offered a weak from
with relationalanswer title,Each semi
bn referential ER Draw The association
One by database set
C->D >D) departments, course the betweer
reaso
whether following
the a
course
entity
is
structured
diagram database by relational
using relation ce in
relational the department unique credits. determined?
set is various set? candidate
D que
integrity entity ER is is
Schema possible participation
constraints. of maintaining
R
Ab Armstrong's
FAB : set represented relationship
exactly course represented How
property
satisfiesof schemas diagramwhich has dname, Each model? data
3(b) schema. set,
R(A,B,C,D) F for also can departments the key
B>CD.c. in 0 relationship
has offered department and model?
D. of and the for offer building, the primary and
F+
axioms. R(A,B,C,D): included
in not department by
functional relational draw que, th e named as details )
&) ->A, or by a (super
How
offered multiple
above unique
s4 with not. 3(a) of key
its set, the one and is key
is a of of it
8) 2 2 2 2 2 2 2

6()se
eonks A cc (kev,cty E(omang Ace - 'Delk')) )4
6 4H 5
105S:
(c) (b) (a) Write(b) a Consider(b) (al (c)
serializable
Commitrn,
Readrz(A),
Commitr Differentiate
schedule
Check isolation Bhubaneswar.
and Whatworking the
displayWriteCuttack findworkingand inWrite Consider F|B->A,
each basedsatisfies
followingtheattribute FinFunctional
d3NE of
F.
Functional
Consider 4(b) is
notBCNF
F{B>A,
employees
the O a decomposed
Readr1(A),whether is a (company
CompanyWorks on
query
using relational Employee decomposition
proper
with
transaction? inthquery
e andnameTupie the
any canonical
and relational
Schema
AD the AD the
and decomposition ofR
Dependency :
setDependency
set:desirable.
durability
between salary (ername, property
Readr(B), ->B, ->B,C->AD).
relational
recoverable the conpany usingworking of
algebra (eriame, schema. the
given relational
Domain the
example. and functionalcover C->AD;. of answer
Justify
your
Explain
a in salary
conpany relaional of
transaction.
schedule property of query saity, 3NF
placedname enployeesthe Schema the
name,
city) Represent of F. Find et
Writer1(A), or serial relational RIB,À) or schemã
not more Comment
whether R
the in ofconpany tonamne,
eatate)dependency not the
and DELHI.. find schemas? specified withR(A,B,C,D)
WriteraB). the with R(A,B,C,D)
canonical
isSusefulness living
cityin than the Y2 given
conflict Calculus2,
to Calculus 20
to salaryi"*pb C0) a,
serializable employees placed |AD, reason.
(lg 80,000name aR2( thekey 5(a)in2 in
113 BD)(ON H 8)set cover with que
of in of
ec sl0A pf, 2
2 2 2 2