CS-06 December, 2004 Question Paper

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

---

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination 

December, 2004

 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) Explain the various components of a database management system with the help of a diagram.
Below is the diagram of various components of DBMS :

(b) Define 2NF and 3NF. Normalize the following table to 3NF.

(c) Design an E-R diagram for an Airlines Reservation System consisting of flights, airports, fares, reservations, tickets, crew and passengers. Clearly indicate the entities, relationships and the key constraints.

(d) Explain three levels of architecture of a DBMS with the help of a diagram.

(e) Explain the concept of frame based representation with the help of an example showing the frames and facts/slots.

Q.2(a) Explain the evolution of client/server computing. Also describe its components.

(b) Give the structure of a distributed database system with the help of a diagram. Also give its trade-offs. List two distinct applications where we can use the distributed databases.

Q.3(a) Explain an Object Oriented Database Management System. What are its applications? Also list the alternatives OODB strategies.

(b) Discuss the Relational Model of DBMS. How is it differenl from other models? List at least two types of applications which suit this model.

Q.4(a) Consider the relations :

BRANCH (Branch_Name, City, Branch_Amount)
ACCOUNT (Branch_Name, Account_No, Balance)
CUSTOM ER (Account_No, CustomerJSame)

Write the SQL statements for the following :

(i) Find all the customers who have an account of all the branches located in “Chandigarh".
(ii) Find accounts of the “Model Town” branch having a balance greater than Rs. 50,000.
(iii) Find BranchJSame and Amount of city “Delhi".
(iv) Find AccountJVo, CustomerJSame and Balance of the branch name “Model Town".

(b) Give the step by step procedure for the implementation of Indexing through M-Way search tree with the help of an example.

Q.5(a) Explain the difference between Cartesian Product and Natural Join Operations with examples.

(b) Explain Multilist file organization and Inverted file organization with examples. Also give the comparison and trade off in the design of Multikey file.

Q.6(a) What is a view? What are the major advantages of views? Explain with an example.

(b) What are the main differences between a file processing system and a database system?

(c) What is a knowledge based system? Give at least three differences between a knowledge based system and a database system.