Home › AKTU PYQ › Database Management System › PYQ Questions

Database Management System (BCS501) AKTU previous year questions 2021–2026

Every Database Management System question from 5 AKTU papers, tagged by unit, topic and marks. A few recent questions from each unit are listed below; open the page to filter by unit, topic or mark type.

Unit 1: Introduction and ER Model – AKTU PYQs

  • Explain Logical data Independence. (2 marks, 2026, Data Model Schema Instances)
  • Write Advantages of Database. (2 marks, 2026, Database System Overview)
  • Discuss three level of abstractions or schemas architecture of DBMS. (7 marks, 2026, Database System Overview)
  • Compare Generalization, Specialization and Aggregation with suitable examples. (7 marks, 2026, Entity Relationship Model)
  • Draw an ER diagram of Hospital or Bank with showing the Specialization, Aggregation, Generalization. Also convert it in to relational schemas and SQL DDL. (7 marks, 2026, Entity Relationship Model)

Unit 2: Relational Model and SQL – AKTU PYQs

  • Define Relational Algebra. (2 marks, 2026, Relational Data Model)
  • Define constraint and its types in DBMS. (2 marks, 2026, Relational Data Model)
  • Write difference between Cross Join, Natural Join, left outer join and right outer join with suitable example. (7 marks, 2026, SQL Queries and Operations)
  • Consider the following relational DATABASE. Give an expression in SQL for each following queries Underline records are Primary Key Employee (person_name, street, city) Works (person_name, Company_name, salary) Company (Company_name, city) Manages (person_name, manager_name) a) Finds the names of all employees who works for the ABC bank b) Finds the name of all employees who live in the same city and on the same street as do their managers c) Find the name street address and cities of residence of all employees who work for ABC bank and earn more than 7,000 per annum. d) Find the name of all employee who earn more than every employee of XYZ. e) Give all Employees of corporation ABC a 7% salary raise. f) Delete all tuples in the works relation for employees of ABC. g) Find the name of all employees in this DATABASE who live in the same city as the company for which they work. (7 marks, 2026, SQL Queries and Operations)
  • Discuss the importance of domain constraints and key constraints in maintaining database consistency. Also explain Entity Integrity and Referential Integrity constraints with suitable examples. (7 marks, 2026, Relational Data Model)

Unit 3: Database Design and Normalization – AKTU PYQs

  • Define 3 NF. (2 marks, 2026, Normal Forms)
  • Consider R = (A, B, C, D, E, F, G, H) and F= { AB→ C, BC→ D, E → F, G → F, H → A, FG → H } Is the decomposition of R into R1(A, B, C, D), R2(A, B, C, E, F), R3(A, D, F, G, H) lossless? Is it dependency preserving? (7 marks, 2026, Lossless Join Decomposition)
  • Short Notes of the Following- i) MVD or JD ii) Normalization with advantages (7 marks, 2026, Normalization Using FD MVD JD)
  • Consider the universal relational schema R (A, B, C, D, E, F, G, H, I, J) and a set of following functional dependencies. F ={AB→C, A→DE, B→F, F →GH, D→IJ} Determine the keys for R? Decompose R into 2nd Normal Form. (7 marks, 2026, Normal Forms)
  • Analyze and find the FDS in the following relation X Y Z 1 4 2 2 5 3 1 4 2 3 2 2 (2 marks, 2025, Functional Dependencies)

Unit 4: Transaction Processing and Distributed DB – AKTU PYQs

  • 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)

Unit 5: Concurrency Control Techniques – AKTU PYQs

  • Define Shared lock. (2 marks, 2026, Locking Techniques Concurrency)
  • Explain the Validation Based protocol for concurrency control. (7 marks, 2026, Validation Based Protocol)
  • Discuss the complexities of recovery with concurrent transactions. Also explain the importance of the checkpoints mechanism in reducing the time required for recovery after a system crash. (7 marks, 2026, Recovery with Concurrent Transactions)
  • Describe major problems associated with concurrent processing with examples. What is the role of locks in avoiding these Problems. (7 marks, 2026, Locking Techniques Concurrency)
  • Define multiple granuality. (2 marks, 2025, Multiple Granularity Multi Version)