B.TechSemester 52024-25Database Management SystemBCS501

Database Management System (BCS501) - AKTU Question Paper 2024-25

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 2024-25. 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:2024-25

University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

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

Section AAttempt all questions in brief. 2 x 07 = 14

a
Define candidate key and super key with example
b
Differentiate TRUNCATE and DELETE command
c
Define triggers and its types
d
Analyze and find the FD S in the following relation
e
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}
f
Explain properties of Transaction
g
Define multiple granuality

Section BAttempt any three of the following: 07 x 3 = 07

a
Explain the architec ture of DBMS in terms of its compone nts with a proper diagram
b
Explain Joins? Discuss all types of Joins with the help of p roper example of each
c
C o n s id e r th e r e la ti o n R ( P , Q , S , T, X , Y , Z , W ) w i th t h e f ollowing functional dependencies. Consider the decomposition of the relation R into the constitue nt relations according to the following two decomposition schemes. Identify whether it is and lossy decomposition and justify your answer
d
Determine different types of failures in case of transaction s and how it can be recovered based on log file? Explain with suitable example
e
Discuss Concurrency control. Why it is needed in DBMS? Also explain timestamp based ordering in Concurrency control

Section CAttempt any one part of the following: 07 x 1 = 07

a
Illustrate the concept of dat a independence and its type wit h example. Why is it required?
b
 Explain the process of reducing an ER diagram to tables. Provide a simple example.  Given the following ER diagram representing a university database: Entities: Student: Attributes - StudentID (Primary Key), Name, Email Course: Attributes - CourseID (Primary Key), CourseName, Credits Enrollment: Attributes - EnrollmentID (Primary Key), DateEnrolled Relationships: Enrolls: A many-to-many relati onship between Student and Course , represented by the Enrollment entity
a
Reduce the ER diagram to relational tables by listing the ta bles and their corresponding attributes
b
Identify primary keys and foreign keys in the tables you created
a
Employee (ename, street, city) Worksfor (ename, company_name, salary) Company (Company_name, city) Construct the SQL statements for the following (i) Create the above given tables with suitable data types and size. (ii) Find the name of employees w ho live in the same city where they work. (iii) Find the name of employees who have salary more than Rs. 50000. (iv) Find the name of employees who don’t work in “tcs” company. (v) Find all employees whose name has second letter ‘A’. (vi) Find the employee’s name having second highest salary
b
Consider the following three relation schema S, P and SP in whi ch S# is supplier code, P# part number and qty is quantity and others ca rry their respective meanings: S(S#, SNAME, SCITY, TURNOVER) P(P#,WEIGHT, COLOR, COST, SELLING PRICE) SP(S#, P#, QTY) Construct the appropriate RA statement for the following queries. i Get all details of supplier who operate from CALCUTTA with TURNOVER=80. ii Get part numbers weighting between 25 and 55. iii Get the part# which has cost greater than selling price. iv Get the part numbers whose color is red or black. v Get the SNAME where S# is 101
a
Consider the following relational schemes for a library databas e: Book (Title, Author, Catalog_no, Publisher, Year, Price), Collection (Title, Author, Catalog_no) with in the following functional dependencies: I. Title Author --> Catalog_no II. Catalog_no --> Title, Author, Publisher, Year III. Publisher Title Year --> Price Analyze and find the highest normal form of the relation Book and Collection
b
Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the {B}→{F}, {F}→{G,H}, {D}→{I, J} }. Identify the key for R? Also define MVD with exam ple
a
Illustrate Conflict Serializable Schedule. Check the given S chedule S1 is Conflict Serializable or not? Also check is it view Serializable?
b
Explain schedule and transaction. Define the concepts of rec overable, cascade less, and strict schedules, and compare them in terms o f their recoverability
a
Explore the following (i) Multi version protocol (ii) Validation based protocol
b
Explain deadlock. What are the necessary conditions for it? How it can be detected and recovered?

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)

Define triggers and its types

Appeared in: 2024-25 · 2025-26

Database Management System — Other Year Papers

AKTU Database Management System PYQs from other sessions

Database Management System2021-22 Database Management System2022-23 Database Management System2025-26

More B.Tech Semester 5 (2024-25) Papers

Other subjects from same semester and session

Machine Design2024-25 Bio Medical Signal Processing2024-25 Turbo Machines2024-25 Essence Of Indian Traditional Knowledge2024-25 Cloud Computing2024-25 Design And Analysis Of Algorithm2024-25 Computer Vision2024-25 Advance Manufacturing Processes2024-25

View all B.Tech Semester 5 2024-25 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Database Management System — Unit-wise SyllabusBCS501 AKTU 3rd Year Syllabus AKTU 3rd Year PYQs — All Branches CSE 3rd Year Syllabus IT 3rd Year Syllabus CSE DS 3rd Year Syllabus