AKTU Database Management System · Important Questions 2026Source: ryzenstudy.com PYQs
BCS501 Database Management System Important Questions 2026 (AKTU)
Repeat analysis + most-asked questions, unit-wise
What we did: built from all 5 AKTU Database Management System papers (2021-22–2025-26): 127 questions grouped into 57 distinct questions, 32 of which were asked in more than one paper.
- of marks were repeat questions
- 74%
- of marks were repeat questions
- questions asked in 2+ papers
- 32
- questions asked in 2+ papers
- papers analysed (2021-22–2025-26)
- 5
- papers analysed (2021-22–2025-26)
- units, mapped to current syllabus
- 5
- units, mapped to current syllabus
How much of the paper repeats?
- Repeats are real: when we checked each newer BCS501 paper against the papers before it, on average 74% of its marks were questions already asked in an earlier paper.
- 2023-24 paper: 57% of marks were repeats (9 of 14 repeated questions were in our top list).
- 2024-25 paper: 80% of marks were repeats (9 of 20 repeated questions were in our top list).
- 2025-26 paper: 86% of marks were repeats (13 of 23 repeated questions were in our top list).
- Topic weightage is a guide, not a guarantee: our Tier 1 + Tier 2 topics covered 64% of the next paper's marks — picking the same number of topics at random would have covered about 61%.
Across 10 subjects and 23 papers we tested, 43% of marks repeated earlier questions on average.
1.Unit-wise most-asked questions
Ranked by how many papers asked them, then by how recently. Click a paper to open it.
Unit 1: Introduction
22% of past marks| Question | Asked |
|---|---|
| Explain Logical data Independence... | Asked 4× |
| Draw an ER diagram of Hospital or Bank showing the Specialization, Aggregation, Generalization. Also convert it into relational schemas and SQL DDL | Asked 3× |
| Discuss three level of abstractions or schemas architecture of DBMS | Asked 3× |
| Write Advantages of Database | Asked 2× |
Unit 2: Relational data Model and Language · Introduction on SQL
24% of past marks| Question | Asked |
|---|---|
| Write difference between Cross Join, Natural Join, left outer join and right outer join with suitable example | Asked 5× |
| Discuss the importance of domain constraints and key constraints in maintaining database consistency. Also explain Entity Integrity and Referential Integrity constraints with suitable examples | Asked 3× |
| Define triggers and its types | Asked 3× |
| Find the name of all employees in this DATABASE who live in the same city as the company for which they work | Asked 2× |
Unit 3: Data Base Design & Normalization
19% of past marks| Question | Asked |
|---|---|
| Short Notes of the Following: i) MVD or JD ii) Normalization with advantages | Asked 4× |
| Consider the universal relational schema R (A, B, C, D, E, F, G, H, I, J) and the 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 | Asked 3× |
| 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? | Asked 3× |
| List all prime and non-prime attributes in Relation R(A,B,C,D,E) with FD set F = {AB→C, B→E, C→D} | Asked 2× |
Unit 4: Transaction Processing Concept · Distributed Database
23% of past marks| Question | Asked |
|---|---|
| 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) | Asked 5× |
| Explain in details about ACID properties of transaction. | Asked 4× |
| Explain deadlock. What are the necessary conditions for it? How it can be detected and recovered? | Asked 3× |
| Determine different types of failures in case of transactions and how it can be recovered based on log file? Explain with suitable example | Asked 3× |
Unit 5: Concurrency Control Techniques
12% of past marks| Question | Asked |
|---|---|
| Explain the Validation Based protocol for concurrency control | Asked 2× |
| Explore the following (i) Multi version protocol (ii) Validation based protocol | Asked 2× |
| Define multiple granularity | Asked 2× |
| Discuss Concurrency control. Why it is needed in DBMS? Also explain timestamp based ordering in Concurrency control | Asked 2× |
2.Topic weightage: which topics carry the marks
Blue = Tier 1 + Tier 2 (topics that carried ~80% of past marks). Grey = the rest. It shows where marks have gone, not a promise of what comes next.
SQL queries and aggregates · U2
10.4% (cum 10%)
Serializability · U4
7.1% (cum 18%)
Normal forms · U3
5.7% (cum 23%)
Schemas and data independence · U1
5.4% (cum 29%)
ER diagram to tables · U1
5.3% (cum 34%)
Transactions and ACID · U4
4.8% (cum 39%)
MVD, JD, 4NF and 5NF · U3
4.1% (cum 43%)
Validation and multiversion · U5
3.9% (cum 47%)
Data models and languages · U1
3.9% (cum 51%)
Joins and set operations · U2
3.9% (cum 54%)
Functional dependencies and closure · U3
3.6% (cum 58%)
Recoverable schedules · U4
3.3% (cum 61%)
Deadlock handling · U4
3.2% (cum 65%)
Minimal cover and keys · U3
3% (cum 68%)
DBMS architecture and DBA · U1
2.9% (cum 71%)
ER model concepts and keys · U1
2.9% (cum 73%)
Relational algebra · U2
2.8% (cum 76%)
Triggers and PL/SQL · U2
2.6% (cum 79%)
Relational model and integrity · U2
2.6% (cum 81%)
Log-based recovery · U4
2.5% (cum 84%)
Distributed database · U4
2.4% (cum 86%)
Lossless decomposition · U3
2.4% (cum 89%)
Timestamp protocols · U5
2.2% (cum 91%)
Locking techniques · U5
2% (cum 93%)
Concurrency control basics · U5
1.7% (cum 95%)
SQL commands and clauses · U2
1.4% (cum 96%)
Multiple granularity · U5
1% (cum 97%)
DBMS vs file system · U1
0.8% (cum 98%)
Generalization and aggregation · U1
0.8% (cum 99%)
Recovery with concurrency · U5
0.8% (cum 99%)
Relational calculus · U2
0.4% (cum 100%)
| Topic | Papers | Share |
|---|---|---|
| SQL queries and aggregates · Unit 2 · Tier 1 | 5/5 | 10.4% |
| Serializability · Unit 4 · Tier 1 | 5/5 | 7.1% |
| Normal forms · Unit 3 · Tier 1 | 5/5 | 5.7% |
| Schemas and data independence · Unit 1 · Tier 1 | 5/5 | 5.4% |
| ER diagram to tables · Unit 1 · Tier 1 | 3/5 | 5.3% |
| Transactions and ACID · Unit 4 · Tier 1 | 4/5 | 4.8% |
| MVD, JD, 4NF and 5NF · Unit 3 · Tier 1 | 4/5 | 4.1% |
| Validation and multiversion · Unit 5 · Tier 1 | 4/5 | 3.9% |
| Data models and languages · Unit 1 · Tier 1 | 3/5 | 3.9% |
| Joins and set operations · Unit 2 · Tier 2 | 5/5 | 3.9% |
| Functional dependencies and closure · Unit 3 · Tier 2 | 4/5 | 3.6% |
| Recoverable schedules · Unit 4 · Tier 2 | 2/5 | 3.3% |
| Deadlock handling · Unit 4 · Tier 2 | 3/5 | 3.2% |
| Minimal cover and keys · Unit 3 · Tier 2 | 2/5 | 3% |
| DBMS architecture and DBA · Unit 1 · Tier 2 | 3/5 | 2.9% |
| ER model concepts and keys · Unit 1 · Tier 2 | 3/5 | 2.9% |
| Relational algebra · Unit 2 · Tier 2 | 3/5 | 2.8% |
| Triggers and PL/SQL · Unit 2 · Tier 2 | 3/5 | 2.6% |
| Relational model and integrity · Unit 2 · Tier 2 | 3/5 | 2.6% |
| Log-based recovery · Unit 4 · Tier 3 | 3/5 | 2.5% |
| Distributed database · Unit 4 · Tier 3 | 2/5 | 2.4% |
| Lossless decomposition · Unit 3 · Tier 3 | 3/5 | 2.4% |
| Timestamp protocols · Unit 5 · Tier 3 | 2/5 | 2.2% |
| Locking techniques · Unit 5 · Tier 3 | 2/5 | 2% |
| Concurrency control basics · Unit 5 · Tier 3 | 3/5 | 1.7% |
| SQL commands and clauses · Unit 2 · Tier 3 | 3/5 | 1.4% |
| Multiple granularity · Unit 5 · Tier 3 | 2/5 | 1% |
| DBMS vs file system · Unit 1 · Tier 3 | 2/5 | 0.8% |
| Generalization and aggregation · Unit 1 · Tier 3 | 1/5 | 0.8% |
| Recovery with concurrency · Unit 5 · Tier 3 | 1/5 | 0.8% |
| Relational calculus · Unit 2 · Tier 3 | 1/5 | 0.4% |
3.Paper pattern (2025-26)
| Section | Questions | Rule |
|---|---|---|
| A | 5 × 2 marks | Attempt all |
| B | 5 × 7 marks | Attempt any 3 |
| C | 17 × 7 marks | Attempt any 1 |
4.Study order
- 1SQL queries and aggregates (Unit 2, Tier 1)
- 2Serializability (Unit 4, Tier 1)
- 3Normal forms (Unit 3, Tier 1)
- 4Schemas and data independence (Unit 1, Tier 1)
- 5ER diagram to tables (Unit 1, Tier 1)
- 6Transactions and ACID (Unit 4, Tier 1)
- 7MVD, JD, 4NF and 5NF (Unit 3, Tier 1)
- 8Validation and multiversion (Unit 5, Tier 1)
- 9Data models and languages (Unit 1, Tier 1)
- 10Joins and set operations (Unit 2, Tier 2)
- 11Functional dependencies and closure (Unit 3, Tier 2)
- 12Recoverable schedules (Unit 4, Tier 2)
- 13Deadlock handling (Unit 4, Tier 2)
- 14Minimal cover and keys (Unit 3, Tier 2)
- 15DBMS architecture and DBA (Unit 1, Tier 2)
- 16ER model concepts and keys (Unit 1, Tier 2)
- 17Relational algebra (Unit 2, Tier 2)
- 18Triggers and PL/SQL (Unit 2, Tier 2)
- 19Relational model and integrity (Unit 2, Tier 2)
FAQ
Which units of BCS501 carry the most marks?
Unit 2 (Relational data Model and Language · Introduction on SQL, 24% of past marks) and Unit 4 (Transaction Processing Concept · Distributed Database, 23% of past marks).
Do AKTU Database Management System questions repeat?
Yes. On average 74% of the marks in each newer BCS501 paper came from questions already asked in an earlier paper, and 32 questions have appeared in more than one paper.
How is this list made?
Every question from the 5 papers (2021-22–2025-26) was mapped to the current AKTU syllabus and grouped with the same question from other years. Questions are ranked by how many papers they appeared in, then by how recently.
Study this subject
Note: this is based on past AKTU papers, not a guarantee. Questions are mapped to the current syllabus; topics that are no longer in the syllabus are left out.