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
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.
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
No comments:
Post a Comment