I CS-15I

MCA (III Year)

Term-End Examination
December, 2009
CT) CS-15 : RELATIONAL DATABASE
Lc) MANAGEMENT SYSTEM
C\J
O
Time : 3 hours Maximum Marks : 75

Note : Question number 1 is compulsory. Answer any three

questions from the rest.

1. (a) Design an ER diagram for managing a study 10

centre of IGNOU. The activities include
student information, programmes on offer,
sale of prospectus, Assignments handling,
conduct of theory and practical sessions and
Academic counsellors' information. Identify
the entities, relationships and also mention
the cardinality in the ER/EER Diagram.

(b) Suppose that we decompose the schema

R = (A,B,C,D,E) into :

(A,B,C,)

(A,D,E)

CS-15 1 P.T.O.
 Show that this decomposition is a lossless
decomposition if the following set F of
functional dependencies holds :

A --> BC

CD --> E

BAD
D

E —> A

(c) Consider the following relations P and Q

21/2)(2=5
P:

EID NAME 1 EID NAME 2

101 Jones 103 Smith
103 Smith 104 Lalonde
104 Lalonde 106 Byron
107 Evan 110 Drew
110 Drew
112 Smith

Perform the following operation on the relation

P and Q

Cartesian Product

Projection of the Cartesian product on

the attribute Name 1.

CS-15
 (d) Given the relational schemes. 5x2=10
ENROLL (S.No., Course-No, Section)
TEACH (Prof-name, Course-No, Section)
ADVISE (Prof-name, S.No.)
PRE-REQ (Course-No, Pre-Course-No)
GRADES (S.No., Course-No, Grade, Year)
STUDENT (S.No. S.Name)
Write the SQL queries for the following :
List all students taking courses with
Smith or Jones.
List all students taking atleast one
course that their advisor teaches.
List all the students who are enrolled
for course-no "101".
List the name of the students enrolled
in the prerequisite course for course-
No. '105'.
(v) List all the professors who teach
course-no "109".

2. (a) Describe briefly the following with respect

to the checkpoints and logs : 5x2=10
Write - ahead log strategy
Transaction - consistent checkpoint
Action - consistent check point
Transaction Oriented check point
(v) Two - phase commit

CS-15 3
 (b) Explain the differences between the 5
file - oriented system and the
database - oriented systems.

3. What do you mean by serializability of 5

schedules ? Explain with example. How it
is different serial schedules.
Find a BCNF decomposition of the following 10
relation scheme (Faculty, Dean,
Department, Chair person, Professor, Rank,
Student). The relation satisfies the following
functional dependencies (and any other that
are logically implied by these) :
Faculty -+ Dean
Dean --> Faculty
Department —> Chair person
Professor Rank, Chair person
Department —> Faculty
Student —> Department Faculty Dean
Professor Rank —> Department Faculty
Give proper explanation for each
decomposition :

4. (a) With the help of an example, explain the 5

Authorization Grant tree and its scope.

CS-15 4 P.T.O.
 What are Statistical Databases ? What is its 5
main objective ? With the help of relevant
examples, explain the uses of them.
Explain the role of join - index with the help 5
of an example. How is it different from
Hash - Index ?

5. Explain the following with the help of suitable

diagram/example if needed. 5x3=15
Database Integrity
Distributed Locking
Tree - Locking Protocol
Buffer Management
(e) Project Join Normal Form

-o0o-

CS-15 5