Scribd
Upload
76 views

DBMS_Question_Paper_2025

This document outlines the examination details for the Database Management Systems subject for B.C.A. Semester IV at I.K. Gujral Punjab Technical University. It includes instructions for candidates, two sections with various questions covering topics such as ER-to-Relational Mapping, SQL, Normalization, Transaction Management, Distributed Databases, and Big Data. The exam is scheduled for June 2025, lasting 3 hours with a total of 60 marks available.

Uploaded by

imjklyuo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

DBMS_Question_Paper_2025

This document outlines the examination details for the Database Management Systems subject for B.C.A. Semester IV at I.K. Gujral Punjab Technical University. It includes instructions for candidates, two sections with various questions covering topics such as ER-to-Relational Mapping, SQL, Normalization, Transaction Management, Distributed Databases, and Big Data. The exam is scheduled for June 2025, lasting 3 hours with a total of 60 marks available.

Uploaded by

imjklyuo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

I.K.

Gujral Punjab Technical University


B.C.A. – Semester IV (CBCS, 2025 Scheme)
Subject: DATABASE MANAGEMENT SYSTEMS Subject Code: UGCA1922
Paper Code (M-Code): 90726 Date of Examination: ___ June 2025
Time: 3 Hours Maximum Marks: 60 Total No. of Questions: 07

INSTRUCTIONS TO CANDIDATES
1. SECTION-A is compulsory. It contains 10 short-answer questions of 2 marks each.
2. SECTION-B contains 6 long-answer questions of 10 marks each. Attempt any FOUR questions from
3. Assume missing data / reasonable values wherever necessary and state them clearly.
4. Use neat diagrams wherever required.

SECTION – A (Attempt all questions; 10 × 2 = 20 marks)


1. Answer briefly:
a) List any two differences between schema and instance of a database.
b) What is a domain constraint? Give one example in SQL.
c) Define candidate key and alternate key with an illustration.
d) Differentiate between natural join and theta join.
e) What is a materialized view? Mention one advantage.
f) Explain the term cascade delete in referential integrity.
g) What is shadow paging in recovery management?
h) State the purpose of cost-based query optimisation.
i) When do two schedules become view-equivalent?
j) Expand BASE properties of NoSQL databases and write any one property in a sentence.

SECTION – B (Attempt any FOUR; 4 × 10 = 40 marks)


2. ER-to-Relational Mapping
a) Draw an ER diagram for an online book-rental system covering books, members, rentals, and paym
b) Convert the diagram into a set of relational schemas, specifying primary and foreign keys.

3. SQL & Advanced Features


Write SQL statements for the following on relation schemas Student(SID, Name, Dept, CGPA) and Co
i) Create tables with all necessary constraints.
ii) Generate a list of students who have taken all courses offered by their department.
iii) Create an inline-table-valued function that returns the transcript of a given student.
Explain the purpose of each query.

4. Normalization & Dependency Analysis


Given R(P, Q, R, S, T, U) with FDs:
F = { P→QR, RS→T, Q→S, T→U, U→P }
a) Find all candidate keys.
b) Decompose R into relations in BCNF, showing each step and proving lossless join.

5. Transaction Management
Discuss the Two-Phase Locking (2PL) protocol. Show, with a timeline diagram, how 2PL can lead to a
Then explain one deadlock handling technique used in DBMSs and its trade-offs.

6. Distributed Databases
a) Differentiate horizontal fragmentation and vertical fragmentation with examples.
b) For a bank database distributed across three cities, design a fragmentation and replication strategy

7. Big-Data & NoSQL Perspective


a) Compare the relational model with the column-family data model in terms of schema flexibility, con
b) Describe the MapReduce paradigm. Write pseudo-code to compute the top-5 most-frequently issue

End of Question Paper

You might also like