H.T.

No: Course Code No: 19CS4T03

VISHNU INSTITUTE OF TECHNOLOGY:: BHIMAVARAM (AUTONOMOUS)

II B. Tech II Semester (R19) - Supplementary Examinations, February - 2023
Database Management Systems
(CSE & IT)
Time: 3hours Max. Marks: 60M

Note: 1. Answer all the 6 Questions

2. Each Question carries 10 Marks
3. Answer any one question from each unit
UNIT – I
1 a Explain the difference between external, internal, and conceptual schemas. L CO1 [5M]
How are these different schema layers related to the concepts of logical and 2
physical data independence?
b With a neat diagram explain the architecture of a Database Management L CO1 [5M]
System 2
(OR)
2 a Discuss the role of Database Administrator L CO1 [5M]
2
b Compare and contrast various Data Models. L CO1 [5M]
1
UNIT – II
3 a A company database needs to store information about employees (identified L CO2 [5M]
by ssn, with salary and phone as attributes); departments (identified by dno, 2
with dname and budget as attributes); and children of employees (with name
and age as attributes). Employees work in departments; each department is
managed by an employee; a child must be identified uniquely by name when
the parent (who is an employee; assume that only one parent works for the
company) is known. Draw an ER diagram that captures this information.
b Consider the following schema: L CO2 [5M]
Suppliers(sid: integer, sname: string, address: string) 2
Parts(pid: integer, pname: string, color: string)
Catalog(sid: integer, pid: integer, cost: real)
sid is the key for Suppliers, pid is the key for Parts, and sid and pid together
form thekey for Catalog. The Catalog relation lists the prices charged for
parts by Suppliers. Write the following queries in Tuple Relational Calculus:
• Find the names of suppliers who supply some red part.
• Find the sids of suppliers who supply some red or green part.
• Find the sids of suppliers who supply some red part or are at
Hyderabad.
• Find the sids of suppliers who supply some red part and some green
part.
• Find the sids of suppliers who supply every red part.
(OR)
4 a Consider a university database for the scheduling of classrooms for final L CO2 [5M]
1 of 4
 exams. This database could be modeled as the single entity set exam, with 1
attributes course-name, section-number, room-number, and time.
Alternatively, one or more additional entity sets could be defined, along with
relationship sets to replace some of the attributes of the exam entity set, as

• course with attributes name, department, and c-number

• section with attributes s-number and enrollment, and dependent as a weak
entity set on course
• room with attributes r-number, capacity, and building
Draw an E-R diagram illustrating the use of all three additional entity sets
listed.
b Consider the following schema: L CO2 [5M]
Suppliers(sid: integer, sname: string, address: string) 2
Parts(pid: integer, pname: string, color: string)
Catalog(sid: integer, pid: integer, cost: real)
sid is the key for Suppliers, pid is the key for Parts, and sid and pid together
form thekey for Catalog. The Catalog relation lists the prices charged for
parts by Suppliers. Writethe following queries in relational algebra:
• Find the names of suppliers who supply some red part.
• Find the sids of suppliers who supply some red or green part.
• Find the sids of suppliers who supply some red part or are at Hyderabad.
• Find the sids of suppliers who supply some red part and some green part.
• Find the sids of suppliers who supply every red part.
UNIT – III
5 a Consider the following relational schema. An employee can work in more L CO3 [7M]
than 3
one department.
Emp(eid: integer, ename: string, salary: real)
Works(eid: integer, did: integer)
Dept(did: integer, dname: string, managerid: integer, floornum: integer)
Write the following queries in SQL.
i. Print the names of all employees who work on the 10th floor and
make less than $50,000.
ii. Print the names of all managers who manage three or more departments
on the samefloor.
iii. Print the names of all managers who manage 10 or more departments on
the same floor.
iv. Print the names of the departments that employee Santa works in.
v. Print the names and salaries of employees who work in both the toy
department and the candy department.
b Create a trigger on the above Emp table given in Iwhen an updation is L CO3 [3M]
madeonthe salary of the employee and insert the difference of salary in a 1
separate table names SALDIFF. The fields of the SALDIFF table be eid, old
sal, newsal,diff.
(OR)
6 Consider the following schema: L CO3 [10M]
person (driver-id#, name, address) 1
car (license, model, year)
2 of 4
 accident (report-number, date, location)
owns (driver-id#, license)
participated (driver-id, car, report-number, damage-amount)
Keys are underlined. Write the following queries in SQL
i. Find the total number of people who owned cars that were involved
in accidents in 1989.
ii. Find the number of accidents in which the cars belonging to “John Smith”
were involved.

iii. Add a new accident to the database; assume any values for required
attributes.
iv. Delete the Mazda belonging to “John Smith”.
v. Update the damage amount for the car with license number “AABB2000”
in the accident with report number “AR2197” to $3000.
UNIT – IV
7 a Define normalization. Explain various normal forms. L CO4 [6M]
1
b Consider a relation R with attributes ABCDE. Let the following FDs be L CO4 [4M]
given: A -> BC, BC -> E, and E->DA. Similarly, let S be a relation with 3
attributes ABCDE and let the following FDs be given: A -> BC, B -> E, and
E ->DA. Answer the following:
i. Is R in BCNF?
ii. Is R in 4NF?
iii. Is R in 3NF?
iv. Is S in BCNF?
v. Is S in 4NF?
(OR)
8 a Explain various anomalies to be handled by normalization with an example. L CO4 [5M]
3
b Explain Boyce-codd normal form with an example? L CO4 [5M]
1
UNIT – V
9 a S1: r1();r3(Y);r3(X);r2(Y);r2(Z); w3(Y);w2(Z);r1(Z);w1(X);w1(Z) L CO5 [5M]
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z) 2
Analyze which one of the schedules is conflict-serializable?

b Following is the list of events in an interleaved execution is set T1, T2, T3 L CO5 [5M]
assuming 2PL. Is there a deadlock? If yes, which transactions are involved in 1
deadlock?
Time Transaction Code
T1 T1 Lock (A, X)
T2 T2 Lock (B, S)
T3 T3 Lock (A, S)
T4 T1 Lock (C, X)
T5 T2 Lock (D, X)
T6 T1 Lock (D, S)
T7 T2 Lock (C, S)
3 of 4
 (OR)

10 a What is a transaction explain various states of transaction. L CO5 [6M]

2
b Explain the concurrency control technique with time stamp ordering L CO5 [4M]
2

UNIT – VI
11 a Consider a B+-tree in which the maximum number of keys in a node is 5. L CO6 [5M]
Calculate the minimum number of keys in any non-root node? 2
b How does multilevel indexing improve the efficiency of searching an index L CO6 [5M]
file? 2
(OR)
12 a Explain B+ trees? Discuss about this Dynamic Index Structure? L CO6 [5M]
2
b Can we have at most one primary or clustering index on a file, but several L CO6 [5M]
secondary indexes? Justify. 1

*****

4 of 4