Scribd
Upload
10 views2 pages

Data Mining

The document discusses a university exam for a data mining course. It covers topics like data integration, OLAP vs OLTP, bitmap indexing, association rules, information gain, clustering applications, density reachability, image retrieval signatures, and challenges of knowledge discovery on the web. The exam has three parts - short answers worth 20 marks, longer answers worth 30 marks, and two essay questions worth 30 marks each.

Uploaded by

rickcxavier
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
10 views2 pages

Data Mining

The document discusses a university exam for a data mining course. It covers topics like data integration, OLAP vs OLTP, bitmap indexing, association rules, information gain, clustering applications, density reachability, image retrieval signatures, and challenges of knowledge discovery on the web. The exam has three parts - short answers worth 20 marks, longer answers worth 30 marks, and two essay questions worth 30 marks each.

Uploaded by

rickcxavier
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

22100897

QP CODE: 22100897 Reg No : .....................

Name : .....................

B.Sc / BCA DEGREE (CBCS) REGULAR / REAPPEARANCE EXAMINATIONS,


APRIL 2022
Sixth Semester
Choice Based Core Course - CS6CBT02 - DATA MINING
Common for B.Sc Information Technology Model III, Bachelor of Computer Applications & B.Sc
Computer Applications Model III Triple Main
2017 Admission Onwards
A005DB7E

Time: 3 Hours Max. Marks : 80


Part A
Answer any ten questions.
Each question carries 2 marks.

1. What is a multimedia database?

2. Name different methods by which a classification model can be represented.

3. What is numerosity reduction?

4. What is an operational database?

5. What is market basket analysis?

6. Mention 4 applications of classification and prediction.

7. What do you mean by accuracy of a rule?

8. What is regression?

9. What do you mean by agglomerative approach in hierarchical clustering?

10. Differentiate bottom-up and top-down strategy in hierarchical clustering.

11. What is spatial autocorrelation?

12. What is Information Retrieval in text mining?


(10×2=20)

Page 1/2 Turn Over


Part B
Answer any six questions.
Each question carries 5 marks.

13. Explain the concept of data integration.

14. Differentiate between OLAP and OLTP.

15. Explain bitmap indexing of OLAP data.

16. Differentiate single dimensional and multi-dimensional association rules with examples.

17. Explain how to calculate information gain with an example.

18. Explain the applications of clustering.

19. Explain the concept of direct and indirect density reachability.

20. Explain various similarity-based retrieval in image databases based on image signature.

21. Explain the challenges in knowledge discovery in WWW.


(6×5=30)
Part C
Answer any two questions.
Each question carries 15 marks.

22. Explain various data mining task primitives.

23. With a diagram, explain the three-tier architecture of a data warehouse.

24. Explain the need for correlation analysis in association rule mining.

25. Explain with an example the K-medoids algorithm.


(2×15=30)

Page 2/2

You might also like