Annamalai University 2007 B.C.A Computer Application RELATIONAL DATA BASE MANAGEMENT SYSTEMS - Question Paper

Register Number :
Name of the Candidate :
7 two six 1
B.C.A. DEGREE EXAMINATION, 2007
( 2nd YEAR )
( PART - III )
( PAPER - IX )
630. RELATIONAL DATA BASE MANAGEMENT SYSTEMS
( New Regulations )
( Including Lateral Entry )
May ] [ Time : three Hours
Maximum : 100 Marks
PART - A (8 × five = 40)
ans any 8 ques..
All ques. carry equal marks.
1. List the advantages of a DBMS.
2. Can a weak entity set be converted to a
strong entity set ? - discuss.
Turn over
3. Write all the rules for drawing a schema.
4. discuss any 5 relational operations of
relational algebra.
5. discuss the basic structure of QBE with
examples.
6. elaborate the aggregate functions available in
SQL ? - discuss.
7. discuss third normal form with suitable
examples.
8. define the concept of multi - valued
dependency.
9. explain on PL / SQL data kinds.
10. Write short note on PL / SQL blocks.
PART - B (3 × 20 = 60)
ans any 3 ques..
every ques. carries TWENTY marks.
11. (a) describe the primary and secondary keys
of a record. When is a concatenated key
used as a primary key ? What is multiple
key retrieval ?. (5 + two + 3)
(b) discuss the variuos attribute kinds used
in E - R model. (10)
12. (a) Illustrate in detail on tuple relational
calculus. (10)
(b) Construct an E - R diagram for a car -
insurance company. (10)
13. (a) With suitable example, explain how to
add or remove info using QBE.
(10)
(b) discuss how database can be replaced in
SQL. (10)
14. explain Boyce - Cod normal form with example.
(20)
15. (a) discuss Data manipulation in PL / SQL.
(10)
(b) List out the features of PL / SQL. (10)
2 3

Earning:   Approval pending.