B.TechSemester 52025-26Database Management SystemBCS501
View PDFDownload

Database Management System (BCS501) - AKTU Question Paper 2025-26

B.Tech · Semester 5 · Free PDF Download

This is the official AKTU Database Management System Previous Year Question Paper for B.Tech Semester 5, academic session 2025-26. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 5
Session:2025-26
University:AKTU / UPTU

Rate this paper

Questions Asked in 2025-26

Database Management System (BCS501) — complete question paper · 70 marks · 3 Hours

Section AAttempt all q u e s t i o n s i n b r i e f . 2 x 7 = 14
  • a
    Explain Logical data Independence... 1 K 1
  • b
    Write Advantages of Database
  • c
    Define Relational Algebra
  • d
    Define constraint and its types in DBMS
  • f
    What is serializability in tran saction processing systems?
Section BAttempt any three o f t h e f o l l o w i n g : 7 x 3 = 21
  • a
    Discuss three level of abstr actions or schemas architecture of DBMS
  • b
    Write difference between Cross Join, Natural Join, left oute r join and right outer join with suitable example
  • c
    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 dep endency preserving?
  • d
    Define Transaction. Explain tr ansaction property with detail and suitable example
  • e
    Explain the Validation Based pr otocol for concurrency control
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 7 x 1 = 7
  • a
    Compare Generalization, Specia lization and Aggregation with suitable examples
  • b
    Draw an ER diagram of Hospital or Bank with showing the Specialization, Aggregation, Ge neralization. Also convert it in t o relational schemas and SQL DDL
  • a
    Consider the following relational DATABASE. Give an expressi on 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 an d 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 cit y as the company for which they work
  • b
    Discuss the importance of domai n constraints and key constra ints in maintaining database consistency. Also explain Entity Integrity and Referential Integrity constraints with suitable examples
  • a
    Short Notes of the Following- i) MVD or JD ii) Normalization with advanta
  • b
    Consider the universal relational schema R (A, B, C, D, E, F , G, H, I, J) and a set of following functiona l dependencies. F ={AB→C, A→DE, B→F, F →GH, D→IJ} Determine the keys for R? Decompose R into nd Normal Form
  • a
    Consider the three transactions T1, T2, and T3, and the sche dules S1 and
    S2 given below. Draw the seria lizability (precedence) graphs fo r S1and
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)
  • b
    Explain in details a bout ACID properties of transaction. 4 K 2
  • a
    Discuss the complexities of recovery with concurrent transac tions. Also explain the importance of the che ckpoints mechanism in reducing the time required for recovery after a system crash
  • b
    Describe major problems associated with concurrent processin g with examples. What is the role of locks in avoiding these Problems

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Repeated Questions — BCS501

Questions that appeared in more than one session, found by comparing 2 years of Database Management System papers (2024-25, 2025-26)

2x

Define constraint and its types in DBMS

Appeared in: 2024-25 · 2025-26

Database Management System — Other Year Papers

AKTU Database Management System PYQs from other sessions

Database Management System2021-22Database Management System2022-23Database Management System2024-25

More B.Tech Semester 5 (2025-26) Papers

Other subjects from same semester and session

Machine Design2025-26Essence Of Indian Traditional Knowledge2025-26Cloud Computing2025-26Design And Analysis Of Algorithm2025-26Constitution Of India2025-26I C Engines Fuels Lubrication2025-26Artificial Intelligence2025-26Machine Learning Techniques2025-26
View all B.Tech Semester 5 2025-26 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Database Management System — Unit-wise SyllabusBCS501AKTU 3rd Year SyllabusAKTU 3rd Year PYQs — All BranchesCSE 3rd Year SyllabusIT 3rd Year SyllabusCSE DS 3rd Year Syllabus