Madras University (UnOM) 2005 M.Sc Computer Science database management systems - Question Paper

PART A- (5 x two = 10 marks)

ans ALL ques..

All ques. carry equal marks. every ans should not exceed 50 words.



1.Show the basic structure of an SQL expression.

2.Define assertion.

3.Write an advantage of object-relational databases.

4.Distinguish ranging from indexing and hashing technique

5.Define replication.



PART B - (4 x five = 20 marks)



ans any 4 ques..

All ques. carry equal marks.

every ans should not exceed 250 words.



6. lllustrate the domain relational calculus with an example.

7. discuss the different authorization operations in SQL.

8. discuss how inheritance used in object-relational database.

9. discuss about two-phase locking and its implementation

10. elaborate the various forms of schedule equivalence in serializability? discuss.

11. Compare ranging from centralized and client server systems.



PART C - (5 x 10 = 50 marks)

ans ALL ques..

All ques. carry equal marks. every ans should not exceed 500 words.



12.(a) discuss the structure of relational database.

Or

(b) discuss the subsequent operations in relational algebra.

(i) Union operation

(ii) Set operation.

(iii) Division operation.



13. (a) discuss the normalization technique in relational database.

Or

(b) discuss domain constraints and referential integrity.









14. (a) Illustrate the file organization methods with an example.

Or

(b) discuss the functions and procedures in SQL



15. (a) discuss about static hashing technique with an example.

Or

(b) Briefly discuss about join operations in query

processing.



16. (a) discuss parallel architecture system database architecture with neat diagram.

Or



(b) discuss about-distributed data storage.

Earning:   Approval pending.