B.Tech (Semester V) | AKTU / UPTU | Exam Year: 2023–24
Maximum Marks: 100 | Time: 3 Hours | Paper ID: 310405
This exam paper is designed to test students’ conceptual and analytical understanding of Database Management Systems (DBMS) — focusing on database architecture, relational models, normalization, concurrency control, SQL commands, and transaction management.
The paper contains three sections (A, B, and C) — each section covering progressively deeper questions, from conceptual basics to design and transaction-level applications.
SECTION A – Short Answer Questions (10 × 2 = 20 Marks)
Students must attempt all ten short questions, each carrying 2 marks.
This section tests basic DBMS concepts like keys, integrity constraints, normalization, and concurrency control.
Sample Questions (Page 1):
What is the concept of keys in a database?
Define strong and weak entity sets.
Explain referential integrity.
What is entity integrity constraint?
Write different inference rules for functional dependency.
Why do we normalize databases?
What do you mean by testing of serializability?
Define replication in distributed databases.
Define concurrency control.
What is an exclusive lock?
Concepts Covered:
Keys and constraints, functional dependencies, normalization, serializability, replication, concurrency control, and database locking mechanisms.
SECTION B – Descriptive Questions (3 × 10 = 30 Marks)
Students are required to attempt any three questions.
This section tests the ability to explain, differentiate, and apply relational and transaction-based DBMS concepts using SQL and normalization techniques.
Sample Questions (Page 1):
Discuss the three levels of abstraction (schemas) in DBMS architecture.
What is an aggregate function in SQL? Write an SQL query using one.
Describe the terms Multivalued Dependency (MVD) and Trigger.
Discuss the procedure of deadlock detection and recovery in transactions.
Write salient features of graph-based locking protocol with examples.
Concepts Covered:
DBMS architecture, SQL aggregate functions, triggers, multivalued dependencies, concurrency protocols, and deadlock recovery.
SECTION C – Long Answer / Analytical Questions (5 × 10 = 50 Marks)
Students must attempt one part from each question (Q3–Q7).
This section evaluates design-based and transaction-based problem-solving using ER diagrams, normalization, transaction scheduling, and protocols.
Sample Questions (Page 1–2):
Q3.
a. Explain procedural and non-procedural DML with examples.
b. Discuss the role of a database administrator (DBA) and the database architecture.
Q4.
a. Draw and explain an ER Diagram for an Employee–Project Management System.
b. Write differences between Cross Join, Natural Join, Left Outer Join, and Right Outer Join with examples.
Q5.
a. What is functional dependency? Explain how to calculate the canonical cover of a functional dependency set with an example.
b. Describe multivalued dependency in DBMS. Discuss 4NF and 5NF with examples.
Q6.
a. Define a conflict serializable schedule. Explain how conflict and view serializability differ with examples.
b. What is a log? Discuss deferred and immediate database modification methods.
Q7.
a. Discuss the two-phase commit (2PC) protocol and timestamp-based protocols with examples.
b. Explain multiversion concurrency control schemes and various timestamp protocols used for concurrency.
Concepts Covered:
ER diagrams, joins in SQL, normalization (1NF–5NF), canonical cover, serializability, transaction recovery, concurrency control, and commit protocols.
Learning Outcomes:
By completing this paper, students should be able to:
Understand the architecture and design of database systems.
Apply SQL and relational algebra for data manipulation.
Analyze and normalize databases for efficiency.
Manage transactions, concurrency, and recovery effectively.
Demonstrate clear understanding of distributed database protocols.
