0% found this document useful (0 votes)
51 views2 pages

DWDM Question Bank For All Units

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views2 pages

DWDM Question Bank For All Units

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

V.K.R, V.N.B. & A.G.

K COLLEGE OF ENGINEERING: GUDIWADA

DATAWAREHOUSING AND DATAMINING


QUESTION BANK

Unit – 1

1. What is data warehouse? Explain why it is more useful in present


generation?
2. Compare & contrast the difference between OLAP & OLTP?
3. Explain briefly about data warehouse modeling?
4. Explain briefly about data warehouse implementation?

5. What is data mining? Explain the KDD process model in detail?


6. Explain briefly about data mining tasks?
7. Explain architecture of data mining system with neat diagram.
8. Write about different data sources on which data mining can be
done.

Unit – 2
1. Explain data preprocessing in brief manner?
2. Write about various measures of central tendency.
3. Explain the process of data cleaning in detail.
4. Write about data integration and transformation.
UNIT-III

1. a) Explain briefly methods for expressing an attribute test condition.

b) Write about various measures for selecting the best split.

2. Write and explain an Algorithm for Decision tree induction.

3. Explain evaluating the performance of classifier Holdout method, random sub


sampling, cross-validation and bootstrap.

4. What is model over fitting? Briefly explain the reasons for model over fitting.

UNIT-IV

1. Explain Frequent set generation using APRIORI Algorithm.

2. Write and explain FP-Growth algorithm.

3. Explain the process of finding frequent item set without generating candidate set
generation.

4. Define association analysis. Compare various methods of finding frequent item


sets.

UNIT-V

1. a) Explain different types of clustering techniques.

b) Explain different types of clusters

2. Explain K-means algorithm with its strengths and weakness.


3. Explain briefly Bisecting K-means Algorithm.

4. Write and explain DBSCAN algorithm with an example.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy