l3ke,8,4 (psr48,4> © (Planets) 4.450000) } 4) {pl3lp, $0000} ( € Planets ‘ p>50000)} Answer: b) Explanation: Options (a) and (d) are ruled ont as <> axe not present. Option (e) is syntac- tically incorrect (Refer to slide 12.28). Option (b) is syntactically and semantically correct6 Question 7 Consider the following scenario: A Natural resource management company keeps a recond of different forests, identified by their names. A forest is associated with its location thal contains the Country and area in which the [orest is present, In cach forest, there are different types of trees that are also recorded by the ‘company. ‘Which of the following sehema correctly represents the Forest entity set? Marks: 2 MCQ 4) Forest (lane, Location, Trees) >) Forest (ame, Country, Area), Forest.trees (ane, Tres ) ©) Forest (Wiane, Trees), Forest Location (liane, Location, Country, Area) @) Forest (ane, Country, Area), Forest trees (lane, Trees) Answer: b) Explanation: Refer to slide 14.28 for details In the schema of option (a), the location is not properly explained. In the schema of option (c), the attribute Name cannot be primary key in the Forest relation, In the schema of option ((), the attribute Naxe eannot be primary key in the Forest. tre relation, ‘The schema in option (b) specifies the location correctly and eaptures the tree information in a forest-as well, Hence, option (b) is correctQuestion 8 Consider the following Entity Relationship Diagram: Book $2 Author |Auth_pub Publisher Which of the following is (are) true? Marks: 2 MCQ 4) Participation of Author in Auth. pub is total \) Participation of Publisher in Auth pub is total 6) A Book can be written by multiple Authors. 4) An Author can be associated with at most one Book. Answer: b) Explanatios ‘One Author m One Author may be related to zero or more Publisher. So, the participation of Author in ‘the relation Auth_pub is partial A Publisher may have one or mote Authors, So, the pact relation Auth pub is total, Hence, option (b) is cotrect According to the syntax of Crows feet notation, the following can be concluded. write many Books. ation of Publisher in the Question 9 Consider the instance of the relational schema Gallery(PaintingID, Artist, Theme) andPrice(PaintingID, Cost): Gallery Price PaintingiD | Artist | Theme | | PaineingID | Cost 742 ‘T.Ray | Landscape ‘aia | 124000 aisT J.Ray | Portrait aisr— | 239876 BS Katier | Abstract, Bs | 1000000 2a | Littouston | Landacape 23__| s0000 How many tuples will be generated by the following Tuple Relational Caleulus expression? {UlSp € Gallery =9 € Price(t[PaintingID) = pPaintingID] A [artist] = plartist] a plane) \ ([Cest] — g[Coet] / p/Paintingi0] — q/PaintingID))} Marks: 2 MCQ a3 wa 8 @ 10 Answer: b) Explanation: According to slide 12.33, the given Tuple Relational Caleulus expression is equivalent to Gallery * Price in Relational Algenra, Hence, option (b) is correct Question 10 Consider the instance of the relational schema Gallery (PaintingID, Artist, Theme): Gallery PaintingID | Artist 7 Thay ater J.Ray | Portrait Ra Katia? | Abstract23 | Lilouston | Landecape Which of the following Relational Algebra expressions produce(s) exactly the same tuples as present in this instance of GalLery? ‘Marks: 2 MSQ. ®) TipaintingID, Artist Gallery) ¥ Mpaint ingID, Thene(allery) ») Tipaintingto artist Gallery) # Threat, thene(Gallery) © Tipasnt ingiD, Thene(Gal0r7) » TlpaintingID, Thene( Gallery) @) paint ingiD, Thane Artiat (Gal2¢ry) * Tpyene (Gallery) Answer: a), d) Explanation: Option (c) is incorrect as Artist will uot be present in the output. Option (b) Js incorrect as it produces ? extsa tuples due to the redundant value J. Ray in the common attribute. Options (a) and (d) ate correct. 10 Database Management System: Assignment 4 ‘etal Maks: 20 June 20, 2022 Question 1Consider a relational schema OalineClass(class1D, classLink, Subject, Mentor, Duration) Which of the following set of functional dependencies should be chosen so that OnlineClaas can be in 2NF but not in 3NF? ‘Marks: 2MCQ a) classID + {classLink Subject} classLink + Duration Mentor > Subject ) {claseID,claseLink} + {Subject ,Mentor Duration} {Mentor Subject} + (claseLink,Duration,claselD) €) {claseID,Mentor} — {classLink,Subject} classLink + Duration @) {claseID,claseLink} + {Subject Mentor Duration} Nentor > claseLink Answer: ©) Explanation: For option (b), the candidates keys are {class1D, classLink}, {Mextor, Subject} which are present on the L.H.S of hath the finetional dependencies. Ths, it makes OnLineClaas to stay in BCNF, For option (a), the candidate key is {claseID, Mentor}. Since partial dependency is present in the FD set, it allows alineClass to be in INF. For option (d), the candidate keys are (clasaID, claseLink}, {classID, Mentor}. Hence, there is neither any partial dependeney nor any transitive dependency as the RLS of the second FD contains a key atteibute, Hence, tis in SNF. In option (¢), the candidate key is {class1D, Mentor} There is no partial dependeney and there is a transitive dependency. ‘Thus, option (¢) is correct Question 2 ‘The following dependencies hold ina relation Placement (JoBID ,Company, Position, Salary) JobID > Conpany [Position, Company} > Salary According to which of the following rules, {JobID, Position} + Salary holds? Marks: McQ 8) Decomposition 1b) Augmentation 6) Paendorteanstivity 4) Trasitivity Answer: ¢) Explanation: According to Pseudo-transitivity rile, if x determines ¥ and ¥2 determines then XZ determines ¥, Hence, option (c) is correct.Question 3 Consider the following instance of Market relation: Warket MarketName | Product | Stock | Spendviee Shampoo | 12 SpendWise | Spicesiz [6 Spendiise Cookies | 6 ShopLuck ‘Shampoo | 20 WarkIe Cakonix | 60 MarkIe Chocolate | 12 Which of the following funetional dependencies hold on Market? Marks: 2MCQ a) MarketNane + {Product, Stock} ) (Stock, Markettiane) + Product ©) {Product} + Marketiiame ) (Marketliane, Product} > Stock Answer: d) Explanation: Only for option (i), the attributes on the LHS attributes on the RH.S, Hence, option (d) is correct, S can uniquely identify theQuestion 4 Consider the following relation: Measurenent (censor, device, dataform, uprange, lovrange, delay, status) with the following functional dependency set (F): FDL: {sensor, device, status} +> {dataform, uprange, lovrange} #02: seneor “> {delay, status} FDS; {status, delay, datafora} + {sensor, device} Measurement has 3 candidate keys. Keys KL, K2, and K3 have 2, 2, and 3 attributes re- spectively. The database admin issnes the following order A needs to be appended to the R.H.S of FD& so that only K3 and (K1M.K2) become the ean. dlidate keys of Measurement, Find & aud 4, Marks: 2MCQ a) vice, iat b) Xedelay, ist ©) Nedataform, i=2 4) Aeetatue, & ‘The 8 candidate keys of Measurement are levice, sensor} ldataform, sensor} Jdataforn, delay, status} KIN K2 =sensor For sensor to be the candidate key, elther device or dataforn needs to be appended to the R.HLS of FD2. Hence, option (c} is correct,Question 5 Consider the following relation: Measurement (sensor, device, dataform, uprange, lovrange, delay, status) With the following functional dependency set. (F): {eensor, device, status} + {dataform, uprange, lovrange} sensor “+ (delay, atatu} {evatue, delay, datafors} + (sensor, device} Which of the following funetional dependencies will not be preseut in the C F after the application of Union Rule on the final functional dependencies? meal Cover of Marks: 2MICQ a) {eensor, device, status) + {datafora, uprange, losrange} d) sensor -> {delay, status) ©) {evatua, delay, dataform) + (sensor, device) 4) (sensor, device) > (dataform, uprange, lowrange Answer: a) Explanation: We can see that the closure of (sensor, device) still ‘Thus, status is extrancous in the first FD (L-H.S). No other attribute can be removed from any other FD after removing status, Thus, {sensor, device, status} — {dataform, ‘upranga, lowrange) will not be present in the Canonical cover of F. Hence, option (a) is neludes atatueQuestion 6 In a relation Weather (Country, City, Dayle, Tinelir, ProbRain, ProbWind, ProbTemp) [country Csty, Dayllo} uniquely identifies the (ProbRain, ProbWind, ProbTeap). Tamelir is identified by Dayo. Country is determined by {ProbRain, ProbTemp}, What are the non- prime attributes of Weather? Marks: 2MCQ 8) Both City & Dayo ) Both Countey & ProbTenp ©) Both Probiind & Timer 4) Both ProbRain & Probisnd Answer: ¢) Explanation: According to the problem, the following FDs bold {Country, City, Daylio} + {ProbRain, ProbWind, ProbTeap} Daylfo > Tinelir {Probaain, ProbTesp) + Country ‘The candidate keys are (City, Daylio, Country} and (City, Dayllo, ProbRain, ProbTesp} Hence, option (c) is correct.6 Question 7 In a selation Weather (Country, City, DayWo, Timelir, ProbRain, Problind, ProbTesp) (Country, City, Daylio} uniquely identifies the (ProbRain, ProbWind, ProbTeap). Timelir is identified by Dayle. Country is determined by {ProbRain, ProbTemp}. If Veather has 1o ‘be normalized to 2NF. which of the attributes will be present in both the decompositions of Weather? Marks: 2 MCQ 8) Country by) Time 6) ProbRain 4) Daytio Answer: d) Explanation: The FD that causes the violation of 2NF is DayNo > Timelir, Hence, one of the decompositions should be Weather (Dayo, Tinelir). For the decompesitions to be lossless, the common attribute should be a superkey in atleast one of the decompositions. In Weather DayWo, Timelir), the FD Daytio —> Tinelir holds and Daytio is the candidate key. Hence, the other decomposed relation should be Weather2(Country, City, Dayle, ProbRain, ProbWind, ProbTemp). Thus, option (¢) is correctQuestion 8 Consider the following relation VehService (Vehicle, Golor, Capacity, Wheels, Owner) ‘with the following fuetional dependency sets: {Vehicle, Color} + Capacity eels + {Venicle, Capacity, Owner) FDI: Vehicle -+ [Color, Capacity} ¥D2: Wheele + (Vehicle, Gener) ‘Which of the following statements is true? Maris: 2 MCQ 1) Neither $1 covers $2 nor $2 covers Si 1) $2 covers $1 but $1 does not cover $2 ©) 81 covers $2 butt $2 does not cover $1 4) Both 81 covers $2 and 82 covers St ‘The FD Vehicle + (Color, Capacity) of $2 cammot be derived from $2 fas (Vehicle) * dots not contain {Color, Capacity} in $1. All FDs of 81 can be derived from $2. Hence, option ()) is correctQuestion 9 Consider the relation PollutionControl (PolType, Cause, Severity, Effect, Measure, TargetZone) with the following functional dependencies: FDI: PolType + Cause ¥D2: Severity + Effect ¥D3: {PolType, Measure) + TargetZone ¥D4; {Cause, Effect} + {Neasure, Severity} ‘Which of the following options is true? 8) PoLtutionControt has 1 candidate key and is in INF. }) PoLlutionControl has 2 candidate keys and isin INP. ©) PoliutsonControl has I candidate key and isin 2NP. 4) PoLlutionControl has 2 candidate keys and isin 2NF. Answer: b) -e partial dependeney occurs in FDA, itis in INF. Hence, option (b) is correct Question 10 Marks: 2 MCQ ‘The candidate keys of PollutionControl are {PolType, Severity} & {PolType,PollutionControl (PolType, Cause, Severity, Effect, Measure, TargetZone) with the following functional dependencies: FOL: PolTypa + Cause FD2; Saverity + Effact F038; {PolType, Measure) + TargetZone ¥o4: (Cause, Effect} + (Neasure, Severity} ‘The relation is decompased into the following PollutionControlt (PolType, Cause, Severity, Effect) PollutionControl2 (PolType, Severity, Measure, TargetZone) Which of the following is true about the decomposition? Marks: 2 MCQ 2) Both loses and dependency preserving 1) Neither lastess nor dependency preserving 6) Lossless but nat dependency preserving 4) Lossy but dependeney preserving. Answer: ©) Explanation: The union of attributes of PollutionControlt and PollutionControl2 encompass all the attributes of PollutionCoxtrel. The common attribute between the to dlecomposed relations are PolType, Severity which isthe key in PollutienControl1. Hence, the decomposition is lossless. Frot PollutionControl i, FDL and FD2 can he derived. FDS can be derived frou PollutionControl2. However, FD4 cannot be derived from these decompositions, thus making them violate the de- pendency preserving criteria. Hence, option (c) is correct 10 Database Management System: Assignment 5 Total Maks: 20June 27, 2022 Question 1 Which of the following specifies how an application server communicates with the external web? ‘Marks: 2 MCQ a) HTP by sMerP 6) Web browser a) car Answer: «) Explanation: Common Gateway Interface is a standard interface between the web and ap- pli (Refer to Lecture-21), So, option (4) is correct. Question 2 ently the incorrect statements) from the following? Marks: 2MSQ a) Javascript and AJAX technology are used to design server-side applications. 1) Serviet runs inside application servers 6) 308 connections always stay connected 4) Java Server Page is platform independent Javascript and AJAX technology are used to design client-side applications ‘and JDBC connections stay connected until the elient disconnects,Hence, options a) and c) are the answer. Question 3 What will be the availability of the Redundant Arrays of Independent Disks (RAID) system, if the Mean Time Between Failure (MTBF) is 25 days and the Mean Time To Repair (ATTR) the system is 18 hours? Marks:2 MCQ a) 97.091 ») 96.02% 6) 58.14% 4) 30.25% Answer: a) Explanation: Mean tize between failures is the average time between failures, ‘Mean time between failures (MTBF) = total available tine / number of failures. Mean time to repair is the average time taken to repair the system. ‘Mean time to repair(MTTR)= total vnavailable time /nnmaber of failures Availablity = Total available time /(total available time -+total unavailable time)AUDLEY (0) = TTBS TR ian, AST % = 97.09% Hence, option a) is correct, Question 4 Suppose there is a 256 gigabyte flash storage system, with 4 kilobyte page size. The adelress of each page is stored In the memory as an array called a fash translation table. If the size of ‘the flash translation table is 512 megabytes, what is the maximum address size of a page? Marks: 2MCQ 2) 8 bytes b) 10 bytes 6) 82 bytes 4) 64 bytes No. of flash pages Suppose, ench address requires p byes ‘Therefore, the lash translation table would be = p x 64 x 10 So, p = isthe = 8 bytes 256 gigabyte _ 256 x 10 Apatiesyte = axaQuestion 5 enti the correct statemes (s) about the following RAID levels? Marks: 2 MSQ 48) RAID 0 provides byte-level striping with mirvoring 1) RAID 4 provides disk mizvoring without steiping. «) RAID 8 provides hyte-level striping with dedicated parity checking 4) RAID 5 provides Byte-level striping without paeity bits Answer: b), 6) Explanation: RAID 0 provides block-level striping without parity or mirroring and RAID S provides block-level striping with distributed parity. Therefore, these two statements are given in options a) and d) are incorrect. Hence, options b) and ¢) are the answers.Question 6 Suppose, there is @ 512 gigabyte magnetic disk with 256 sufaces and 1024 tracks per surface It has 512 sectors in each track, what will be the size of one sector? Marks: 2MCQ a) 512 bytes >) LKB 9) 2B 4) 4KB Answer: d) Explanation: Capacity of a magnetic disk per surface x Number of sectors per track x Number of bytes per sector So, the size of a sector Capacity of a magnetic disk ‘Total munber of surfaces x Number of tracks or bytes 2 pyces So, the number of bytes per sector 2! bytes6 Question 7 ‘Which of the following layer is wot present in a typical 3-tier Mobile Application architecture? Marks: 2MCQ 8) Application layer ) Presentation layer ©) Business layer 4) Data layer A typical 3-tier Mobile Application Architecture consist: Presentation layer Business layer Data layer Hence, opt ma) is the answerQuestion 8 Consider a database management system that organizes its records ofa file in sequential order and one block contains only whole records. A file containing faculty records has 824 records ‘and each record is 40 bytes long. Ifthe disk block size is I kilobyte, and the block pointer size is 8 bytes, how many blocks will be required to store the faculty file? Marks: 2 MEQ a) vp 32 ©) 8 aa Answer: ¢) Explanation: One block can store only whole recor So, one block can store n mmimbers of whole recoeds and one black pointer. One record size = 40 bytes Disk block Sze = 1024 bytes Disk block pointer = 8 bytes Actual storage size of one block = (1024 - 8) = 1016 bytes n= 12/40 = 25.8 ~ 25 So, maximum of 25 records can he stored in a block ‘There are 824 records in the fle, hence the required number of blocks = 824 / 25 = 38Question 9 In aDrawing Competition, participants individually cau euzoll tele names for the competi- ton. There ate many groups in te competition depending on the age of the particépants, A participant can participate in only one group and a group consists of multiple participants. Each group has a unique name (GName) and a participant also has a unique id. The result, (score) of each group is maintained separately. Which of the following statement(s) are incor- rect? Marks: 2MSQ. 1) Entity Group does not have any primary key ) Participate is a one-to-many relationship between Group and Participants, ©) Participate isa many-to-many relationship between Group and Participant. 4) GNane may be the foreign key of Participate relation between Group and Participant. Answer: a), ©) Explanation: If we draw the ER diagram of it, we can see there will be 0 relationship between Group and Participant. Gname isthe primary key of the entity Group table, Hence, can be te foreign key of Participate relation between Group auc Partiespant. Comme > [sou LL — — \—») Answer: d) Explanation: In 2-3-4 tree insertion, we start from root and traverse till the leaf node where: key is to be inserted. While traversing, if we find! a node whieh is full, we split it. When we insert 6, we find root itself is full, so we split it. When we come cdowin to leftmost leaf, we find ‘that the leaf is also full, so we split the leaf also. Refer Module 27 slide 926, Question 6 Identify the correct B-tree of order 3, generated by inserting 27, 11 and 77 Marks: 2MCQ a) ») ° @)Answer: ¢) Explanation: In a B*-tree of order 3, every non-toot node ean have maximum of 2 keys ‘After insertion of 27, andl LL the teee will be: =» After insertion of 77, the node will spit and the new tree willbe: ZZ sD 6 Question 7 In an open hashing system, collision is resolved using linear probing. In the given system, the hash table is of size eight starting with index zero, The hash fnetion is:(Sx + 2) mod 7 where x is the value of the kay. Assuming that the lash table is intially empty, whieh of the following depicts the contents of the hash table when sequence 10, 23, 87, 41, 45, 53 is Inserted into the table? Marks: 2MCQ = 53, 10, 45, 41 10,41, 45 6) 58,28, 97, 10, 45, 41,. 4) ., 58, 23, 37, 10, 45, AL. In open hashing, the set of buekots is fixed, and there are no overflow chains. Ifa bucket is full, the system inserts records in some other bueket in the initial set of buekets ‘One poliey is to use the next bucket (ia eyelie order) that has space: this policy is ealled linear probing. (942) mod 7 = 10, (3x42) mod 7 23,4 10, (8x+2) mod 7 =1 when x=87 + collision ocens at index position 1. As next available index: position is 2, hence it will be occupied = 28,37, 10, (8x+2) mod 7 =4 when x= + collision ocenrs at index position 4. As next available index: position is 5, hence i will be occupied 237, 10, 45,(3x+2) mod 7 =0 when x 3.28, 37, 10,45, 41, - Question 8 Consider the table Flover: FID [WANE] SESH si | Rose | Summer 149 | Jaaaine | Rainy 262 Lotus | Fata 286 | Daliya | Winter 265 | Orchid | Summer 360 | anya | Winter ‘378 [Lily | Rainy Consider the bitmap index for the SEASON field, with $1, $2, $3, and $4 representing different SEASON, Select the cortect option for which the bitmap index value of SL, $2 will be as follows: Marks: 2 MCQ PEP PTepPy] Toy TtToq ry 4) Summer and Winter >) Summer and Aut ©) Rainy and Winter 4) Rainy and Autumn Answer: ©) Explanation: if we put true (1) and false (0) for the given valle of the SEASON Field we get for Rainy 1, and Winter $2 So, option (c) is correct.Question 9 If the inclex entries are inserted in sorted order into a BF tree, choose the correct option(s) {rom the following statements, Marks: 2 MCQ a) The new entries get directed to last leaf node ifthe index entries are inserted in ascending order. 1b) When last leaf node gets filed, it ill split into three, ©) IF the leaf node splits when inserting in ascending order, the right node is left untouched and the insertions take place on the parent node, 4) Except for the frst and last leaf, the occupancy of nodes is about 100 percent if insertion happens in descending order. Answer: a) Explanation: If the indes entries are inserted in ascending order, the new entries get dic rected to the last leaf node, When this leaf node gets filled, it is split into two. ‘This makes the oceupaney of the leaf nodes about 50 percent, except for the last leaf IT Keys that are inserted are sorted in descending order, the above situation would still occur Dut symmetrically, with the right node of a split never getting touched again, and occupancy ‘would again be 50 pereent for all nodes other than the first leat Hence, ouly option a) is correct,Question 10 How many maximum numbers of keys, a B-tree of order 4 ean store? The height of the tree Js 5 and the root node is assumed to be in height zero Marks: 2MCQ 9) 8101 ») 4095 ©) 2047 a) es Answer: b) Explanation: A B-tree of order # and height b will have the maximmm number of keys when all nodes are completely filled. of order 4 can store 3 keys. of order 4 can have d children, So, can have dx} + 3 keys Similarly, maxinmun munber of keys ina Betree of height = (m1) keys Here, m=4 and h=5. Hence, maximum keys = (41-1) So, 4° — 1 = 4006 - 1 = 4095 ) is correct. 10Database ManagementSystem: Assignment7 Toa Masks 100 September 26, 2022 Question 1 Consider the following schedule $ involving five transnetions Ty, To, Tj, Ta ane Ts Marks: 2 MCQ ROY Eiee} B® WOR) RO Wa a} R(X) denotes read operation on data item X by transaction T) W(X) denotes write operation on data item X by transaction Ts ‘Choose the correct option for the above transaction schedule 8) The schedule is only view serializable schedule ) The schedule is only conflict serializable schedule. ©) The schedute is both view and conflict serializable schedule 4) The schedule is neither conflict serializable nor view serializable schedule. Answer: ©) Explanation: If we daw the precedence graph of the transactions as show in Ue fole Towing, we can observe that the graph has no eye, So, the above schedule is a conflict serializable schedule. All conflict serializable schedules are view cerializable too, I So, option (¢) is correctQuestion Z Consider the following schedule § involving five transactions T), Tp, Ty Ty and Ty Marks: 2MCQ RLPpTRpn ps RO RO) WO RY WY ¥@ WEY R(X) denotes read operation on data item X by transaction T. W(X) denotes write operation on data item X by transaction 7; entify the correct option(s) that represent the order of execution of all transactions of the above echedule &. a) TISTISTISTIGTS b) TITS 37173472 9 MSTIS15 412473 4) TOTS STIST24T3 1 If we draw the precedence graph of the transactions as shown in the fol- lowing, we can observe that the graph has no eyele. So, the above schedule is a conflict serializable echedule. ‘All conflict serializable schedules are view serializable too, All possible topological orderings of the above precedence graph will be the possible conflict serializable echedule, Hence, the correct order of execution of all transactions is: (T4+T5+T1 +7293) So, option (4) is eorreet Question 3 Consider the following schedule § involving four transactions 7), Tp, Ty and Ty, Marks: 2MCQR(@) wey R(X) denotes read operation on data item X by transaction T;. W(¥) denotes write operation on data item ¥ by transaction T; enti the possible number of conflict serializable schedules of the above schedule 5, a) v2 I we draw the precedence graph of the echedule, we can observe that the graph has no eyele. Hence, the above schedule is conflict serializable schedules, All possible topological orderings of the ahove precedence graph will be the possible conflict serializable echedule, LT T2571 Ts 2113 T4124 T3 3 MST13 12473 Hence, option e) is correct. Question 4 Suppose in a database, there are four transactions Ti, Ta, Ty and Tj, Transaction T; is ‘waiting for trangactione T; and Tj, traneaction T) is waiting lor transaction Ts, and ‘transaction T; is waiting for transactions Tz and T; to relense a data item, enti the correct ¥ait=for graph for the above scenario. Marks: 2MCQa) Vy » & \y 9 &) ® “ 1S) ¢ When T; requests a data item currently being held by Tj, then the edge T; + werted in the wait~for graph, T; + 7), implying that T; waiting for T; to release a data item, Hence, option d) is correct. Question 5 Consider the following echedule § of transactions 7; and Ts, Mavis: 2MICQ ‘The read operation on data item A is denoted by read(A) and the write operation on data item & is denoted by write Ce). Ty Tt ead) i=A-200 write) read(@) Toup:=Cs0-7 Ci=C-temp readB) Bi=B+200 write) write) read(D)— Which of the following is TRUE about the schedule 8? f) $ is serializable only as Ti, Ts ) Sis serializable only as Te, Ti. 6) S$ is not serializable either as Ty, Ta ot Tp, Th. 4) S is serializable both as Ty, Tz and Te, Th. Answer: d) Explanation: First, swap all non-conflicting instruction of the above schedule 8, Here, 7; and Ty both are working on different data items. So, $ is serializable both as Ty, T: and Ts, T, Hence, option (d) is correct, Question 6 Mentfy the incorrect statement(s) about the lock compatibility matrix given below, where S deuotes a ehared mode Lock and X denotes an exclusive mode lock, Marks:2 MCQ =| % S| True | False 1 Falee | Fale a) Ifa transaction holds a $ Lock on a data item, other transactions will not be allowed to obtain a X Lock on the same data item. }) Ifa transaction holds a $ Lock on a data item, other transactions willbe allowed to obtain 8 lock on the same data item, ©) Ta transaction holds an X lock on a data item, other transactions are not allowed to obiain a X Lock on the same data item. 4) If transaction holds an X lock on an item, other transactions may be allowed to obtain. 8 lock on the same data item. Answer: d) Explanation: As per lock based protocols. Refer Module $4 slide 10,6 Question 7 Suppose in a database, there are four transactions Ty, Tp, T; and T; with timestamp 10, 20, 30 and 40 respectively. T; is holding some data items which Tj, T> and T, are reqnesting to acquire, Which of the following statement(s) is (are) correct in respect of Wait-Die Deadlock Prevention sclieme? Marks: 2MSQ a) Transaction T; and T; will wait for 7, to release the data item. ) Transaction 7; and Ty will wait for Ts to release the data item. ©) Transaction T; and T, will wait for Ty to release the data item, 4) Transaction 7; will rollback. Answer: b), d) Explanation: In Yait-Die Deadlock Prevention schesne: Oder transaction may vait for younger one to release data item, (older means smaller timestamp) Younger transactions never wait for older oues; they se rolled back instead. ‘Transactions T, and are older and 7, is younger to Transaction Ty Hence, options b) and d) are correct.Question 8 Consider two transactions given below where Tock-X (A) denotes T; has obtained an Exelusive-aode Jock on data item A and Lock-$(A) denotes T, has obtained a Shared-node lock on data item ‘A. read(A) denotes read operation on data item A by the transaction T;. weiteCa) denotes write operation on data item A by the transaction 7), Marks: MCQ 7; TSO] reek Teeek@y| | ted) Feat area] [isloer@y “comit | [ratoek@ay Which of the following statement(s) is/are true? a) Both T; and T follow the strict two-phase Locking protocol, }) Both 7) and Ts do not follow the strict two-phase locking protocol, ©) T; follows the 2-phase locking protocol only but Tz follows the strict two-phase locking protocol. 4) 7; follows the strict two-phase locking protocol only but 7; follows the rigorous ‘evorphage Locking protocel. Answer: ©) Explanation: Transaction 7; unlocks one Exelusive-mede lock before commit. That is ‘why, it does not follow the etrict two phage locking protecol as well as the rigorous two-phase locking protocol. It is following two-phaee Locking protocol only. The frst Js the growing phase in which itis acquiting locks, the second is one in which itis releasing locks, [But transaction 7) unlocks the Shared-node Lock before commit and unlocks the Exelussve-mode Lock alter commit, That is why, it follows the strict two phase locking protocol but not the rigorous two-phase locking protocol.Hence, option (¢) is correct. 8 Question 9 Consider two schedules S; and Sp as fllows Marks: 2 MCQ Sr ] Ss Tr Th] Ti 7 Tec KO | Pease Fea Feed write) Tock S08) rr) read ead(6) walock®) wite@®| | umlock() Tock-5(A | Toa KO ead(a) | ead(a) Tee) 1 write (i) raad(B) | Tock XE) walock @) ead) walock() write (®) wale unlock A) aloe) unlock(3) ‘Mentify the correct statement fom the following which relates to whether the schedules are deadlock free. Please note that if any schedule sulle from deadlock, some operations of ‘the transactions in that sehednle may’ not he executed, ) Both $1 and Swill suffer from deadlock D) 5; will suffer fom deadlock, $, will not suffer from deadlock. ©) S; will not sulfer from deadlock, S> will sufer from deadlock, 4) Neither $; nor will suller from deadlock, Answer: b) Explanation: In Sj, Tj is holding exclusive sode lock on (A) and Tp has requested shared node lock on (A). While oue transaction is holding exeluaive mode Lock on a par- ticular database, no other transaction ean acquire any shared mode lock on (A) unless the lock is released hy the former transaction (which is holding exclusive mode lock on the data item). Similarly, T; is holding exclusive lock on (B) and T; has requested shared mode lock on @).tions and will not release the exclusive mode lock on (B). ‘This, in turn, restricts transaction Tp to acquire shared mode lock on (A). Similarly, transaction T; cannot acquize shared mode lock on (B). ‘Thus, both T; and Ts are waiting for each other to release resources, Hence, Si is going to suffer from a deadlock, In 2, Ti has acquired shared mode Lock on (A) and (B) and T; released locks on data items A and B, Then, Ts wants to acquire exclusive mode lock on (A) and (B) and granted to Ts and no deadlock occurs in $2. Hence, option (b) is correct 9 Question 10 Consider the following two schedules St and $2. Marks: 2MSQ 3 3 Th es HOD ROY we wor OD CORR ve RW omar Wa AO, ORR R(X) denotes read operation on data item X by Transeetion T; W(X) denotes write operation on data item X by Transaction T: Which of the following statement(s) is/are true for the above two schedules SI and $2? a) Both scheslules $1 and S2 are Recoverable Schedule, }b) Both schedules S1 and $2 are Cascadeless Schedule, ©) The schedule $1 isnot a Recoverable Schedule but the schesiule S2 is Cascadeless Schedule, ) The schedule SI is not a Recoverable Schedule but the schedule $2 is Recoverable Schedule, Answer: ©), d) Explanation: Racoverable Schedule: If transaction 7; roads a data item previously write ten by a transaction T; the commit operation of T; must appear before the commit operation of I). Cascadeless schedules: For each pair of transactions Z; aud 7; such that Z) reads a data item previously written by T;, the commit operation of T; appears before the read operation of I) In SI, Zs reads the data item X which was previously written by Ti: 7 committed immedi- ately after the rend(X) and write(X) operations . Hence, the schedule is non recoverable schedule, In $2, 7 reads the data item X which was previonsly written by 7)" 7; commited before read X operation by Ts. Hence, the schedule is only recoverable schedule as well as Caacadele: schedule, Hence, options (e) and (dl) are correct10 Database Management System: Assignment 8 ‘Total Maris +100 October 3, 2022 Question | Assume an immediate database modifiation scheme, Consider the following log records for ‘transactions TO, TI, T2, T3 and TH ‘Marks: 2MSQ ‘steps | Details of Tog 7 (70, start) 2 (Ti start) S_|_1H, x, 100, 200) a (Fi, commit] S| Teheckpoine (To) ) e 7 @ 70,¥,200, 400) TZ, start) (70, commit) z Te stare) 70 (74, start) 41 _|(9,2,400 ,600) T2_| (74, W, 600, 1200) FE} (74, commit} If there is a crash jnst after step 13 and the recovery of the identily the correct actions for the above seenario. ystem is successfully completed, a) After recovery completion, value of X will be 100 D) After recovery completion, value of ¥ will be 400. ©) After recovery completion, value of Z will be 600, 4) Aer recovery completion, value of W will be 1200, Answer: b). d) Explanation: In the immediate database modification scheme, during recovery alter a crash, a transaction needs to be redone if and only if both (T,, start), (,, commit) are present in the log, Otherwise, undo is required ‘Any transactions that are committed belore the last checkpoint should be ignored(updates alrendy outpnt to disk due to the checkpoint). Redo list contains transactions {T0, T4} and undo list contains transactions {T2, TS} and for transaction {TI} no action is needed hecause itis already committed before checkpoint. After recovery completion, for TO the value of Y will be 400, for TS the value of Z will be 400 and for TA the value of W will be will he 1200, Hence, options (b} and (A) are correct.Question2 enti the cost estimation of a query evaluation plan, if 2000 blocks are required to be ‘transferred from disk and the required number of @isk seeks are 50. ‘© Time to transfer one block: tr = 4 milliseconds © Time for os A seconds seek fy Marks:2 MEQ 8) 4 Seconds 1) 8 Seconas 6) 10 Seconds 20(4 2: (rante='2022-06-12" (Tage>20(Patients * Appointaents))) 3 TTapane(Manaae ¢_onaia Doctors » Appointaenta)) QU: Thaname, d.enai(Doctors x Appointments) ‘Mentify the correct options from the optious given below. 8) QL is equivalent to Q2, 1) Ql is not equivalent to Q2 ©) Q3 is equivalent to Qu. 4) QB is not equivalent to Qi. Answer: a), d) Explanation: QI and Q2 will give the same result beease according to transformation rrules, selection operations are commutative, QB and Q4 will not give the same result because according to transformation rules, only the last in a sequence of projection operations is needed, the others can be omitted. Hence, options a) and d) are correct.Question 9 Consider the following relational sehen: Marks: 2MICQ Patienta(pid, pase, age, p.enail) Doctors(did, daane, qualification. d.esail) Appointaenta(pid, did, date, tine) Consider the following query of the above relation: Select Patients.pnane, Doctore.daane From Patients, Doctors, Appointments Where Patients.pid-Appointments.pid and Doctors.did-Appointments.did and Pationts.age60; [Hentify the most optimizes relational algebra for the above query using heuristic based query optimization technique. 4) Mipatients.puane Doctors .dnase (opatients.pid-Appointuents .pid Doctors. dic (Patients (Doctors » Appointments))) pointnente.did-Patiente.age=S0 v) Tpacsenta.pnane Doctors .anane((Mpoctors.dia,Doctors.dnane Doctors) x (lppotneaeats Coparients.ages50 patients .pid,Pationts.pnane,Patients.age(Patients))))) Mpationts. pane Doctors. dnane (Mdoctors.dnane\Dasws)) ¥ (Appointnents Copatients agen80 Mipatients pid, Patients, paane, Patients. age(Patients))))) 4) Mpatitents.pnane Doctors. dnane (Patients age-50 (Patienta x (Doctors x Appointuents))) Answer: b) Explanation: Performing selection and projection as eatly as possible reduces the size of the relations that are to be Joined later. So, i is better to perform projection with required attribute and then perform selection, Hence, option b) is correct.10 Question 10 Consider the Relational Algebra expression given below: P my (GPR) where P, g, and R are relational algebra expressions. Mentify the correct equivalent relational algebra expression of the above relational algebra expression. ‘Marks:2 MCQ a) P me (me R) 1) (Poe Q)(P m9 R) ©) (@ 0) =) 4) (P me 8) — xo) Answer: b) Explanation: As per the equivalence rules of Relational Algebra expressions.