Scribd
Upload
16 views1 page

DM - Model Paper1

This document is a model question paper for a Data Mining course, divided into three parts with varying question formats and marks. Part A consists of short answer questions worth two marks each, Part B includes more detailed questions worth five marks each, and Part C contains in-depth questions worth eight marks each. The questions cover fundamental concepts, algorithms, and techniques related to data mining.

Uploaded by

chandanacmraj1104
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views1 page

DM - Model Paper1

This document is a model question paper for a Data Mining course, divided into three parts with varying question formats and marks. Part A consists of short answer questions worth two marks each, Part B includes more detailed questions worth five marks each, and Part C contains in-depth questions worth eight marks each. The questions cover fundamental concepts, algorithms, and techniques related to data mining.

Uploaded by

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

Model Question Paper -1

DATA MINING

Instructions to Candidates: 1. Answer any Four questions from each part.


2. Answer All Parts
PART-A
I. Answer any Four questions, each carries Two marks. (4x2=8)

1. What do you mean by Data Mining?


2. Define Prediction.
3. Define Regression.
4. What do you mean by outliers?
5. What is Decision Tree?
6. What do you mean by Distributed Algorithm?

PART-B
II. Answer any Four questions, each carries Five marks. ( 4 x 4 = 20 )

7) What are the difference between Data Mining and knowledge discovery in databases?
8) What are the various issues associated with the Data Mining?
9) Write short note on K-Nearest Neighbors algorithm and its applications.
10) Describe in detail one of the Decision Tree Algorithm give examples.
11) Explain Hierarchical clustering in detail.
12) Write short note on Data Parallelism.

PART C
III. Answer any Four questions, each carries Five marks. ( 4 x 8 = 32 )

13) How can you describe Data mining from the perspective of database?
14) Write a short note on Scalable DT techniques.
15) Explain how K-Means Clustering algorithm is working give examples.
16) Write a short note on hierarchical clustering.
17) What do you mean by Large item-sets explain in detail.
18) What is Data Parallelism explain in detail?

You might also like