Hall Ticket No Question Paper Code: ACS005
INSTITUTE OF AERONAUTICAL ENGINEERING
(Autonomous)
B.Tech IV Semester End Examinations (Supplementary) July, 2018
Regulation: IARE R16
DATABASE MANAGEMENT SYSTEMS
Time: 3 Hours Max Marks: 70
Answer ONE Question from each Unit
All Questions Carry Equal Marks
All parts of the question must be answered in one place only
UNIT I
1. Discuss about the roles of DBA. Does DBA understand about Query optimization?
What are the types of Data Independencies? Discuss in detail
2. Depict and explain Database System Environment .
What is Aggregation? Explain by considering 'INTERVIEW'example.
UNIT II
3. Define a Tuple Relation Calculus and Explain the procedure for obtaining the names of employees
having salary more than fifty thousand and certified
Consider the following relation
Flights(flno: INTEGER, from: STRING, to: STRING, distance: INTEGER, departs: TIME,
arrives: TIME)
Aircraft(aid: INTEGER, aname: STRING, cruisingrange: INTEGER)
Certified(eid: INTEGER, aid: INTEGER)
Employes(eid: INTEGER, ename: STRING, salary: INTEGER)
How the statement 'the eids of pilots certified for some Boeing aircraft'can be represented in the
form of Relational Algebra and Tuple Relational Calculus from the above relations.
4. Write the Domain Relational Calculus and Tuple Relational Calculus statements for 'the names
and their salaries of pilots certified for some Boeing aircraft' by using above relations.
Are Set theory operations like UNION, INTERSECTION, MINUS useful in Relational Algebra?
Discuss.
UNIT III
5. Discuss about SELECT FROM WHERE structure in SQL with an example.
Discuss about
i. 1st Normal form
ii. 2nd Normal form
iii. 3rd Normal form
Page 1 of 2
6. Write the SQL query for using Supplier Relations and write the SQL statements for the following
queries
i)Find pairs of sids such that the supplier with the first sid charges more for some part than the
supplier with the second sid.
ii)Find the sids of suppliers who supply some red part and some green part
Explain the Key constraints Primary Key ii) Foreign Key with examples.
UNIT IV
7. During its life time a transaction moves from one state to another. Explain this transition of a
transaction with a neat diagram.
Three transactions T1 ,T2 and T3 given below
T1:

T3: And Schedule

Is the schedule S conflict serializable? Explain your answer.
8. Explain Timestamp ordering Concurrency control technique with example.
With a neat diagram explain NO-UNDO/REDO recovery mechanism in transaction processing.

UNIT V
9. Explain the techniques for allocating file blocks on disk.
Explain internal hashing technique with an example.
10. What does it mean to say that a page is pinned in the buffer pool? Who is responsible for pinning
pages? Who is responsible for unpinning pages?
What is the minimum space utilization for tree index?