Scribd
Upload
76 views2 pages

DWDM - External Imp Q's

Uploaded by

anala.lasya
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
76 views2 pages

DWDM - External Imp Q's

Uploaded by

anala.lasya
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

DWDM External Important Questions

UNIT –1
1. Define DataWarehouse.Explain the three tier Data Warehouse architecture with neat
diagram.
2. Illustrate Schemas available in Multidimensional Data model with neat sketch.
3. Explain different OLAP operations in multidimensional data.
4. Compare OLAP and OLTP.
5. Define data mining. Discuss in detail about the steps of knowledge discovery?
6. Outline Applications of Data Mining.
7. What are the major issues in Data Mining? Explain briefly.
8. Explain kinds of Patterns can be mined? (or) Explain Data Mining Functionalities?

UNIT– 2
1. Explain different data preprocessing techniques.
2. Data Cleaning and its methods,Data Integration.

3. Data Transformation(Normalization) and its techniques.


4. Data Reduction and its methods.
5. Describe the problem of data quality with some examples. Explain the usage of feature
subset selection in data pre-processing.
6. Attribute and its types.
7. Similarity and dissimilarity.
8. Describe Data Visualization Techniques.

UNIT – 3
1. Define Classification. General approach to solve a classification problem (Steps in Data
Classification).
2. Explain Induction and deduction tasks in classification.
3. Illustrate Decision tree algorithm with an example(Any Training Data Set will be given;
You have to classify the data set according to Decision Tree algorithm-ID3,HUNT’s).
4. Explain Attribute Selection Measures with example (Information Gain, Gain Ratio,Gini
index).
5. Describe Model Overfitting (Tree Pruning) in Classification.
6. Explain Scalability for Decision Tree Induction.
UNIT– 4
1. Define Association and explain market basket analysis in detail.
2. Define Frequent itemset, Support, Confidence in detail.
3. Describe Apriori algorithm with an example. ( join and prune steps also)
4. Explain Frequent Pattern(FP) growth algorithm with an example.
5. Compact Representation of Frequent Item Sets.
6. Any Transaction data will be given. You have to apply apriori and FP growth algorithms/
Apriori algorithm.

UNIT– 5
1. Define Cluster and importance of cluster analysis.
2. Discuss Types of Clustering.
3. Illustrate K- means clustering algorithm with an example.
4. Example problems on K- means clustering.
5. Explain Bi-Secting K Means with example

You might also like