QUESTION PAPER » CS-06 DATA BASE MANAGEMENT SYSTEM Dec 2001

IGNOU BCA CS-06: DATA BASE MANAGEMENT SYSTEM - DECEMBER 2001 QUESTION PAPER

---

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
December, 2001
CS-06:DATABASE MANAGEMENT SYSTEM

Time : 3 Hours

Max. Marks : 75

---

Note : Question one is compulsory. Answer any three from the rest.

---

Q.1(a). Design a Relational database to the E- R diagram given below:

--DIAGRAM IS NOT AVAILABLE--

Tabular representation of the Relational Database for the above E-R Diagram

Entities and its Attributes :

(b) Explain the following general integrity rules of Relational Mode:
(i) Entity Integrity
(ii) Referential Integrity

(c) For the relations P and Q, perform the following operation:

(i)Find the projection of Q on the attributes (B,C)
(ii) Find the natural join of P and Q on the common attributes.

(d)Write short notes on:
(i) Object oriented databases
(ii) Specialization
(iii) Generalization
(iv) Data independence
(v) Query processor

Q.2(a). Explain the distinction between the representation of association and relationship in the network and hierarchical models.

(b) Explain why navigation is simpler in the relational model than in the hierarchical data model.

Q.3. Discuss the differences between the following file organization.

(a) Serial
(b) Index-Sequential
(c) Hashed
(d) Inverted

Comp are their storage and access efficiencies- To what type of application is each of the organisations suited?

Q.4(a). What are the advantages of normalised relations over unnormalised relations?

(b) Why is 4 NF preferable to BCNF ?

(c) Explain the design goals of a good relational database design.

Q.5(a). Explain how the knowledge representation is done through Semantic Network.

(b) Discuss the basics of Client-server computing paradigm.

(c) Explain Dynamic Data Exchange and Remote Procedure Call.