pihar Engineenn University, Patna End Semeste™ Examination - 2022 As nestor? M Time: 03 Hours sjocs putine MERE System Pull Marks: 70 ui a ee oases sirctions= fo The marks are indicated in the right! (iy There are NINE questions inthis paper jempt FIVE questions inal Course: B.Tech. Code: 105502 nd msn, @.1_ Choose the correct answer of the follow px7= 14) (@) Four DML commands are (i create, update, delete, select (iii) ereate, alter, delete, select (b) View isa: ii) insert, update, drop, select (iy) insert, modify, delete, select (i) temporary table (i) virtual table (iii) dynamic table (iv) permanent table (©) The different levels of data abstraction are: (i) Physical level (i) Logical level Gi) View level (jy) all of the above (@)_ Which of the following is true? a super-key is always a candidate key ) every 3NF schema is also a BCNF. Gi) generalization is bottom-up approach. (iv) none of these. (©) What is the purpose of project operation: @ Itselects certain columns, (ii) It selects certain rows. Gii) It selects certain strings. (iv) It selects certain integers. (0) The weak entity set does not have sufficient attributes to from. (i) Primary key (i) Candidate key (ij Both (i) and (ii) Civ) Super key (g) Which normal form is considered adequate for normal relational database design? 4NF Gy) 3 NF (@2NF (i) SNF (h) Which of the following is not a super key in RCV, W, X.Y, Z) with primary key VY? (@VXYZ (i) VWXZ (iii) VWXY iv) VWXYZ (Consider R (A, B, C, D, E) with following FDs:~ AB, AC, CD>E,B > D, EA which of the following FDs is not implied by above set? (@CD>AC GBD > CD (iii) BC CD (iv) AC BC (i) Which of the following is a concurrency control protocol. (p Strict 2-phase locking protocol (i) Timestap based protocol (iii) Graph based protocol (iv) All of the above Q.2 (a) Whatis attribute closure X* of a set of attributes X with respect to a set of FDs F? 7 = Give the algorithm for commuting X* for X. (b) Relation R (ABCDEFGH) contains only atomic values for all of its attributes. F = 7 {CH PG, A > BC, B DCFH, E >, F> EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist? PT Page 1 of 2"G4 (a) Briefly explain the ACID propenies of she transactions to ensure integrity of the 1 lata. - (b) Consider the transactions T1, T2 4 schedules $1 and S2 given below: 71 ST], T2 ang 73 and schedules SI and $2 given bel TI stl (X); el(Z); wl (X) wane 72: 12(Y); 12 (Z); w2 (Z) T3213 (Y); 13 (X); w3 (Y) SU sel (Xs B(V); BEX); 12 CY); Izy, HV: _W2 (Zs #1 (Zs WUC), wl Z). S2ie1 (Xe 3 (VY); AV); 13(X)s r1(Zp, AZ); WS (Ys WL OD; w2Z), wl Z). Determine which of the above schedyles are conflict - serializable. +24 (a) Explain the reasons for the update, insertion and deletion anomalies: iu (b) With example discuss candidate key, super Key. primary key and foreign Key mm Q5 (a) What are the typical phases of query processing? With a sketch, discuss these m phases in high level query processing, 2 (©) When is the decomposition of relation schema R into two relation schemes X and ¥, (71 said to be a loss-less-join decomposition? Why is this property so importan Explain with example. Q.6 (a) Explain the terms ‘partial functional dependency’ and “transitive dependency’. 7 Define 2NF and 3 NF in relation with these terms. ] i (b) Discuss the concept of generalization, specialization and aggregation. vl Q.7 (a) Consider the following employee database, primary keys are underlined. [14] Employee (ename, street, city) Works (ename, ename, salary) Company (cname, city) “Manages (ename, manager-name) Write SQL queries to the names of all the employees who work for XYZ. di) all employees who live in the same city as the company for which they work. (iii) Find all employees who live in the same cities and on the same streets as do their managers. (iv) all employees who earn more than the average salary of all employees of their company. 8 (a) Discuss the advantages and disadvantages of using DBMS os compared toa [7] conventional file system. (b) What is weak entity set? Explain with suitable example. How weak entities are [7] represented as relational schemas. ¥0.9 Write short notes on any two of the following: [7x2=14] (a) SQL Injection (b) Two-phase locking protocol (©) Object Oriented DBMS. (4) Armstrong’s Axioms ee Ee eng eum Page 2 of 2