DBMS – STRUCTURED QUESTION BANK

(Based on University PYQs 2021–22, 2022–23, 2024–25)

Sources: KCS501 / BCS501 University Papers

UNIT–1: Introduction, Architecture & Data Independence

TOPIC 1: Database & File System

2 MARKS

• Define Database.

• Define DBMS.

• List any four disadvantages of file system approach over database approach.

• Database vs File System (any two differences).

5 MARKS

• Compare DBMS and File System.

7 / 10 MARKS

• Explain DBMS and its applications.

• Explain advantages of DBMS over File System.

TOPIC 2: DBMS Architecture & Components

2 MARKS

• List the four functions of DBA.

7 / 10 MARKS

• Draw the overall structure of DBMS and explain its components.

• Explain the architecture of DBMS with proper diagram.

TOPIC 3: Three-Schema Architecture & Data Independence ( VERY IMPORTANT)

2 MARKS
• What is the significance of Physical Data Independence?

• Differentiate between physical and logical data independence.

7 / 10 MARKS

• Describe the three-schema architecture.

• Why do we need mappings between schema levels?

• How do different schema definition languages support this architecture?

• Illustrate the concept of data independence and its types with example. Why is it
required?

TOPIC 4: Data Models

7 / 10 MARKS

• What are the different types of Data Models in DBMS? Explain them.
UNIT–2: Relational Model, Algebra, Calculus & SQL

TOPIC 1: Relational Model & Keys

2 MARKS

• Define candidate key and super key with example.

• List all prime and non-prime attributes in relation

TOPIC 2: Integrity Constraints

2 MARKS

• What are different integrity constraints?

TOPIC 3: Relational Algebra & Calculus

2 MARKS

• What is Relational Calculus?

• What is Equi-Join in database?

• What is closure of an attribute set?

5 / 10 MARKS

• Which relational algebra operations require union compatibility? Explain.

TOPIC 4: SQL Basics

2 MARKS

• What is a CLAUSE in SQL?

• Difference between DROP and DELETE command.

• Differentiate TRUNCATE and DELETE command.

TOPIC 5: SQL Queries ( REPEATED EVERY YEAR)

10 MARKS
Institute Library Schema

Student (RollNo, Name, Father_Name, Branch)

Book (ISBN, Title, Author, Publisher)

Issue (RollNo, ISBN, Date-of-Issue)

Write SQL and Relational Algebra queries:

1. List roll number and name of all students of branch ‘CSE’.

2. Find the name of student who has issued a book published by ‘ABC’.

3. List title of all books and authors issued to student ‘RAM’.

4. List title of all books issued on or before December 1, 2020.

5. List all books published by ‘ABC’.

TOPIC 6: Joins

7 / 10 MARKS

• What are Joins? Discuss all types of joins with suitable examples.

TOPIC 7: Triggers

2 MARKS

• Define Triggers and its types.

7 / 10 MARKS

• Explain Triggers in SQL / PL-SQL with example.

TOPIC 1: Functional Dependencies

2 MARKS

• Define transitive dependency.

• Define MVD with example.

7 / 10 MARKS

• Describe Armstrong’s Axioms and their role in database design.

• Explain MVD and discuss 4NF and 5NF.

TOPIC 2: Normal Forms & Decomposition

7 / 10 MARKS

• Find minimum cover of given set of functional dependencies.

• Decompose a relation into 2NF and 3NF.

• Analyze whether a given decomposition is lossless or lossy.

• Analyze and find the highest normal form of given relation.

UNIT–4: Transaction Processing & Recovery ( MOST IMPORTANT)

TOPIC 1: Transaction & ACID Properties

2 MARKS

• When is a transaction rolled back?

• What do you mean by currency with respect to database?

5 / 10 MARKS

• List ACID properties of transaction and explain usefulness of each.

• What is the importance of log?

TOPIC 2: Schedules & Serializability ( GUARANTEED)

7 / 10 MARKS
 • Describe serializable schedule.

• Discuss conflict serializability with example.

• Identify whether the given schedule is serializable or not:

S: R1(X) R2(X) R2(Y) W2(Y) R1(Y) W1(X)

• Check whether a schedule is conflict and view serializable.

TOPIC 3: Recoverability of Schedules

7 / 10 MARKS

• Define recoverable, cascadeless and strict schedules and compare them.

• Determine the strictest recoverability condition satisfied by given schedules.

TOPIC 4: Recovery from Failures

5 / 10 MARKS

• Determine different types of transaction failures and explain recovery using log file.

• Explain immediate update recovery technique.

• Explain deferred and immediate database modification.

• Explain checkpoints in DBMS.

TOPIC 5: Deadlock Handling

7 / 10 MARKS

• Explain deadlock.

• What are the necessary conditions for deadlock?

• How can deadlock be detected and recovered?

TOPIC 1: Locking & Granularity

2 MARKS

• List the levels of locking.

• Define multiple granularity.

TOPIC 2: Timestamp & Multiversion Protocols

7 / 10 MARKS

• Discuss timestamp ordering protocol.

• Explain strict vs basic timestamp ordering.

• Discuss multi-version concurrency control.

TOPIC 3: Optimistic / Validation Protocols

7 / 10 MARKS

• How do optimistic concurrency control techniques differ?

• Why are they called validation / certification techniques?

• Explain phases of optimistic concurrency control.

TOPIC 4: Distributed Transactions

7 / 10 MARKS

• Discuss 2-Phase Commit (2PC) protocol with example.

• How do validation based protocols differ from 2PC?

MOST REPEATED & MOST DANGEROUS QUESTIONS (DO NOT SKIP)

1. Three-Schema Architecture

2. Serializability + Schedule Numericals

3. SQL Queries on Library Schema

5. ACID + Log + Recovery

6. Deadlock Detection & Recovery

7. Timestamp / Multiversion / Validation Protocols

FINAL CONFIRMATION

✔ No PYQ skipped
✔ No question altered
✔ No syllabus mismatch
✔ Strictly University papers only

Next step (you decide):

• “Start Unit-1 answers”

• “Make 3-day DBMS revision plan”

• “Unit-4 numericals practice”

• “Give MIQs only”

I’m fully locked in for your final exams.