Amrita Vishwa Vidyapeetham 2007 M.Sc Computer Science Relational Database Management Systems - Question Paper

M.Sc. May 2007
Relational Database Management Systems
Time : 3 hours Maximum : 100 marks
PART A — (10 ? three = 30 marks)
ans ALL ques..
1. What do you mean by physical data independence?
2. Distinguish ranging from procedural DML and non procedural DML.
3. What is Candidate key?
4. Give an example for division operation.
5. How do you describe tuple variable in SQL?
6. Can you check whether a subquery has any tuples in its result? How?
7. What is multivalued dependency?
8. State any 3 Armstrong’s axioms.
9. Define : Encryption.
10. List any 3 authorizations and specify their features.
PART B — (4 ? 10 = 40 marks)
ans any 4 ques..
11. What are the main differences ranging from a file-processing system and a database management system?
12. Let R = (A, B, C) and let and both be relations on scheme R. provide an expression in the domain relational calculus that is equivalent to :
(a)
(b)
(c)
(d)
(e)
13. Explain predicates, Joins and trend matching operations in SQL with suitable examples.
14. Explain Insertion and deletion anomalies with suitable example.
15. Write a note on security specification in SQL.
PART C — (2 ? 15 = 30 marks)
ans any 2 ques..
16. (a) List the major that need to be taken in setting up a database for a particular enterprise.
(b) What are the 4 various relationship sets? discuss how primary keys help us to represent such relationship sets in the relational model.
17. (a) Consider suitable relational database. provide an expression in
(i) SQL
(ii) QBE
for any 2 suitable queries chosen on your own.
(b) Mention the problems in database design and discuss.
18. (a) Explain any 2 Encryption and decryption techniques with suitable examples.
(b) Explain the functions of database administration

Earning:   Approval pending.