Home › AKTU PYQ › Database Management System › Predicted Paper

Database Management System (BCS501) AKTU predicted paper 2026-27

AI-predicted paper for Database Management System based on 5 past papers (2021, 2022, 2023, 2025, 2026). NOT an official AKTU paper. Use as a revision tool only.

Paper pattern

  • Section A: Attempt all questions. (14 marks)
  • Section B: Attempt any THREE questions out of five. (21 marks)
  • Section C: Attempt ONE question from each pair (a or b). (35 marks)

Why these questions

  • Unit 4 (Transaction Processing and Distributed DB) dominates — 23% avg weightage
  • Asked every year: Database System Overview, Data Model Schema Instances
  • Low priority (never asked): Distributed Database, Oracle Case Study
  • Most repeated topic: Transaction Processing Concepts

Section A – 2-mark questions

  • Differentiate between physical and logical data independence.
  • Define Relational Algebra.
  • Analyze and find the FDS in the following relation X Y Z 1 4 2 2 5 3 1 4 2 3 2 2
  • Discuss Consistency and Isolation property of a transaction.
  • Define Shared lock.
  • Write a short note on Deadlock Handling.
  • What is Equi-Join in database?

Section B – sample questions

  • What is Relational Algebra? Explain Different Operations of Relational Algebra with Example.
  • What is Aggregate Function in SQL? Write SQL query for different Aggregate Function.
  • 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);