0% found this document useful (0 votes)
89 views3 pages

DATABASE MANAGEMENT SYSTEM Question Paper 21 22

The document contains questions for an exam on database management systems. It covers topics like physical data independence, relational algebra operations, transaction properties, concurrency control techniques, data models, and normal forms. Students are required to answer questions that involve schemas, queries, triggers, dependencies, and serialization.
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
0% found this document useful (0 votes)
89 views3 pages

DATABASE MANAGEMENT SYSTEM Question Paper 21 22

The document contains questions for an exam on database management systems. It covers topics like physical data independence, relational algebra operations, transaction properties, concurrency control techniques, data models, and normal forms. Students are required to answer questions that involve schemas, queries, triggers, dependencies, and serialization.
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/ 3

Subject Code: XXXXX

Roll No:

BTECH
(SEM-5) DATABASE MANAGEMENT SYSTEM 2021-22

TIME:3 HOUR Total Marks: 100

Instruction: Attempt the questions as per the given instructions. Assume missing data suitably.

SECTION - A

Attempt All Parts in Brief 2*10 = 20

Q1 Questions Marks

(a) What is the significance of Physical Data Independence? 2

(b) List the four functions of DBA. 2

(c) When a relation set is called a recursive relationship set ? 2

(d) What do you mean by currency with respect to database ? 2

(e) What is Relational Calculus ? 2

(f) What is Equi-Join in database ? 2

(g) What is a CLAUSE in terms of SQL ? 2

(h) Define the closure of an attribute set. 2

(i) When is a transaction Rolled Back ? 2

(j) List the various levels of locking? 2

SECTION - B
Attempt Any Three of the following 3*10 = 30

Q2 Questions Marks

(a) Draw the overall structure of DBMS and explain its various components. 10

(b) Which relational algebra operations require the participating tables to be union-compatible ? Give the reason 10
in detail.

(c) What do you understand by transitive dependencies ? Explain with an example any two problems that can 10
arise in the database if transitive dependencies are present in the database.

(d) List ACID properties of transaction. Explain the usefulness of each. What is the importance of log ? 10

(e) What do you mean by time stamping protocol for concurrency controlling ? Discuss multi version scheme of 10
concurrency control.

SECTION - C

Attempt Any One of the following 5*10 = 50

Q3 Questions Marks

(a) What are the different types of Data Models in DBMS ? Explain them. 10

(b) State the procedural DML and non-procedural DML with their differences. 10

Q4 Questions Marks

(a) Consider the following schema for institute library :


Student (RolINo, Name, Father_ Name, Branch) 10
Book (ISBN, Title, Author, Publisher)
Issue (RolINo, 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 CSE.
II. Find the name of student who has issued a book published by ‘ABC’ publisher.
III. List title of all books and their authors issued to a student RAM.
IV. List title of all books issued on or before December 1, 2020.
V. List all books published by publisher 'ABC'.

(b) What do you mean by trigger ? Explain it by a suitable example. 10

Q5 Questions Marks

(a) Describe Armstrong's axioms in detail. What is the role of these rules in database development process ? 10

(b) Describe the term MVD in the context of DBMS by giving an example. Discuss 4NF and 5NF also. 10
Q6 Questions Marks

(a) Describe serializable schedule. Discuss con flict serializability with suitable example. 10

(b) Discuss the procedure of deadlock detection and recovery in transaction ? 10

Q7 Questions Marks

(a) Given a schedule S for transactions T1 and T2 with set of read and write operations, 10
S: R1(X) R2(X) R2(Y) W2(Y) R1(Y) W1(X).
Identify, whether given schedule is equivalent to serial schedule or not ?

(b) Discuss 2 phase commit (2PC) protocol and time stamp based protocol with suitable example. How the 10
validation based protocols differ from 2PC?

You might also like