Andhra University 2003 M.Sc Computer Science RELATIONAL DATABASE MANAGEMENT SYSTEMS - Question Paper

M.Sc. DEGREE exam March/April 2003

Third Semester Computer Science

RELATIONAL DATABASE MANAGEMENT SYSTEMS


Time: 3 hours
Maximum: 75 marks
First ques. is compulsory.

ans any 4 from the remaining ques..
All ques. carry equal marks.

Write all bits of the 1st ques. at 1 place.

1. (a) Instances and schema
(b) Static hashing
(c) Magnetic disks
(d) ISBL.

2. (a) elaborate the purposes of a database system?

(b) discuss the mapping cardinalities.

3. (a) discuss the file organisation for fixed-length records.

b How do you organise file based on hashing?

4. (a) define the structure of a B" -tree.

(b) discuss the concept of linear splitting.

(a) Design a relational database for a University registrar's office. The office maintains data about affiliated colleges, their departments, students enrollment and staff strength

(b) discuss 2 reasons why null values might be introduced into the database.

6. (a) explain functional dependency concept along with its implications.

(b) elaborate the pitfalls in relational database design?

7. (a) Suppose that we decompose the schema

R = (A, B, C, D, ED into
(A, B, C)
(A, D, E).

Show that the decomposition is a loss less join decomposition if the subsequent set F of functional dependencies holds
A -> BC
CD -> E
B -> D
E -> A

(b) Compare the 2 normal forms for relational database schemes: 3NF and BCNF.

8. (a) discuss different forms of authorization on parts of database.

(b) What benefit is given by strict 2 phase locking? What disadvantages result?

Earning:   Approval pending.