Printed Pages: 02 ‘Sub Code:KCS-501 Roll No. B.TECH. (SEM V) THEORY EXAMINATION 2022-23 DATABASE MANAGEMENT SYSTEM Time: 3 Hours Total Marks: 100 Note: Attempt all Sections, If you require any missing data, then choose suitably. SECTION A 1. Attempt aif questions in brief. 2x10 = 20 (a) List any four disadvantages of file system approach over database approach. (b) Differentiate between physical and logical data independence. (©) What is the difference between DROP and DELETE command? (4) What are different Integrity Constraints? (©) _Listall prime and noneprime attributes In Relation R(A,B,C,D,E) with FD set F={AB—C, BE, CD} (8) Explain MVD with the help of suitable example. (g) Discuss Consistency and Isolation property of a transaction. (h) Draw state diagram and discuss the typical states that a transaction goesthrough during execution. (Discuss Conservative 2PL and Strict 2PL. (Describe how view serializability is felated to conflict serializability. SECTION B 2. Attempt any ¢hree of the following: 10x3 = 30 (@) A database is being constructed to keep track of the teams and games of a sport league. A team has a number of players, not all of whorisparticipate in each game. It is desired to keep track of players participating in each game for each team, the positions they play in that game and the tesult of the game. (i) Design an E-R schema diagram for this application, (ii) Map the E-R diagram into relational model: (b) What are Joins? Discuss all types of Joins with the help of suitable examples. (©) Asset of FDs for the relation RYA, By, D, E, F} is ABC, C+ A, BC > D,ACD — B, BE > C, EC + FA, CF > BD, D— E. Find a minimum cover forth is set of FDs (@ What is a schedule? Define the coricepts of recoverable, cascade less and strict schedules, and compare them ih terms of their recoverability (©) Discuss the immediate, update recovery technique in both single-user and multiuser environments” What are the advantages and disadvantages of immediate update? SECTION C Attempt any one part of the following: 10x1 = 10 (a) Describe the three-schema architecture. Why do we need mappings between schema levels? How do different schema definition languages support this architecture? (b) What are the different types of Data Models in DBMS? Explain them. Downloaded from : uptukhabar.netAttempt any one part of the following: 10x1=10 @ (b) ‘Attempt any one part of the followin, Consider the following schema for institute library: ‘Student (RolINo, Name, Father_ Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RolINo, ISBN, Date-of -Issue) Write the following queries in SQL and relational algebra: i) List roll number and name of all students of the branch “CS i) Find the name of student who has issued a book published by “ABC” publisher. (iii) List title of all books and their authors issued to a student ‘RAM’ (iv) List ttle ofall books issued on or before December 1, 2020. (¥)_ List all books published by publisher “ABC” Explain different types of Triggers in SQL/PL SQL. 10x (a) Given the following set of FDs on schema R (V,W,X.Y.Z) (ZV, WY, XYZ, V-+WX/State whether the following decomposition are loss-less-join decompositions or not. (i) RI“(VW,X) , R=WV,Y,Z) (i) RIF(V.W.X), RI=“CGY.Z) (6) Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = { {A, B}={C}, {A}>{D, E}, {B}{F}, {F}>{GH}, {D) 1, J} }. What is the key for R? Decompose R into 2NF and: then3NF relations. Attempt any one part of the followings 10x1 10) (a) Consider schedules $1, S2r-and $3 below. Determine whether each schedule is strict, cascade less, recoverable, or non recoverable. (Determine the strictest fécoverability condition that each sohgdule satisfies.) SI: rl (X); 12 (2), 4) (ZY; 13 (Xs 13 CY); wh (Xs el; w3 (¥); e352 (W); w2 (2); w2 (1); 25, S2: rh (Xs 12 Zee (Z)s 13 (Xs 13. Cs wl (Xs w3 (95.12 CY); w2 (Z); w2 (Ws cl;e2; €3, S83: rl (XM); 12 (Zs 1B (Xs 11 Zs #2 (Ws 13 (Ys WAL A; el; w2 (Zs w3 (VY); w2 (¥)5e3; 25 (b) Consider the three transactions T1, T2, and T3, and the schedules $1 and S2given below. State whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule(s) Trl (X11 Zs wl Xs T2: 12 (Z); 12 (¥); w2 (Zs w2 We T3: 13 (X);13 (¥); w3.(Y); SU: 1] (X)s 12 (Z)s rl (Z)s 13 (YEAS (W)s wl (Xs w (¥); 72 (V); w2 Zs w2 (Vs 82: 1 (X)s x2 (Z)s x3 (Xj ANZ); 12 (V5 13 (Ys wl (XY; w2 Zs w3 (YY; w2 CVs Attempt any one part of the following: 10x1 = 10 (a) Discuss the timestatip ordering protocol for concurrency control. How does strict timestamp ordering differ from basic timestamp ordering? (b) How do optimistic concurrency control techniques differ from other concurrency control techniques? Why they are also called validation or certification techniques? Discuss the typical phases of an optimistic concurrency control method. Downloaded from : uptukhabar.net