Roll No.

___________________

KIET Group of Institutions

PUE Examination (2022-2023) ODD Semester

Department: CSE Course: B.Tech

Year: 3 Semester: 5th
Subject Name: DBMS Subject Code: KCS501

Duration: 3 Hrs Max. Marks: 100

Note: Attempt all the questions of each section
Section-A (2X10=20)
Q. 1 Competitive C BL/
Exam# O KC*
a What do you understand by Database Management System (DBMS)? 1 1/F
b Define level of data abstraction? 1 2/C
c Explain Keys and its use. 2 2/C
d What is trivial and nontrivial dependency? 2 1/F
e Find candidate key in relation R(A,B,C,D,E,F,G) having set of FDs {A-> B, B
3 3/C
-> G, B -> EF,CD -> E}
f Discuss the concept of cascading rollback? 3 3/C
g Differentiate between non serial and serializable schedule. 4 4/C
h Explain recoverable schedule? 4 2/C
i Differentiate between an explicit and an implicit lock. 5 4/C
j Explain starvation? Explain with example. 5 2/C
Section-B (6X5=30)
Differentiate between Data Definition Language and Data Manipulation
Language?
Q. 2 1 3/C
OR
Illustrate the architecture of DBMS.
Solve SQL queries for the given database.
Employee (eid, emp-name, street, city)
Works (eid, cid, salary)
Company (cid, comp-name, city)
Manager (eid, manager-name)
1. Find the names of all the employees having 'S' as first letter in their
names.
2. Display the annual salary of all the employees.
3. Find the name, street and city of all employees who work for
"Accenture" and earn more than 30,000.
OR
Q. 3 Consider following scheme for PROJECT database: 2 4/C

Project (Project_No, Project_name, Project_Manager)

Employee (Employee_No, Employee_Name)
Assigned_To (Projet_No, Employee_No)
1. Write SQL statement for implementation of PROJECT database. The SQL
statement should clearly indicate the primary Key and Foreign Keys.
2. Write following queries in SQL:
a. Get the detail of employees working on both projects ‘P1’ and ‘P2’
b. List the name of employees who are working on a project for which ‘El’
is the project manager.

Find the minimal cover of the set of functional dependencies given; {A → C,

AB → C, C → DI, CD → I, EC → AB, EI → C} Gate- 2004
Q. 4 3 4/C
OR
Consider and Examine R(A,B,C,D,E,F) and FDs {A-> CD, B-> E, AB-> F}.
i. Find candidate key of R
● CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
● Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
● *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
● #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )
 Roll No. ___________________
ii. Find Normal Form of R
iii. Decompose it till 3NF
Describe ACID properties of transaction with example.
Q. 5 OR 4 3/C
Describe Different states of a transaction with diagram.
Define Serializability. Discuss View Serializability.
OR
Q. 6 5 2/C
Show that the Two Phase locking protocol ensure Conflict serializability, and
that transaction can be serialized according to their lock points.
Section-C (10X5=50)
Differentiate between database system and File system. State advantages of
DBMS over File systems.
OR
Q. 7 1 4/C
Describe all symbols used in ER diagram. Draw the E-R diagram of the
registration process of the student in a particular course. Convert the E-R
diagram into tables also.
Consider the following relational database schema consisting of the four relation
schemas:
passenger ( pid, pname, pgender, pcity)
agency ( aid, aname, acity)
flight (fid, fdate, time, src, dest)
booking (pid, aid, fid, fdate)
Answer the following questions using relational algebra queries
i) Get the complete details of all flights to New Delhi. Gate-2001
ii) Get the details about all flights from Chennai to New Delhi.
Q. 8 iii) Find only the flight numbers for passenger with pid 123 for flights 2 5/C
to Chennai before 06/11/2020.
iv) Find the passenger names for passengers who have bookings on at
least one flight.
v) Find the agency names for agencies that located in the same city as
passenger with passenger id 123.
OR
Define PL/SQL block. Explain cursors and its type. Explain the purpose of
following cursor attributes: %FOUND, %ISOPEN, %NOTFOUND,
and %ROWCOUNT.
Consider a relation scheme R = (A, B, C, D, E, F, G, H ) on which the following NET 2006
functional dependencies hold: { AB->C, BC->D, E->F, G->F, H->A, FG->H}.
Is the decomposition of R into R1(A,B,C,D) , R2(A,B,C,E,F) and
R3(A,D,F,G,H) lossless? Is it dependency preserving.
OR
Q. 9 3 5/C
Consider the universal relation R(A,B,C,D,E,F,G,H,I,J) and set of functional
dependencies F as given below:
F= {AB-> C, A-> DE, B-> F, F-> GH, D-> IJ}
(a) Determine the key for R.
(b) Decompose R into second Normal form.
Describe distributed database. List advantage and disadvantages of replication
and data fragmentation.
Q. 10 4 3/C
OR
Outline the concept of Deadlock? Classify the Deadlock handling techniques?
Illustrate multiple granularity locking? How is it implemented?
OR
Illustrate timestamp protocol. In timestamp ordering w-timestamp (Q) denotes
Q. 11 5 3/C
the largest timestamp that executes write (Q) successfully. If we define it to be
timestamp of most recent transaction to execute write (Q) successfully. Is there
any difference? Justify your answer.

● CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
● Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
● *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
● #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )