Home › AKTU PYQ › Database Management System › PYQ Questions › Unit 4

Database Management System Unit 4 – Transaction Processing and Distributed DB: AKTU previous year questions

26 AKTU questions from Unit 4 (Transaction Processing and Distributed DB) asked in 2021–2026, tagged by marks, year and topic. In short: about 35 marks of every paper come from this unit; the most asked topic is Transaction Processing Concepts (21 times); 20 questions came back in a later year. The latest ones are listed below; on the page you can filter them by 2-mark or long questions, topic and repeats.

Unit 4 previous year questions

  • What is serializability in transaction processing systems? (2 marks, 2026, Transaction Processing Concepts)
  • Define Transaction. Explain transaction property with detail and suitable example. (7 marks, 2026, Transaction Processing Concepts)
  • Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given below. Draw the serializability (precedence) graphs for S1 and S2 and state whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule(s). T1: r1(X); r1(Z); w1(X); T2: r2(Z); r2(Y); w2(Z); w2(Y); T3: r3(X); r3(Y); w3(Y); S1: r1(X); r2(Z); r1(Z); r3(X); r3(Y); w1(X); w3(Y); r2(Y); w2(Z); w2(Y); S2: r1(X); r2(Z); r3(X); r1(Z); r2(Y); r3(Y); w1(X); w2(Z); w3(Y); w2(Y); (7 marks, 2026, Transaction Processing Concepts)
  • Explain in details about ACID properties of transaction. (7 marks, 2026, Transaction Processing Concepts)
  • Explain properties of Transaction. (2 marks, 2025, Transaction Processing Concepts)
  • Determine different types of failures in case of transactions and how it can be recovered based on log file? Explain with suitable example. (7 marks, 2025, Log Based Recovery Checkpoints)
  • Illustrate Conflict Serializable Schedule. Check the given Schedule S1 is Conflict Serializable or not? Also check is it view Serializable? S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X) (7 marks, 2025, Transaction Processing Concepts)
  • Explain schedule and transaction. Define the concepts of recoverable, cascade less, and strict schedules, and compare them in terms of their recoverability. (7 marks, 2025, Transaction Processing Concepts)
  • Explain deadlock. What are the necessary conditions for it? How it can be detected and recovered? (7 marks, 2025, Deadlock Handling)
  • Discuss Consistency and Isolation property of a transaction. (2 marks, 2023, Transaction Processing Concepts)
  • Draw a state diagram and discuss the typical states that a transaction goes through during execution. (2 marks, 2023, Transaction Processing Concepts)
  • Describe how view serializability is related to conflict serializability. (2 marks, 2023, Transaction Processing Concepts)

Most asked Unit 4 topics

  • Transaction Processing Concepts – asked 21 times
  • Deadlock Handling – asked 3 times
  • Log Based Recovery Checkpoints – asked 2 times

Unit 4 question pattern

  • 2-mark questions: 8 asked in 2021–2026
  • 7-mark questions: 7 asked in 2021–2026
  • 10-mark questions: 11 asked in 2021–2026
  • About 35 marks from Unit 4 in every paper
  • 20 questions were asked again in a later year

Unit 4 questions year by year

  • 2026: 4 Unit 4 questions asked (23 marks across that year's papers)
  • 2025: 5 Unit 4 questions asked (30 marks across that year's papers)
  • 2023: 7 Unit 4 questions asked (46 marks across that year's papers)
  • 2022: 5 Unit 4 questions asked (42 marks across that year's papers)
  • 2021: 5 Unit 4 questions asked (34 marks across that year's papers)