Printed Page: 1 of 2

Subject Code: KCS501

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. TECH.
(SEM V) THEORY EXAMINATION 2021-22
DATABASE MANAGEMENT SYSTEM
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
a. What is the significance of Physical Data Independence?
b. List the four functions of DBA.
c. When a relation set is called a recursive relationship set?
d. What do you mean by currency with respect to database?
e. What is Relational Calculus?
f. What is Equi-Join in database?
g. What is a CLAUSE in terms of SQL?
h. Define the closure of an attribute set.
i. When is a transaction Rolled Back?
j. List the various levels of locking?

SECTION B
2. Attempt any three of the following: 10 x 3 = 30

1
90

13
a. Draw the overall structure of DBMS and explain its various components.
_2

b. Which relational algebra operations require the participating tables to be union-

2.
compatible? Give the Reason in detail.
1P

24
c. What do you understand by transitive dependencies? Explain with an example
2O

5.
any two problems that can arise in the database if transitive dependencies are

.5
present in the database.
P2

17
d. List ACID properties of transaction. Explain the usefulness of each. What is
Q

the importance of log?

|1

e. What do you mean by time stamping protocol for concurrency controlling?

38

Discuss multi version scheme of concurrency control.

9:

SECTION C
:5

3. Attempt any one part of the following: 10 x 1 = 10

08

(a) What are the different types of Data Models in DBMS? Explain them.
(b) State the procedural DML and nonprocedural DML with their differences.
2
02

4. Attempt any one part of the following: 10 x 1 = 10

-2

(a) Consider the following schema for institute library:

n

Student (RollNo, Name, Father_ Name, Branch)

Ja

Book (ISBN, Title, Author, Publisher)

3-

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

|0

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.

QP22O1P_290 | 03-Jan-2022 08:59:38 | 117.55.242.131

 Printed Page: 2 of 2
Subject Code: KCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

5. Attempt any one part of the following: 10 x 1 = 10

(a) Describe Armstrong’s axioms in detail. What is the role of these rules in
database development process?
(b) Describe the term MVD in the context of DBMS by giving an example. Discuss
4NF and 5NF also.

6. Attempt any one part of the following: 10 x 1 = 10

(a) Describe serializable schedule. Discuss conflict serializability with suitable
example.
(b) Discuss the procedure of deadlock detection and recovery in transaction?

7. Attempt any one part of the following: 10 x 1 = 10

(a) Given a schedule S for transactions T1 and T2 with set of read and write
operations,
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 validation based protocols differ from 2PC?

1
90

13
_2

2.
1P

24
2O

5.
.5
P2

17
Q

|1
38
9:
:5
08
2
02
n -2
Ja
3-
|0

QP22O1P_290 | 03-Jan-2022 08:59:38 | 117.55.242.131

Printed Pages: 02 Sub Code:KCS-501

Paper Id: 231456 Roll No.

B.TECH.
(SEM V) THEORY EXAMINATION 2022-23
DATABASE MANAGEMENT SYSTEM
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2x10 = 20

(a) List any four disadvantages of file system approach over database approach.
(b) Differentiate between physical and logical data independence.
(c) What is the difference between DROP and DELETE command?
(d) What are different Integrity Constraints?
(e) 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}.
(f) Explain MVD with the help of suitable example.
(g) Discuss Consistency and Isolation property of a transaction.
(h) Draw a state diagram and discuss the typical states that a transaction goesthrough

2
90

13
during execution.
_2

(i) Discuss Conservative 2PL and Strict 2PL.

2.
(j) Describe how view serializability is related to conflict serializability.
P1

24
5.
3D

SECTION B

.5
P2

2. Attempt any three of the following: 10x3 = 30

17
Q

(a) A database is being constructed to keep track of the teams and games of a sport
|1
league. A team has a number of players, not all of whom participate in each
game. It is desired to keep track of players participating in each game for each
5
:2

team, the positions they play in that game and the result of the game.
23

(i) Design an E-R schema diagram for this application.

(ii) Map the E-R diagram into relational model
:
13

(b) What are Joins? Discuss all types of Joins with the help of suitable examples.
(c) A set of FDs for the relation R{A, B, C, D, E, F} is AB →C, C → A, BC →
3

D,ACD → B, BE → C, EC → FA, CF → BD, D→ E. Find a minimum cover

02

forth is set of FDs

-2

(d) What is a schedule? Define the concepts of recoverable, cascade less and strict
schedules, and compare them in terms of their recoverability.
01

(e) Discuss the immediate update recovery technique in both single-user and
2-

multiuser environments. What are the advantages and disadvantages of

|1

immediate update?

SECTION C
3. Attempt any one part of the following: 10x1 = 10
(a) Describe the three-schema architecture. Why do we need mappings between
schema levels? How do different schema definition languages support this
architecture?
(b) What are the different types of Data Models in DBMS? Explain them.

QP23DP1_290 | 12-01-2023 13:23:25 | 117.55.242.132

4. Attempt any one part of the following: 10 x1 = 10
(a) Consider the following schema for institute library:
Student (RollNo, Name, Father_ Name, Branch)
Book (ISBN, Title, Author, Publisher)
Issue (RollNo, 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) Explain different types of Triggers in SQL/PL SQL.

5. Attempt any one part of the following: 10x1 = 10

(a) Given the following set of FDs on schema R (V,W,X,Y,Z)
{Z→V, W→Y, XY→Z, V→WX}State whether the following decomposition are
loss-less-join decompositions or not.
(i) R1=(V,W,X) , R2=(V,Y,Z)
(ii) R1=(V,W,X), R2=(X,Y,Z)
(b) 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} }. What is the key for R? Decompose R into 2NF and
then3NF relations.

2
90

13
_2

2.
6. Attempt any one part of the following: 10x1 = 10
P1

24
(a) Consider schedules S1, S2, and S3 below. Determine whether each schedule is strict,
cascade less, recoverable, or non recoverable. (Determine the strictest recoverability

5.
3D

condition that each schedule satisfies.)

.5
P2

S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z); w2
(Y); c2; 17
Q

|1
S2: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
c1;c2; c3;
5

S3: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2
:2

(Y);c3; c2;
23

(b) Consider the three transactions T1, T2, and T3, and the schedules S1 and S2given
below. State whether each schedule is serializable or not. If a schedule is serializable,
:
13

write down the equivalent serial schedule(s).

T1: r1 (X); r1 (Z); w1 (X);
3

T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);

02

T3: r3 (X); r3 (Y); w3 (Y);

-2

S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
01

S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);
2-

7. Attempt any one part of the following: 10x1 = 10

|1

(a) Discuss the timestamp ordering protocol for concurrency control. How does strict
timestamp ordering differ from basic timestamp ordering?
(b) How do optimistic concurrency control techniques differ from other concurrency
control techniques? Why they are also called validation or certification techniques?
Discuss the typical phases of an optimistic concurrency control method.

QP23DP1_290 | 12-01-2023 13:23:25 | 117.55.242.132

 Printed Page: 1 of 3
Subject Code: BCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2024-25
DATABASE MANAGEMENT SYSTEM
TIME: 3 HRS M.MARKS: 70

Note: Attempt all Sections. In case of any missing data; choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 07 = 14

Q no. Question CO Leve
l
a. Define candidate key and super key with example. 1 K1
b. Differentiate TRUNCATE and DELETE command 2 K2
c. Define triggers and its types. 2 K1
d. Analyze and find the FDS in the following relation 3 K4
X Y Z
1 4 2
2 5 3
1 4 2

2
3 2 2

13
e.
90
List all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD 3 K1

2.
set F = {AB→C, B→E, C→D}.
_2

f. Explain properties of Transaction. 4 K2

24
P1

g. Define multiple granuality. 5 K1

5.
5D

.5
17
SECTION B
P2

2. Attempt any three of the following: |1 07 x 3 = 07

Q

Q no. Question CO Leve

AM

l
a. Explain the architecture of DBMS in terms of its components with a 1 K2
proper diagram.
0
:3

b. Explain Joins? Discuss all types of Joins with the help of proper example 2 K2
05

of each.
c. Consider the relation R (P, Q, S, T, X, Y, Z, W) with the following 3 K4
9:

functional dependencies.
25

PQ → X; P → YX; Q → Y; Y → ZW
Consider the decomposition of the relation R into the constituent
20

relations according to the following two decomposition schemes.

n-

D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]

D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]
Ja

Identify whether it is and lossy decomposition and justify your answer.

9-

d. Determine different types of failures in case of transactions and how it 4 K3

|0

can be recovered based on log file? Explain with suitable example.

e. Discuss Concurrency control. Why it is needed in DBMS? Also explain 5 K2
timestamp based ordering in Concurrency control.

1|Page
QP25DP1_290 | 09-Jan-2025 9:05:30 AM | 117.55.242.132
 Printed Page: 2 of 3
Subject Code: BCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2024-25
DATABASE MANAGEMENT SYSTEM
TIME: 3 HRS M.MARKS: 70

SECTION C
3. Attempt any one part of the following: 07 x 1 = 07
Q no. Question CO Level
a. Illustrate the concept of data independence and its type with example. 1 K4
Why is it required?
b.  Explain the process of reducing an ER diagram to tables. Provide a 1 K4
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: Attributes - EnrollmentID (Primary Key), DateEnrolled
Relationships:
Enrolls: A many-to-many relationship between Student and Course,

2
represented by the Enrollment entity.

13
90
a) Reduce the ER diagram to relational tables by listing the tables and

2.
their corresponding attributes.
_2

24
b) Identify primary keys and foreign keys in the tables you created.
P1

5.
5D

4. Attempt any one part of the following: 07 x 1 = 07

.5
17
Q no. Question CO Level
P2

a. Employee (ename, street, city) |1 2 K3

Q

Worksfor (ename, company_name, salary)

Company (Company_name, city)
AM

Construct the SQL statements for the following

(i) Create the above given tables with suitable data types and size.
0

(ii) Find the name of employees who live in the same city where they
:3

work.
05

(iii) Find the name of employees who have salary more than Rs. 50000.
9:

(iv) Find the name of employees who don’t work in “tcs” company.
(v) Find all employees whose name has second letter ‘A’.
25

(vi) Find the employee’s name having second highest salary.

20

b. Consider the following three relation schema S, P and SP in which S# is 2 K3

supplier code, P# part number and qty is quantity and others carry their
n-

respective meanings:
Ja

S(S#, SNAME, SCITY, TURNOVER)

P(P#,WEIGHT, COLOR, COST, SELLING PRICE)
9-

SP(S#, P#, QTY)

|0

Construct the appropriate RA statement for the following queries.

i Get all details of supplier who operate from CALCUTTA with
TURNOVER=80.
ii Get part numbers weighting between 25 and 55.
iii Get the part# which has cost greater than selling price.
iv Get the part numbers whose color is red or black.
v Get the SNAME where S# is 101.

2|Page
QP25DP1_290 | 09-Jan-2025 9:05:30 AM | 117.55.242.132
 Printed Page: 3 of 3
Subject Code: BCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2024-25
DATABASE MANAGEMENT SYSTEM
TIME: 3 HRS M.MARKS: 70

5. Attempt any one part of the following: 07 x 1 = 07

Q no. Question CO Level
a. Consider the following relational schemes for a library database: Book 3 K4
(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. Publisher Title Year --> Price
Analyze and find the highest normal form of the relation Book and
Collection.
b. Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the 3 K4
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

2
define MVD with example.

13
90

2.
_2
6. Attempt any one part of the following: 07 x 1 = 07

24
P1

Q no. Question CO Level

5.
a. Illustrate Conflict Serializable Schedule. Check the given Schedule S1 4 K4
5D

.5
is Conflict Serializable or not? Also check is it view Serializable?

17
P2

S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X)

b. |1
Explain schedule and transaction. Define the concepts of recoverable, 4 K4
Q

cascade less, and strict schedules, and compare them in terms of their
AM

recoverability.
0

7. Attempt any one part of the following: 07 x 1 = 07

:3
05

Q no. Question CO Leve

l
9:

a. Explore the following 5 K4

(i) Multi version protocol
25

(ii) Validation based protocol

20

b. Explain deadlock. What are the necessary conditions for it? How it can be 5 K4
detected and recovered?
n-
Ja
9-
|0

3|Page
QP25DP1_290 | 09-Jan-2025 9:05:30 AM | 117.55.242.132
 Printed Page: 1 of 2
Subject Code: KCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2023-24
DATA BASE MANAGEMENT SYSTEM
TIME: 3 HRS M.MARKS: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q No. Question Marks CO

a. What is the concept of keys in database? 2 1

b. What is strong & weak entity set? 2 1

c. Explain referential integrity. 2 2

d. Explain entity integrity constraints. 2 2

e. Write different inference rule for functional dependency? 2 3

f. Why do we normalize database? 2 3

g. What do you mean by testing of serializability? 2 4

90

1
h. Define replication in distributed database. 2 4

13
_2

i. Define concurrency control. 2 5

2.
P1

24
j. Define exclusive lock. 2 5
4D

5.
SECTION B
2. Attempt any three of the following:
.5
P2

17
a. Discuss three level of abstractions or schemas architecture of DBMS. 10 1
Q

|1

b. What is Aggregate function in SQL? Write SQL query for aggregate function. 10 2
4

c. Describe the following terms: (i) Multivalued dependency (ii) Trigger 10 3

1
4:

d. Discuss the procedure of deadlock detection and recovery in transaction? 10 4

:2
13

e. Write the salient features of graph based locking protocol with suitable example. 10 5
SECTION C
4

3. Attempt any one part of the following:

02

a. State the procedural DML and nonprocedural DML with their differences. 10 1
-2
01

b. Discuss the role of database administrator & explain the database architecture. 10 1
4. Attempt any one part of the following:
9-
|1

What is ER Diagram? Explain different components of an ER Diagram with employee

a. 10 2
project Management system.

Write difference between cross join, Natural join, left outer join and right outer join with
b. 10 2
suitable example.
5. Attempt any one part of the following:
What is functional dependency? Explain the procedure of calculating the canonical cover of
a. 10 3
a given functional dependency set with suitable example.

1|Page
QP24DP1_290 | 19-01-2024 13:24:14 | 117.55.242.131
 Printed Page: 2 of 2
Subject Code: KCS501
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2023-24
DATA BASE MANAGEMENT SYSTEM
TIME: 3 HRS M.MARKS: 100

Describe the term MVD in the context of DBMS by giving an example. Discuss 4NF and
b. 10 3
5NF also.
6. Attempt any one part of the following:
What is conflict serializable Schedule? Explain the difference between conflict and view
a. 10 4
serializable schedule using suitable example?

What is Log? How is it maintained? Discuss the features of deferred database modification
b. 10 4
and immediate database modification in brief.
7. Attempt any one part of the following:
Discuss 2 phase commit (2PC) protocol and time stamp-based protocol with suitable
a. 10 5
example. How the validation-based protocols differ from 2PC?

What are multi version schemes of concurrency control? Describe with the help of an
b. 10 5
example. Discuss the various Time stamping protocols for concurrency control also.
90

1
13
_2

2.
P1

24
4D

5.
.5
P2

17
Q

|1
1 4
4:
:2
13
4
02
-2
01
9-
|1

2|Page
QP24DP1_290 | 19-01-2024 13:24:14 | 117.55.242.131