0% found this document useful (0 votes)
48 views1 page

Data Warehousing and Data Mining (CSE)

Dwdm

Uploaded by

yisexif547
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)
48 views1 page

Data Warehousing and Data Mining (CSE)

Dwdm

Uploaded by

yisexif547
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/ 1

Code: CS20APE502 R 20

B.Tech III Year I Semester Supplementary Examinations May - 2024


DATA WAREHOUSING AND DATA MINING
(Computer Science & Engineering)
Time: 3 hrs. Max Marks: 60
PART-A
(Compulsory Question)
1. Answer the following 05 x 02 = 10 Marks

a) Differentiate the transactional data and Data warehouse. 2M


b) What is use of Dimensionality reduction? 2M
c) Define Join and Prune Steps. 2M
d) What is a Back Propagation? 2M
e) What is the importance of Weka tool 2M
PART-B
Answer All five Units 05 x 10 = 50 Marks
UNIT-I
2. a) Discuss about Star schema and Snowflake schema. 5M
b) Compare OLAP & OLTP systems. 5M
OR
3. Demonstrate the multi-tier architecture suitable for evolving a data warehouse with 10 M
appropriate diagram.
UNIT-II
4. a) Classify the different types of data on which Mining can be performed. 5M
b) List and describing the motivating challenges of data mining. 5M
OR
5. Elaborate the measuring Data Similarity and Dissimilarity. 10 M
UNIT-III
6. What are the various Constraints in Constraint based Association rule mining? 10 M
Explain.
OR
7. State FP-growth algorithm for discovering frequent item sets without candidate 10 M
generation with an example.
UNIT-IV
8. a) Develop the decision tree induction algorithm for classifying data tuples and with 5M
suitable example.
b) Illustrate the k-Nearest-Neighbor Classifiers. 5M
OR
9. a) List out Outlier Detection Methods and explain. 5M
b) How to cluster high dimensional database and discuss? 5M
UNIT-V
10. Describe about weka learning algorithms. 10 M
OR
11. Illustrate the Breast cancer database. 10 M
*****

You might also like