Madras University (UnOM) 2006 B.C.A Computer Application DataBase Management System - Question Paper

Time: 3 hours
Maximum: 100 marks

PART A - [10 x two = Marks20]
ans ALL ques..
All ques. carry equal marks.

1. What is Database Management System?

2. What is canonical schema?

3. List down the area characteristics of DDL.

4. What is Data Independence?

5. Define:
(a) Paging
(b) Staging.

6. elaborate homogeneous and heterogeneous trees?

7. Mention the objectives of storing the relationships separately from data.

8. elaborate triad queries?

9. How do you measure the hit rate?

10. Name the 4 levels of storage hierarchy.

PART B - [5 x seven = Marks 35]

ans ALL ques..
All ques. carry equal marks.

11. (a) discuss the 4 major components of a database system.
Or
(b) What is functional dependency? discuss with examples.

12. (a) With an example discuss how can a plex structure be normalized.
Or
(b) elaborate the different kinds of entries in which a schema is written in the CODASYL DDL.

13. (a) Distinguish ranging from the logical and physical organization of data.
Or
(b) elaborate pointers? discuss its advantages and disadvantages.

14. (a) Write short notes on multiple key retrieval.
Or
(b) define indexed sequential access method with suitable examples.

15. (a) What is data compactness? How is it achieved?
Or
(b) discuss any 3 memory replacement algorithms.

PART C - [3 x 15 = Marks 45]

ans any 3 ques..
All ques. carry equal marks.

16. What is a binary tree? discuss how a binary tree can be represented as an array.

17. List and discuss the primary objectives of a Database Management System.

18. describe three NF. provide an example of a relation which is not in three NF and show how it is converted into three NF.

19. What is addressing? discuss any 5 addressing techniques.

20. Write short notes on:

(a) Virtual memory.
(b) Database security.

Earning:   Approval pending.