Database Management System PYQ 2022-23 AKTU Question Paper

Database Management System AKTU syllabus

1. Unit 1: Introduction and ER Model
2. Unit 2: Relational Model and SQL
3. Unit 3: Database Design and Normalization
4. Unit 4: Transaction Processing and Distributed DB
5. Unit 5: Concurrency Control Techniques

Questions in Database Management System AKTU PYQ 2022-23

1. Q1a. List any four disadvantages of file system approach over database approach. (2 marks, 2022-23)
2. Q1b. Differentiate between physical and logical data independence. (2 marks, 2022-23)
3. Q1c. What is the difference between DROP and DELETE command? (2 marks, 2022-23)
4. Q1d. What are different Integrity Constraints? (2 marks, 2022-23)
5. Q1e. 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}. (2 marks, 2022-23)
6. Q1f. Explain MVD with the help of suitable example. (2 marks, 2022-23)
7. Q1g. Discuss Consistency and Isolation property of a transaction. (2 marks, 2022-23)
8. Q1h. Draw a state diagram and discuss the typical states that a transaction goes through during execution. (2 marks, 2022-23)
9. Q1i. Discuss Conservative 2PL and Strict 2PL. (2 marks, 2022-23)
10. Q1j. Describe how view serializability is related to conflict serializability. (2 marks, 2022-23)
11. Q2a. A 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 participate in each game. It is desired to keep track of players participating in each game for each team, the positions they play in that game and the result of… (10 marks, 2022-23)
12. Q2b. What are Joins? Discuss all types of Joins with the help of suitable examples. (10 marks, 2022-23)
13. Q2c. A 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 for this set of FDs. (10 marks, 2022-23)
14. Q2d. What is a schedule? Define the concepts of recoverable, cascade less and strict schedules, and compare them in terms of their recoverability. (10 marks, 2022-23)
15. Q2e. Discuss the immediate update recovery technique in both single-user and multiuser environments. What are the advantages and disadvantages of immediate update? (10 marks, 2022-23)
16. Q3a. Describe the three-schema architecture. Why do we need mappings between schema levels? How do different schema definition languages support this architecture? (10 marks, 2022-23)
17. Q3b. What are the different types of Data Models in DBMS? Explain them. (10 marks, 2022-23)
18. Q4a. Consider the following schema 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… (10 marks, 2022-23)
19. Q4b. Explain different types of Triggers in SQL/PL SQL. (10 marks, 2022-23)
20. Q5a. Given 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 decompositions are loss-less-join decompositions or not. (i) R1=(V,W,X), R2=(V,Y,Z) (ii) R1=(V,W,X), R2=(X,Y,Z). (10 marks, 2022-23)
21. Q5b. Consider 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 2NF and then 3NF relations. (10 marks, 2022-23)
22. Q6a. Consider schedules S1, S2, and S3 below. Determine whether each schedule is strict, cascade less, recoverable, or non recoverable. (Determine the strictest recoverability condition that each schedule satisfies.) S1: r1(X); r2(Z); r1(Z); r3(X); r3(Y); w1(X); c1; w3(Y); c3; r2(Y); w2(Z); w2(Y); c2;… (10 marks, 2022-23)
23. Q6b. Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given 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);… (10 marks, 2022-23)
24. Q7a. Discuss the timestamp ordering protocol for concurrency control. How does strict timestamp ordering differ from basic timestamp ordering? (10 marks, 2022-23)
25. Q7b. How do optimistic concurrency control techniques differ from other concurrency control techniques? Why they are also called validation or certification techniques? Discuss the typical phases of an optimistic concurrency control method. (10 marks, 2022-23)

Database Management System previous year papers

• PYQ 2024-25
• PYQ 2023-24

More Database Management System resources

• Important Questions: Unit 1 Important Questions
• Important Questions: Unit 2 Important Questions
• Important Questions: Unit 3 Important Questions
• Important Questions: Unit 4 Important Questions
• Important Questions: Unit 5 Important Questions
• Important Questions: Important Questions (All Units)
• Notes: Unit 1 Notes
• Notes: Unit 2 Notes
• Notes: Unit 3 Notes
• Notes: Unit 4 Notes
• Notes: Unit 5 Notes
• Notes: Notes (All Units)

Database Management System exam preparation

• Database Management System Important Topics
• Database Management System PYQ Analysis (unit-wise)
• Database Management System Predicted Paper
• Database Management System Important Questions