Code No: l24CQ
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
[Link] II Year II Semester Examinations, May - 2017
DATABASE MANAG EIVTENT SYSTEVIS
(Common to CSE, lT;
Time: 3 ltrours Max. Marks: 75
-l-his
Note: qLrestiolt paper cotrtaitrs two parts A and B.
part A is contpulsory ri,hich carries ?5 nrarl<s. At-tsrver all questions in Parl A.
part B consists o1'5 Units. Ansrver any oue firll question froll-l each unit. Each
questiol carries [Link] and mal'have a. b. c as sr-rb qtlestiptls
PART - A
(25 Marks)
l.a) What is DBMS? What are the goals of DBMS? l2l
b) Explain about DDL and DML larrguages. t3l
l") I
c) Erplarn views in SQL language. L"I
d) Explain dotnain relational calcttlus. t3l
e) Define loss less join decontpos-ition with example' l2l
0 'Wirat is the diflelence betri'een 3NF and BCNIr? t3l
g) What rs locltirrg Protocol'? l2l
h) When are tivo schedules conflict equivalent? Wliat is conflict serializable schedule?
t3l
i) Wh1,3r. tree-strllctLtre indexes are good fbr searches. especialll'range sclectiotls. t2l
j) \\'hat is the train diflerence betu'een ISAM ar-rd B+ tree indexes':' t3l
PAltr-B
(50 Nlarks)
2.a) What are the main colllpollellts in a DBMS and brie111'erplairr r'i'l-rat tlrey do'
b) [.rplain the [ollorvirrg:
i) Vieu, of Data ii) Data Abstraction iii) Instances and Schernas. L5+51
OR
3.a) Deyelop [Link] for a hospital rvith a set of patients ancl a set of medical
doctors. Associated n,ith each patient a log of the various tests and examinations
cottd t tc tcd.
b) What is relation'i Diflereutiate betu,een a relation scherna and relation instance define the
terrn arity,and degree of a relation'l What are dot'naitr conslraints'l [5+s]
.1 a) t--rplain the lLrndarrentai operations in relational algebra tvith cratrples,
b) I-rxplain the fbllo* itlg Operators in SQI- n'ith exanrples'
i) SOI\4E ii) iii) EXCEPI-
lN ir') EXIS'IS [,s*5]
OR
5.a) Let R:(ABC) and S:(DE,F) let r(R) and s(S) both relatiorrs on schetra I{ and S. Give an
expressiop in the Tuple relational calculus that is equivaler-rt to each of the fbllou'ing
i) os.. r,i(r) ii) l [o ,'( o6-,2(rxs)) iii) r O s
key
b) What are integriiy constraints? Defirre the tertrs prinrart l<e1'constrains and foreign
constrairtts. Horv are these expressed in SQL? l5+5]
6.a) What is nortralizatiorr? What arc the conditiorrs are requirecl fbr a relation to be in 2NF,
3NF and BCNF explain u,ith eranrplcs.
b) CorrpLtte the closer o1'the lbllorrirrg set ot'tirncliorrrl depenclencics lbr a relation scherne.
i{(A.B"C.D.l-) F:iA)BCl. CD)E. Il)D"lr)A}
Lrst oLrt the candidate keys of R. [5-5]
OR
1a') What are the cunclitions are requircd tirr a relation to be in 4NF and INF explain with
eranrples.
b) oIthe ibllori'ing set of'fLnctiorul ciepenclencies lol a relatioir
CorrpLtte the closer scheme.
R(A,B.C.D.r-.F.C.t{). F:1,AB)Cr. BD)EF. AD)G.A)H}
[Link] the carrdidate ke1,5 s1'p. [5-5]
u a) \\ihat is transaction? Erplain the ACID Properties oltranssctions.
b) Explain the Checl< point Iog based recover\,schenre fbr recor,'ering the database. [5+5]
OR
9.a) Descrrbe the steps in crash recover\ in ARIES.
b) Explairr lhe'l'itna Stanrp - Basecl (loncurranct, Control protocol. |.5+5]
[Link] [Link] Delctiurr arrd in>erliorr operations in ISAM rvirlr cxarlplc>.
b) I-lou' does Exlendctl:le hashing use a director-r, ol [-rLrcliets'] IIorv does it lrarrdles insefi and
delete operations. 15+5]
OR
I l.a) Explain hou, insert and delete operations are handled ir-r a static hash index.
b) Erplairr cleletion and insertiorr operatiorr in B- trcas. [5+5]
---ooOoo---