Showing posts with label Pune University Questions. Show all posts
Showing posts with label Pune University Questions. Show all posts

Saturday, May 7, 2016

Advanced Database Management - Pune University Question Nov Dec 2014

Pune University BE(CSE) Question Papers / Previous year BE(Computer Engg.) question papers of Pune University / BE CSE Advanced Databases Question Paper / Pune University Questions with Answers

 

UNIVERSITY OF PUNE
[4659]-207
B. E. (IT) Examination - 2014
ADVANCED DATABASE MANAGEMENT
(2008 Pattern)
[Time : 3 Hours]                                                                [Max. Marks : 100]
[Total No. of Questions : 12]                                     [Total No. of Printed Pages :3]
Instructions :
(1) Answers to the section should be written in separate books
(2) Neat diagrams must be drawn wherever necessary.
(3) Assume suitable data, if necessary.
(4) Section I :Q1or Q2, Q3 or Q4, Q5 or Q6
(5) Section II: Q7 or Q8, Q9 or Q10, Q11 or Q12

SECTION-I
Q1. a) What is cursor? Explain with diagram the different types of cursor. [8]
b) Explain the PL/SQL block structure in detail. [8]
OR
Q2. a) What is trigger? Write the trigger for updating the records in the database. [8]
b) Explain embedded SQL and dynamic SQL. [8]

Q3. a) Explain the architecture of transaction processing monitor. [8]
b) Explain two-phase locking with example. [10]
OR
Q4. a) Explain ACID properties. [4]
b) Explain real-time transaction systems. [4]
c) What are the different types of concurrency control? Explain any one in detail. [10]

Q5. a) Discuss the table inheritance in SQL. [4]
b) Consider the database schema with a relation University whose attributes are as shown below; with types specified for multi-valued attributes. [12]
Staff(sname, Department set multiset(department), subject set multiset(subjects)).
Department = (name, joining date)
Subjects = (type, exam set of (exams))
Exams = (year, place)
i) Define the above schema in SQL:2003 with appropriate types for each attribute.
ii) Using database schema in SQL:2003, write the following queries;
1. Find name of all staff who have joined after January 2013.
2. List all subjects in the relation University. 
OR
Q6. a) Explain document type definition. Describe a DTD with suitable example for an XML. [8]
b) Write the applications of XML. [4]
c) Differentiate object oriented (OO) and object relational (OR) databases. [4]

SECTION II
Q7. a) Explain in detail the data warehouse architecture. [8]
b) Write short notes on the following; [10]
i) Online transaction processing
ii) Data warehouse data house
iii) Dimensionality modeling in data warehouse
iv) Data warehouse using Oracle
v) Data marts
OR
Q8. a) Explain the functions of Administration & Management toos in data warehouse. [10]
b) Explain the approaches taken by vendor to provide data extraction, cleansing, and data transformation tools. [8]

Q9. a) Write the algorithm for K-Mean data mining. [8]
b) Describe the characteristics of multi-dimensional data and how this data can be represented? [8]
OR
Q10.a) Write short notes on the following; [8]
i) OLAP benchmarks
ii) Applications and benefits of OLAP
iii) Bayesian classifier
iv) Predictive modeling
b) Discuss OLAP functionality provided by ROLLUP and CUBE of SQL standard. [8]

Q11. a) Write the types of locks. [4]
b) Explain exception handlers in Oracle. [4]
c) Explain implicit and explicit locking in Oracle. [8]
OR
Q12. a) Write notes on database security and threats. [8]
b) Explain the authorization and access control for providing security for database. [8]
*******************
 







Sunday, September 13, 2015

Database Management Systems (DBMS) Question - Pune University May 2013

Database Management Systems (DBMS) Question - Pune University May 2013 / Pune University BE (CSE) and BTech (IT) DBMS Question - May 2013


UNIVERSITY OF PUNE
[4363] – 251
T.E. (Computer & IT Semester – I) Examination, 2013
DATABASE MANAGEMENT SYSTEMS
 (2008 Pattern)
Time: 3 Hours                                           Max. Marks: 100
Instructions : 1) Answers to the two Sections should be written in separate books.
2) Black figures to the right indicate full marks.
3) Assume suitable data, if necessary.
4) Solve Section I: Q 1 or Q 2, Q 3 or Q 4, Q 5 or Q 6.
5) Solve Section II: Q 7 or Q 8, Q 9 or Q 10, Q 11 or Q 12.
SECTION – I
Q1) A) How following problems are handled with DBMS. [6]
i. Data Isolation
ii. Data Redundancy and Inconsistency
iii. Data Integrity
B) Explain with examples how ER diagrams are converted into tables. [6]
C) Explain the need of the following. [6]
i. View       ii) Foreign Key.
OR
Q2) A) Explain various database languages. [8]
B) Explain various data models used in DBMS. [10]

Q3) A) Given relation schema: R(A,B,C), S(D,E,F). Let the relation r® and s(S) be given. Convert the following SQL statements in relational algebra form.               [8]
1. select * from r where B = 17;
2. select A, F from r,s where r.C = s.D;
3. update r set B = B*15 where A = ‘aaa’;
4. select * from s where E<20;
B) Explain various operations in relational algebra. [8]
OR
Q4) A) What is Cursor? Explain various types of Cursor. [8]
B) Explain stored procedures and triggers. [8]

Q5) A) Explain why 4NF is more desirable than BCNF. Rewrite the definition of 4NF and BCNF using the notions of domain constraints and general constraints. [8]
B) Specify Armstrong’s axioms. Use Armstrong’s axioms to prove the soundness of pseudo transitivity rule. [8]
OR
Q6) A) Let R=(A,B,C,D,E) and let M be the following set of multi-valued dependencies. [8]
A →→ BC, B →→ CD, E →→ AD.
List the non-trivial dependencies in M+.
B) Describe the concept of Transitive dependency and explain how this concept is used to define 3NF. [8]
SECTION - II
Q7) A) What is ordered indices? Explain the types of ordered indices with suitable example. [9]
B) Explain detail use of B Tree as an indexing technique. Compare B tree and B+ tree. [9]
OR
Q8) A) Explain following: [9]
i. Dense index    ii. Sparse index          iii. Clustered index
B) Give the transformation rules for releational expressions. [9]

Q9) A) Explain the concept of ‘Transaction’. Describe ACID properties for transaction. [8]
B) Show the two phase locking protocol ensures conflict serializability. [8]
OR
Q10) A) Explain timestamp based protocol. [8]
B) State and explain Thomas Write rule. [8]

Q11) A) How does the concept of an object in the object oriented model differ from the concept of an entity in the ER model. [8]
B) Explain the need of backup and replication. [8]
OR
Q12) A) What is fragment of a relation? What are main types of fragments? [8]
B) Write short note on:
i. Data warehouse manager
ii. Pointers swizzling techniques.

————————


 

Saturday, April 25, 2015

Database Management System Question - Pune University December 2012

Database Management System Question - Pune University December 2012 / DBMS Computer Engineering Question of Pune University / DBMS for BE-BTech CSE and IT of Pune University


[4263] – 341
T.E. (Computer / IT Engg.)

DATABASE MANAGEMENT SYSTEMS

(2008 Pattern) (Semester - I)
Time : 3 Hours                                                             Max. Marks : 100
Instructions : i) Answers to the two Sections must be written in separate books.
ii) Neat diagrams must be drawn whenever necessary.
iii) Assume suitable data if necessary.
iv) Solve Section I : Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6.
v) Solve Section II : Q.7 or Q.8, Q.9 or 10, Q.11 or Q.12.

SECTION – I
Q1) a) Explain various components and database system structure with the help of neat diagram. [10]
b) Explain multi-user DBMS architecture. [4]
c) Specify the CODD’s norms to be specified by RDBMS. [4]
OR
Q2) a) What are the various features of extended E-R diagrams [EER]. Explain in details with the help of example. [10]
b) What is a data abstraction? [4]
c) What is integrity constraint? Explain referencial integrity constraints. [4]

Q3) a) Consider the relational database: [8]
dept (dept_no, dname, LOC)
emp (emp_no, ename, designation)
project (proj_no, proj_name, status)
empproject (emp_no, proj_no)
dept and emp are related as 1 to many
proj and emp are related as 1 to many
Write relational algebra expressions for the following:
i) List all employees of ‘INVENTORY’ department of ‘PUNE’ location.
ii) Give the names of employees who are working on ‘Blood Bank’ project.
iii) Give the name of managers from ‘MARKETING’ department.
iv) Give all the employees working under status ‘INCOMPLETE’ projects.
b) Explain stored procedures and triggers with example. [8]
OR
Q4) a) Explain various join operations with example. [8]
b) What is cursor? Explain various types of cursor. [8]

Q5) a) State and prove Armstiong’s axioms for functional dependencies. [8]
 b) A set of FD’s for the relation R (A, B, C, D, E, F) is AB → C, C → A, BC → D, ACD → B, BE → C, EC → FA, CF → BD, D → E. Find the minimum canonical cover for this set of FD’s. [8]
OR
Q6) a) What is decomposition? Suppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C) and (A, D, E), show that this decomposition is a loseless decomposition if the following set F of functional dependencies holds:
A → BC, CD → E, B → D, E → A. [8]
b) Define Boyce-Codd normal form. How does it differ from 3NF? Why is it considered a stronger form of 3NF? [8]

SECTION – II
Q7) a) Construct a B+ tree for the following set of key values.
(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Assume order of tree is 4. [8]
b) Explain the role of “selection” operation in query processing. [8]
OR
Q8) a) What is ordered indices? Explain the types of ordered indices with suitable example. [8]
b) Explain equivalence rules for query optimization. [8]

Q9) a) Which are different crash recovery methods? Explain any one in detail? [8]
b) What is meant by ‘Transaction’? Explain obstruct transaction model with state diagram. [8]
OR
Q10) a) Explain two-phase locking protocol. How does it ensure resializality? [8]
b) Explain shadow paging recovery and log-based recovery scheme. [8]

Q11) Write a short note on any three: [18]
a) Data warehouse.
b) Association rules for data mining.
c) Distributed database system.
d) Persistent programming languages.
OR
Q12) a) Compare relational model Vs object-oriented model. [6]
b) What is fragment of a relation? What are the main types of fragments? Why is fragmentation a useful concept in distributed database design? [8]
c) Explain the need of backup and replication. [4]


——————




Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents

data recovery