Database Management System (KCS501) - AKTU Question Paper 2022-23
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 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2022-23
Database Management System (KCS501) — complete question paper
- aList any four disadvantages o f file system approach over database approach
- bDifferentiate between physic al and logical data independence
- cWhat is the difference betw een DROP and DELETE command?
- dWhat are different Integrity Constraints?
- eList all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD set
- fExplain MVD with the help of suitable example
- gDiscuss Consistency and Isol ation property of a transaction
- hDraw a state diagram and dis cuss the typical states that a transaction goesthrough during execution. (i) Discuss Conservati ve 2PL and Strict 2PL. (j) Describe how view serializability is related to conflict se rializability
- aA database is being constructed to keep track of the teams and games of a sport league. A team has a number of players, not all of whom partici pate in each game. It is desired to keep track of players participating in e ach game for each team, the positions they play in that game and the result of the game. (i) Design an E-R schema diagram for this application. (ii) Map the E-R diagram into relational model
- bWhat are Joins? Discuss all types of Joins with the help of suitable examples
- cA set of FDs for the relation R{A, B, C, D, E, F} is AB →C, C → A, BC → D,ACD → B, BE → C, EC → FA, CF → BD, D→ E. Find a minimum cover forth is set of FDs
- dWhat is a schedule? Define t he concepts of recoverable, cascade less and strict schedules, and compare them in terms of their recoverability
- eDiscuss the immediate update recovery technique in both sin gle-user and multiuser environments. What are the advantages and disadvantag es of immediate update?
- aDescribe the three-schema arc hitecture. Why do we need mapp ings between schema levels? How do different schema definition languages sup port this architecture?
- bWhat are the different types of Data Models in DBMS? Explain them
- aConsider the following sc hema for institute library: Student (RollNo, Name, Father_ Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RollNo, ISBN, Date-of –Issue) Write the following queries in SQL and relational algebra: (i) List roll number and name of all students of the branch ‘CSE’. (ii) Find the name of student who has issued a book published by ‘ABC’ publisher. (iii) List title of all books and their authors issued to a student ‘RAM’. (iv) List title of all books issued on or before December 1, 2020. (v) List all books published by publisher ‘ABC’
- bExplain different types of Triggers in SQL/PL SQL
- aGiven the following set of FDs on schema R (V,W,X,Y,Z) {Z→V, W→Y, XY→Z, V→WX}State whether the following decomposition are loss-less-join decompositions or not
- bConsider the universal relation R = {A, B, C, D, E, F, G, H , I, J} and the set of functional dependencies F = { {A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G,H}, {D}→{I, J} }. What is the key for R? Decompose R into 2 NF and then3NF relations
- aConsider schedules S1, S2, and S3 below. Determine whether each schedule is strict,
cascade less, recoverable, or non recoverable. (Determine the s trictest recoverability condition that each schedule satisfies.) (Y); c2; S2: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y); c1;c2; c3; (Y);c3; c2
- bConsider the three transactions T1, T2, and T3, and the sch edules S1 and S2given
below. 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); (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y)
- aDiscuss the timestamp orderi ng protocol for concurrency con trol. How does strict timestamp ordering differ from basic timestamp ordering?
- bHow do optimistic concurrency control techniques differ fro m other concurrency control techniques? Why they are also called validation or certification techniques? Discuss the typical phases of an optimistic concurrency control method
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 — KCS501
Questions that appeared in more than one session, found by comparing 3 years of Database Management System papers (2021-22, 2022-23, 2023-24)
What are the different types of Data Models in DBMS? Explain them
Appeared in: 2021-22 · 2022-23
Consider the following sc hema for institute library: Student (RollNo, Name, Father_ Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RollNo, ISBN, Date-of –Issue) Write the following queries in SQL and relational algebra: (i) List roll number and name of all students of the branch ‘CSE’. (ii) Find the name of student who has issued a book published by ‘ABC’ publisher. (iii) List title of all books and their authors issued to a student ‘RAM’. (iv) List title of all books issued on or before December 1, 2020. (v) List all books published by publisher ‘ABC’
Appeared in: 2021-22 · 2022-23
Database Management System — Other Year Papers
AKTU Database Management System PYQs from other sessions
More B.Tech Semester 5 (2022-23) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo