a knowledge trading engine...

Rajiv Gandhi Proudyogiki Vishwavidyalaya 2007-2nd Sem M.C.A Computer Aplications .(ester) , e, - university paper

Monday, 28 January 2013 11:05Web

Page 1 of 2

MCA-202
M.C.A.(Second Semester) EXAMINATION, June,2007
DATABASE MANAGEMENT SYSTEM
(MCA-202)
Time : 3 Hours
Maximum Marks : 100
Minimum Pass Marks : 40

Note : Attempt any 5 ques.. All ques. carry equal marks.

1.(a) Differentiate ranging from hierarchical, network and relational models.
(b) describe the concept of aggregation.
(c) discuss distinction ranging from the subsequent :
(i) Disjoint and overlapping contraints of generaliztion and specializtion.
(ii) Total and partial constraints.

2. Consider the subsequent database of supplier parts :
S(SNo.,SName,City,Status)
P(PNo, PName, City,Weight,Color)
SP(SNo,PNo,Qty)
Supplier parts database.
Solve the subsequent queries in SQL and relational algebra.
(i) Get all pairs of suppliers who are located in identical city.
(ii) Get supplier names who do not supply Part P1.
(iii) Get supplier names who supply all the parts.
(iv) Get supplier names who supply at lowest 1 'Blue Part'.
(v) Get supplier numbers for supplier with status value less than the current maximum
status value in 'S' table :
(vi) Get Part no. for all parts supplied by more than once supplier(only SQL).
(vii) Delete all suppliers in 'PARIS'
(viii) Double the status of suppliers in LONDON.
(ix) Write SQL DDL for supplier part database.

3.(a) discuss with examples wherever necessary :
(i) Natural join
(ii) Equi join
(iii) Outer join
(iv) Inner join
(v) Left outer join
(vi) Right outer join
(vii) Theta join
(b) Design a relational database corresponding to the E-R diagram provided ahead.

(c) What is participation role ? What is it necessary to use role names in description of
relationship kind ?

4.(a) Prove that any relation with 2 attributes is in BCNF.
(b) consider Relation R(A, B, C, D,E) and F set of functional dependency :
F{A->BC
CD->E
B->D
E->A}
(i) calculate closure of F i.e. F+.
(ii) calculate closure of B or B+.
(iii) calculate canonical cover of F i.e. Fc.
(c) Prove that functional dependency is also multivalued dependency.

5.(a) Suppose that we decompose the schema :
R=(A,B,C,D,E) into :
(A,B,C)
(A,D,E)
Show that this decomposition is lossless join decomposition and not dependency preserving
if the subsequent FD's hold :
A-> BC
CD->E
B->D
E->A
Also provide non-less and dependency preserving decomposition int three NF.
(b) elaborate trivial and non-trivial functional dependencies ?

6.(a) discuss the structure of B+ trees Construct a B+ tree for the subsequent set of key values :
(2,3,5,7,11,17,19,23,29,31)
(b) discuss multilevel indices. Also discuss secondary indices.

7.(a) discuss the distinction ranging from the terms serial schedule and serializable schedule.
(b) List the ACID properties. discuss the usefulness of every.
(c) discuss distributed database.

8. Write short notes on any 4 of the subsequent :
(i) Data Dictionary (ii) Mapping constraints
(iii) RAID (iv) DBTG model
(v) Transaction management.