July 2013

You might also like

Download as pdf
Download as pdf
You are on page 1of 2
Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com es (TL toc Fifth Semester B.E. Degree Examination, June/July 2013 Database Management System “Pimet 3 hrs. Moff Marksgh00 Note: Answer FIVE full questions, selecting atleast TWO questions from each part. 3 i PARA é Fa what ae the main charctersis of the dabae approactoui fhe processing ; apres? ‘cesar J Bete citeem cuegores of data nme ioeNare ooo ? centre) Z2 2 a. Explain ce diferent types of atributes that ofr in model. Write their ig corresponding notations (08 Marks) Teh Wate he ER dagram foran employee database. Mon its ar 5 flows: i D An coployee works rx doptnent 3 very Serermet iced by 2 mana i il) ancaplayer wors on ots or more aS i WW Altombloges hes epenees ii ©) A departeenn contrels the projects (amas) BE 5 a. wteme ational algebra oper 10 Rea he Following queries as i) Retrieve the name and Ines .all employees who work for the “Accounts” Sega 1 Rereare the names signa aggre o depen ii) Pinte name a Frnt on al ths peje Conroe by depanmen ented rey expla he icon oes romset theory, wih examples. tau) 4a. Explain the aiff suitable examples b. Write the nf Wapstraints that can be applied during table ereation in SQL, with a (08 Marks) 3 the following database schema deni, apes evaher a 1. On completiag our annwers, computa dw dag agg ANCH PERCEMTAGE) tet DEPARTMENT. DESTONATION, SALARY) : MEH ; ex N. GRADE) i a Nac a secs ero for tbe one °C3 = 4° g the departments having an average salary of the faculties above Rs 10,000 3 Ta asc suersenelied or he couse CS ~ 31" end faving "B-grade 3 Eo i * varr—m i SME fine views, Give an example to create a view. (08 Maris) Free ne ahaa cerning isla ia wetian a ote plocatkegeeres noes vor BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com 6 a. List the inference rules for functional dependencies. Write the algorithm to det closure of X(set of attributes) under F(set of functional dependencies). b. Define the INF, 2NF and 3NF with a suitable example for each. Write the algorithm fro testing non additive join property. Explain the 4NF with a suitable example. Explain the ACID properties of a database transaction. Mos stares . Brefly explain the two phase locking protocol used in concurrency (08 Marks) {08 saris) oP . Explain the three phases of the ARIES recovery model. 20f2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative

You might also like