Quiz Space

Database Management Systems · End Term · 11 Dec 2022 · September 2022 term

Question 15: Consider the following schedule S as given below: S : R2…

Question 15

+2 marksOne correct option

Consider the following schedule S as given below: S : R2(A), W2(A),W1(B),W2(C),W3(A),W1(A) According to the timestamp protocol, if the timestamps for transactions T1,T2, and T3 are 7, 2, and 12 respectively, then choose the correct option.

  1. A

    No transaction needs Roll Back.

  2. B

    Transaction T3 needs to Roll Back.

  3. C

    Transaction T2 needs to Roll Back.

  4. D

    Transaction T1 needs to Roll Back.

Show answer

Correct answer

  • D

    Transaction T1 needs to Roll Back.

Question 15 of 28 in the IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 11 Dec 2022, in the September 2022 term (IIT M DIPLOMA FN1 EXAM ETD1 11 Dec 2022). It carries 2 marks.

More questions from this paper

  1. Q1THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL: DATABASE MANAGEMENT SYSTEMS" ARE YOU SURE YOU HAVE TO WRITE EXAM…
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Consider the following entity relationship diagram as shown in figure 1. Consider the following entity relationship dia…
  5. Q5Figure question
  6. Q6The RAID-4 is implemented using four disks. How much space is being utilized effectively? [Note: Each disk has a size o…
  7. Q7What is the full form of RAID?
  8. Q8Figure question
  9. Q9Consider the following schedules: S1:W3(A), R2(A), W2(A), W3(B), W3(C), W1(C) S2:W1(A), W3(A), W3(C), W2(A), W1(B), W3(…
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Consider a Binary Search Tree(BST) consisting of 16 elements. What is the maximum possible height of the given BST?
  13. Q13Consider a relation Books (isbn_no, title, publication). The attribute publication consists of 4 distinct values. A bit…
  14. Q14Figure question
  15. Q16Figure question
  16. Q17Consider a disk with a sector size of 256 bytes, 1500 tracks per surface, 60 sectors per track, and 4 double-sided plat…
  17. Q18Figure question
  18. Q19Figure question
  19. Q20Insert the key values in the following order into an empty 3 order B tree: 44, 23, 89, 56, 24, 60, 99, 10, 78, 5. The r…
  20. Q21Figure question
  21. Q22Figure question
  22. Q23Figure question
  23. Q24Figure question
  24. Q25Figure question
  25. Q26Figure question
  26. Q27Consider a multilevel index, where the outermost index entries must be kept in a single disk block. In each block, 20 e…
  27. Q28Figure question