DEAR T.E. COMP STUDENTS CLICK HERE TO DOWNLOAD OLD QUESTION PAPERS FOR THE SUBJECT :--- DATA BASE MANAGEMENT SYSTEM OF PUNE UNIVERSITY
Asst. Prof. Dept. of Computer Engg. Matoshri College of Engineering & R. C. Nashik Maharashtra India
19 September 2011
12 September 2011
SPPU ( PUNE UNIV. ) M.E. COMP. ENGG OLD QUESTION PAPERS. 2013 PAT .
Dear M.E. Comp. Engg. candidates Click here to download Pune University Previous year Question Papers M.E. COMPUTER ENGG SEM 1 QUESTION PAPERS
And here are Nov-Dec 2011 Question papers Click To download Dec-2011 papers
If yet download not started then click here Start Download
To download April May 2011 Click Here To Download Question Papers
To download Nov Dec 2011 Click Here to Download Question Papers
To download April May 2013 click to download sppu M.E. Computer Engineering 2013 pat. papers
SPPU ME COMPUTER ENGG SEM 3 ADVANCE UNIX PROG 2013 PAT OLD QUESTION PAPERS
CLICK TO DOWNLOAD SPPU ME COMP 2013 PAT OLD QUESTION PAPER OF ADVANCE COMPUTER ARCH
DOWNLOAD OLD QUESTION PAPERS ME COMP 2013 PAT APPLIED ALGO
HIGH PERFORMANCE DATABASE SYSTEM ( HPDS ) END SEM OLD QUESTION PAPERS
And here are Nov-Dec 2011 Question papers Click To download Dec-2011 papers
If yet download not started then click here Start Download
To download April May 2011 Click Here To Download Question Papers
To download Nov Dec 2011 Click Here to Download Question Papers
To download April May 2013 click to download sppu M.E. Computer Engineering 2013 pat. papers
SPPU ME COMPUTER ENGG SEM 3 ADVANCE UNIX PROG 2013 PAT OLD QUESTION PAPERS
CLICK TO DOWNLOAD SPPU ME COMP 2013 PAT OLD QUESTION PAPER OF ADVANCE COMPUTER ARCH
DOWNLOAD OLD QUESTION PAPERS ME COMP 2013 PAT APPLIED ALGO
HIGH PERFORMANCE DATABASE SYSTEM ( HPDS ) END SEM OLD QUESTION PAPERS
04 August 2011
28 January 2011
27 September 2010
25 September 2010
03 September 2010
01 September 2010
22 July 2010
DATBASE MANAGEMENT SYSTEMS
UNIT I
Q 1) a) How following problems are handled with a DBMS ?
Data isolation, Data redundancy and inconsistency, Data
integrity. M [6]
b) Compare various data models M [8]
c) Explain in brief how EER diagram is converted to tables. M [4]
OR
Q 2) a) Explain components and overall structure of a DBMS. M [10]
b) Explain : Data Independence. M [6]
c) What is referential integrity ? M [2]
Q.3 a) Specify the CODD's norms to be specified by RDBMS. M [6]
b) Explain the concept of generalization and aggregation with suitable
example. M [6]
1 c) Explain with an example how E-R diagrams are converted into tables. M [6]
Q.4 a) Following information is maintained in a library.
Books (Accession – no, Title, author, price, book-type, publisher)
Borrower (Membership-no, Name, Address, Category, Max-no of books
that can be issued, Accession-no of books borrowed)
The following constraints are to be observed
1 i) Each book has unique accession-no.
2 ii) A book may have more than one author.
3 Iii) The category of borrower determines the maximum number of books
4 that may be issued to borrower,
5 iv) There may be more than one copy of a book.
6
7 Identify the entities, relationships and draw E-R diagram which provides
8 for issue and return of a book, fine calculation and claiming of a issued
9 book. M [8]
10
11 b) What is Integrity constrain? Explain referential integrity constraint using
12 on delete casecade clause with suitable example. M [8]
13
14 c) State major responsibilities of DBA. M [2]
15
5. a) Explain various components of DBMS. M [8]
b) Compare DBMS and file processing system with following points:
i) Redundancy ii) Access control. M [4]
c) Specify CODD’S norms to be satisfied by RDBMS. M [6]
6. a) Design a generalization – specialization hierarchy for a motor vehicle sales
Company. The company sells motor cycles, passenger cars, vans and buses.
Justify your placement of attributes at each level of the hierarchy. Explain why
They should not be placed at a higher or lower level. M [6]
b) Give significance of following design constraints.
i) User-defined
ii) Condition-defined
iii) Overlapping
iv) Dis-joint M [8]
c) Explain functions of DBA. M [4]
Q 1) a) How following problems are handled with a DBMS ?
Data isolation, Data redundancy and inconsistency, Data
integrity. M [6]
b) Compare various data models M [8]
c) Explain in brief how EER diagram is converted to tables. M [4]
OR
Q 2) a) Explain components and overall structure of a DBMS. M [10]
b) Explain : Data Independence. M [6]
c) What is referential integrity ? M [2]
Q.3 a) Specify the CODD's norms to be specified by RDBMS. M [6]
b) Explain the concept of generalization and aggregation with suitable
example. M [6]
1 c) Explain with an example how E-R diagrams are converted into tables. M [6]
Q.4 a) Following information is maintained in a library.
Books (Accession – no, Title, author, price, book-type, publisher)
Borrower (Membership-no, Name, Address, Category, Max-no of books
that can be issued, Accession-no of books borrowed)
The following constraints are to be observed
1 i) Each book has unique accession-no.
2 ii) A book may have more than one author.
3 Iii) The category of borrower determines the maximum number of books
4 that may be issued to borrower,
5 iv) There may be more than one copy of a book.
6
7 Identify the entities, relationships and draw E-R diagram which provides
8 for issue and return of a book, fine calculation and claiming of a issued
9 book. M [8]
10
11 b) What is Integrity constrain? Explain referential integrity constraint using
12 on delete casecade clause with suitable example. M [8]
13
14 c) State major responsibilities of DBA. M [2]
15
5. a) Explain various components of DBMS. M [8]
b) Compare DBMS and file processing system with following points:
i) Redundancy ii) Access control. M [4]
c) Specify CODD’S norms to be satisfied by RDBMS. M [6]
6. a) Design a generalization – specialization hierarchy for a motor vehicle sales
Company. The company sells motor cycles, passenger cars, vans and buses.
Justify your placement of attributes at each level of the hierarchy. Explain why
They should not be placed at a higher or lower level. M [6]
b) Give significance of following design constraints.
i) User-defined
ii) Condition-defined
iii) Overlapping
iv) Dis-joint M [8]
c) Explain functions of DBA. M [4]
Subscribe to:
Posts (Atom)