Database Management Systems (DBMS) Question Answers - 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 relational 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.

————————

 

Advanced Database Management - BE - IT - Pune University Question Answers 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]

*******************

 

Go back to Pune University Question Papers page

Advanced Database Management - Pune University Question Answers 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]-240

B. E. (Computer Engineering) - 2014

ADVANCED DATABASES

(2008 Pattern)

[Time : 3 Hours]                                                                [Max. Marks : 100]

[Total No. of Questions : 12]                                     [Total No. of Printed Pages :3]

Instructions :

(1) Answers three questions from section I and three questions from section II

SECTION-I

Q1. a) For each of the three partitioning techniques, namely round-robin, hash partitioning, and range partitioning, give an example of a query for which that partitioning technique would provide the fastest response. [6]

b) Write a short note on parallel hash join. [5]

c) What is interquery parallelism? Explain cache coherency problem and protocol available to guarantee cache coherency. [6]

OR

Q2. a) Explain parallel external sort merge. [6]

b) Explain design issues in parallel database systems. [6]

c) What factors could result in skew when a relation is partitioned on one of its attributes by hash partitioning and range partitioning. In each case, what can be done to reduce the skew? [5]

Q3. a) If we are to ensure atomicity, all the sites in which transaction T executed must agree on the final outcome of the execution T must either commit at all sites or it must abort at all sites. Describe the technique or protocol used to ensure this property in detail. [7]

b) Explain how the following differ; Fragmentation transparency, replication transparency, and location transparency. [6]

c) Describe and compare homogeneous and heterogeneous databases with respect to distributed databases. [4]

OR

Q4. a) Explain the following with respect to robustness of distributed databases. [8]

i) Coordinator selection.

ii) Majority based approach.

b) Explain network partition with respect to distributed databases. [5]

c) What are the different approaches to store a relation in the distributed database. Explain them in brief. [4]

Q5. a) Write short notes on: [8]

i) SOAP

ii) Client-Server architecture

b) Explain the structure of XML data with example.  [8]

OR

Q6. a) Explain the following with respect to web architecture. [8]

i) Web server

ii) Common gateway interface

iii) Cookie

iv) Uniform resource locator.

b) Explain XML parsers in detail. [8]

SECTION II

Q7. a) What is data warehouse? What is the difference between data warehouse and operational database system? [9]

b) Explain the following; [8]

i) Data cube

ii) OLAP

OR

Q8. a) Discuss the different data smoothing techniques. [8]

b) Suppose a group of 12 sales price records has been sorted as follows; [4]

5, 10, 11, 13, 15, 35, 50, 55, 72, 92, 204, 215

Partition them into three bins by each of the following methods;

i) Equal-frequency (equidepth) partitioning

ii) Equal-width partitioning

c) Write short note on data mart. [5]

Q9. a) Explain in detail classification and prediction. [8]

b) Explain Apriori algorithm with example. [9]

OR

Q10.a) Consider the following training set. [9]

Write ID3 classification algorithm. Construct a decision tree based on above training set using ID3.

b) What are Bayesian classifiers? [2]

c) Explain K-mean algorithm with example. [6]

Q11. a) What is relevance feedback? Explain in brief. [4]

b) Explain in detail information retrieval and structured data. [6]

c) Explain in detail popularity ranking. [6]

OR

Q12. a) What is the difference between a false positive and a false drop? If it is essential that no relevant information be missed by an information retrieval query, is it acceptable to have either false positives or false drops? Why? [4]

b) Explain in detail web search engines. [6]

c) Explain the following terms with examples w.r.t IR. [6]

i) Homonyms

ii) Synonyms

iii) Proximity

*******************

Go back to Pune University Question Papers page