DOEACC Society 2007 Advanced Level Course In Computer Science A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS - Question Paper

iii) aggregation
iv) specialization
v) generalization
vi) logical and physical independence
(9+6)

7. Consider a relation TENANT (NAME, CITY, STREET#, APT#, APT-TYPE, RENT, LANDLORD, ADDRESS), Where subsequent functional dependencies hold
APT# STREET# CITY ADDRESS
ADDRESS APT-TYPE
NAME ADDRESS RENT
LAND-LORD APT-TYPE RENT
i) Are the subsequent relation scheme in 3NF?
APARTMENT (APT-TYPE, ADDRESS, RENT)
DWELLER (NAME, ADDRESS, RENT)
ii) What updating and insertion anomalies do you foresee in TENANT, APARTMENT & DWELLER relations.
iii) Do the APARTMENT & DWELLER relations have lossless join?
iv) Find a key of this relation. How many keys does TENANT have?
v) Find the decomposition of TENANT into 3NF having lossless join and preserving dependencies.
(3x5)

8.
a) What is the highest normal form of every of the subsequent relations?
i) R1 (A, B, C) with A?B, A?C, C?B
ii) R1 (A, B, C, D) with A?BC, CD?B
iii) R1 (A, B, C, D, E) with A?BC, E?A, CD?E
Find the candidate keys for every of these relations.




b) Find a 3NF decomposition of the subsequent relation scheme: (Faculty, Dean, Department, Chairperson, Professor, Rank, Student). The relation satisfies the subsequent functional dependencies (and any others that are logically implied by these):

Faculty ? Dean
Dean ? Faculty
Department ? Chairperson
Professor ? RankChairperson
Department ? Faculty
Student ? DepartmentFacultyDean
ProfessorRank ? DepartmentFaculty
(8+7)

9.
a) Define the BCNF? How does it differ from 3NF? Why is it considered a stronger form of 3NF?
b) What is meant by the term heuristic optimization? explain the main heuristic that are applied during query optimization.
c) Can a transaction be aborted? discuss in brief.
(5+5+5)

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

NOTE:
1. There are 2 PARTS in this Module/paper. PART 1 contains 4 ques. and PART 2 contains 4 ques..

2. PART 1 is to be answered in the TEAR-OFFANSWER SHEET only, attached to the ques. paper, as per the instructions contained therein. PART 1 is NOT to be answered in the ans book.

3. Maximum time allotted for PART 1 is 1 HOUR. ans book for PART 2 will be supplied at the table when the ans sheet for PART 1 is returned. However, candidates who complete PART 1 earlier than 1 hour, can collect the ans book for PART 2 immediately after handing over the ans sheet for PART ONE.

Earning:   Approval pending.