Database Management System PYQ 2024-25 AKTU Question Paper
AKTU · BTECH · Semester 5 · Database Management System · Session 2024-25 · PYQ
AKTU Database Management System previous year question paper 2024-25 for B.Tech Semester 5. Covers Introduction and ER Model, Relational Model and SQL…
Open the interactive reader to study this resource on AcademicArk.
Database Management System AKTU syllabus
- Unit 1: Introduction and ER Model
- Unit 2: Relational Model and SQL
- Unit 3: Database Design and Normalization
- Unit 4: Transaction Processing and Distributed DB
- Unit 5: Concurrency Control Techniques
Questions in Database Management System AKTU PYQ 2024-25
- Q1a. Define candidate key and super key with example. (2 marks, 2024-25)
- Q1b. Differentiate TRUNCATE and DELETE command (2 marks, 2024-25)
- Q1c. Define triggers and its types. (2 marks, 2024-25)
- Q1d. Analyze and find the FDS in the following relation X Y Z 1 4 2 2 5 3 1 4 2 3 2 2 (2 marks, 2024-25)
- 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, 2024-25)
- Q1f. Explain properties of Transaction. (2 marks, 2024-25)
- Q1g. Define multiple granuality. (2 marks, 2024-25)
- Q2a. Explain the architecture of DBMS in terms of its components with a proper diagram. (7 marks, 2024-25)
- Q2b. Explain Joins? Discuss all types of Joins with the help of proper example of each. (7 marks, 2024-25)
- Q2c. Consider the relation R (P, Q, S, T, X, Y, Z, W) with the following functional dependencies. PQ → X; P → YX; Q → Y; Y → ZW Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes. D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y);… (7 marks, 2024-25)
- Q2d. Determine different types of failures in case of transactions and how it can be recovered based on log file? Explain with suitable example. (7 marks, 2024-25)
- Q2e. Discuss Concurrency control. Why it is needed in DBMS? Also explain timestamp based ordering in Concurrency control. (7 marks, 2024-25)
- Q3a. Illustrate the concept of data independence and its type with example. Why is it required? (7 marks, 2024-25)
- Q3b. 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:… (7 marks, 2024-25)
- Q4a. 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 who live in the same city where they work. (iii)… (7 marks, 2024-25)
- Q4b. Consider the following three relation schema S, P and SP in which S# is supplier code, P# part number and qty is quantity and others carry 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… (7 marks, 2024-25)
- Q5a. Consider the following relational schemes for a library database: 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.… (7 marks, 2024-25)
- 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} }. Identify the key for R? Also define MVD with example. (7 marks, 2024-25)
- Q6a. Illustrate Conflict Serializable Schedule. Check the given Schedule S1 is Conflict Serializable or not? Also check is it view Serializable? S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X) (7 marks, 2024-25)
- Q6b. Explain schedule and transaction. Define the concepts of recoverable, cascade less, and strict schedules, and compare them in terms of their recoverability. (7 marks, 2024-25)
- Q7a. Explore the following (i) Multi version protocol (ii) Validation based protocol (7 marks, 2024-25)
- Q7b. Explain deadlock. What are the necessary conditions for it? How it can be detected and recovered? (7 marks, 2024-25)
AKTU paper codes: BCS501, KCS501, RCS501
Database Management System previous year papers
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)
Browse all notes · Semester 5 notes