Scribd
Upload
16 views3 pages

GITAM School of Technology Hyderabad Campus

Uploaded by

rajashekargaripelly1
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
16 views3 pages

GITAM School of Technology Hyderabad Campus

Uploaded by

rajashekargaripelly1
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

GITAM School of Technology

Hyderabad Campus

Mid 2Examination
Programme : B.Tech Branch: CSE-CS(SET 3)
Sub Code : CSEN2061
Sub Name : Database Management System
Semester : VI
Year : 2023-24
Date:04/04/24
Maximum Marks: 15
SECTION – A
(Short Answer Questions for 1 mark)
Q.No. Question Marks
1 Consider the following schema
Instructor(id,name,dept_name,salary)
Write the following queries in DRC
1M
a)Find the instructor id,name,dept_name and salary whose salary is greater than
80000
b)Find all instructor id for instructors whose salary is less than 20000

2 List all functional dependencies satisfied by the relation of the figure given below
Rollno Name Cid Marks
101 Anu C01 78 1M
102 Suresh C02 67
103 Raja C02 47
104 Anu C01 78
3 What normal form the relation Contacts (Contact_Id, Contact_name,
Company_name, Company_location, phone_number) is in? decompose the 1M
relation into sub relations that preserve 4 NF.
4 Consider the following transaction

1M

Identify the conflict present in the transaction and justify your answer
5 Wait for graph for the transaction P1,P2,P3,P4,P5 in the given diagram below 1M
What will be the result of executing these transactions? Justify your answer.

SECTION – B
Answer any 2(Two) questions, each question carries 5 Marks each

Q.No. Question Marks


2 Suppliers(sid: integer, sname: string, address: string) Parts(pid: integer, pname: string,
color: string) Catalog(sid: integer, pid: integer, cost: real)
State what the following queries compute

3M

Check the Equivalence of a Pair of Sets of Functional Dependencies:


Consider the two sets F and G with their FDs as below: 2M
1. F : A→ C, AC→ D, E→ AD, E→ H
2. G: A→ CD, E→ AH
3 For a relation schema R = (A, B, C, D, E), consider the following set of functional
dependencies;
F = {A → BC, CD → E, B → D, E → A} 3M
Using the functional dependencies compute the canonical cover Fc.

Check whether the decomposition of R into D is preserving dependency: 2M


R(ABCDE): F = {A→ BC, CD→ E, B→ D, E→ A}. D = {ABCE, BD}
4
Consider the following schedule S involving five transactions T1, T2, T3, T4 and T5:

3M

Check whether the given schedule S is conflict serializable or not. If yes, then
determine all the possible serialized schedules

Consider two schedules S1 and S2 as follows, where S denotes a shared mode lock
and X denotes an exclusive mode lock.

2M

Identify the correct statement from the following which relates to whether the
schedules are deadlock free. Please note that if any schedule suffers from deadlock.

You might also like