B.TECH - Semester 5 database design Question Paper 2021 (dec)
Practice authentic previous year university questions for better exam preparation.
- (a) Draw the ER diagram of college library management scfiware. 10
- What are ACID properties in transactions?
- Write short noles on any four types of dalabase users.
- (b) Write short noles on
- (c) How is database recovery done based on delerred updale? ..... 10
- (b) Explain how database recovery can be done using immedlate updale melhad. ..... 10 $$ (1 \times 20=60 \text { Marks }) $$
- Differentiale sequential and indexed sequential files.
- Explain how dala independence is ensured in thres schema archilecture,
- What do you mean by referential integrily constraint?
- What are super keys, candidale keys, primary keys and secondary keys?
- Explain UNION and INTERSECT operation in relational algebra with an example.
- Diferentiale 3 NF and BCNF wilh an example.
- What is meant by two phase locking? $$ (10 \times 4=40 \text { Marks }) $$ Answer one full queslion from each Moduls.
- (a) Explain about the vanous adwantages in using database approach: 10
- (b) Explain how insertion is dons in B Tree with example. 10 OR
- (b) Explain the various steps to convert ER mocel to relational model. Module - II
- (a) Consider the schema: EMPLOYEEsemployee io. First_Name, Last_Name, Depl_id, DOB, Salary) DEPARTMENT(Depl id. D_Name, Manager_id, Localion_ic) PROJECT(Pid, Pname, Localion, Manager_id) Write the following relational algebra queries.
- (i) Display the names of all the employees working in 'Research' depariment willy their DOB. (ii) Find the names of all projects localed in 'Kochi'. (iii) Find the name of the department which controls the project wilh name 'ATC123'. (iv) Display the names and DOS of all employees whose salary is gr...
- (i) Multi-valued dependencies and fouth normal form (ii) Armsirong's inference rules. OR 2
- (a) Consider the $\mathrm{R}=\{A, B, C, D, E, F, G, H, t, J\}$ and the sel of funclional dependencies. $$ F=\{\{A, B\} \rightarrow\{C\},\{A\} \rightarrow\{D, E\},\{B\} \rightarrow[F] \rightarrow\{G, H\},(D) \rightarrow\{1, A\} . $$ What is the key for $R$ ? Decompose the relation to the highest no...
- (b) Write the algorithm to find minimal cover of a sel of FDs. 5
- (c) Whal do you mean by equivalence sel of FDs? 5
- (a) What are the various threats to dalabase systems? ..... 5
- (b) How schedules are characlerized based on recoverability? ..... 5
- (a) Explain how timestamp ordering based concurrency control is done? ..... 10
- Why is concurrency control needed in database?
Browse Previous Year Question Papers →