Code No: 157BC R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B. Tech IV Year I Semester Examinations, July/August - 2022
DATA MINING
(Common to CSE, IT)
Time: 3 Hours Max.Marks:75
Answer any five questions
All questions carry equal marks
---
JN
1.a) Write short notes on data mining task primitives.
b) Discuss in detail about data preprocessing. [7+8]
TU
2. Explain the following:
a) Integration of data mining system with a data warehouse.
b) Classification of data mining systems. [7+8]
H
3.a) How do you find frequent patterns in data mining? Explain.
b) Explain constraint based association mining. [7+8]
U
4.a) What are the measures of association rule mining? Explain.
b) Write short notes on SPM. [8+7]
se
5.a) Compare the methods of classification and prediction.
b) How to evaluate performance of classification model? Explain. [7+8]
d
6. Discuss in detail about rule-based classification. [15]
Pa
7.a) Explain K-means algorithm with an example.
b) What are the key issues in hierarchical clustering? [9+6]
pe
8. Explain the following:
a) Spatial data mining.
b) Mining sequence patterns in transactional databases. [7+8]
rs
---oo0oo---
Code No: 157BC R18
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech IV Year I Semester Examinations, January/February - 2023
DATA MINING
JN
(Common to CSE, IT, ITE)
Time: 3 Hours Max. Marks: 75

Note: i) Question paper consists of Part A, Part B.

TU
ii) Part A is compulsory, which carries 25 marks. In Part A, answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks
and may have a, b as sub questions.
H
PART – A
(25 Marks)
U
1.a) What is data warehouse? [2]
b) List out the applications of data mining. [3]
se
c) What is meant by association rule mining? [2]
d) Write a short note on SPM algorithm? [3]
e) Why are decision trees useful? [2]
d
f) List the advantages of using decision trees. [3]
g) Discuss the two approaches to improve quality of hierarchical clustering. [2]
h) List the applications of cluster analysis. [3]
pa
i) Define data stream mining. [2]
j) Give the taxonomy of web mining. [3]
pe
PART – B
(50 Marks)

2.a) Explain how to integrate data mining system with a data warehouse.
rs
b) “Data preprocessing is necessary before data mining process”. Justify your answer. [5+5]
OR
3.a) Differentiate between data mining and data warehouse.
20
b) Discuss the major issues in data mining. [5+5]

4.a) Write a short notes on constraint based association mining.

b) Describe various types of association rules. [5+5]
23
OR
5. Explain in detail about frequent pattern mining in data mining. [10]
6. Describe Bayesian Belief Network with an example. [10]
OR
7.a) Briefly explain classification problems and general approaches to solve them.
b) Explain the merits and de-merits of the lazy learning method. [5+5]
8. Explain the following.
a) Cluster analysis.
b) Grid–based methods. [5+5]
OR
JN
9.a) How density based method is used for clustering?
b) Illustrate K-mean algorithm with an example. [4+6]

10. Explain the following.

TU
a) Spatial data mining.
b) Text mining. [5+5]
OR
11. Discuss various kinds of patterns to be mined from web/server logs in web usage mining.
H
[10]
U
se
---ooOoo---
d
pa
pe
rs
20
23
Code No: 157BC R18
JN
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech IV Year I Semester Examinations, February/March - 2022
DATA MINING
TU
(Common to CSE, IT)
Time: 3 Hours Max. Marks: 75
Answer any Five Questions
All Questions Carry Equal Marks
---
H
1. Explain the need of data preprocessing and various forms of preprocessing. [15]
U
2. What is a data warehouse? Demonstrate integrating data mining system with a data
warehouse with a neat diagram. [15]
se
3. Apply FP-Growth algorithm to the following data for finding frequent item sets, consider
support threshold as 30%. [15]
d
TID List of ItemIDs
1 I1, i2, i4, i5
Pa
2 I2, i4, i7
3 I2,i3,i4,i5
4 I1,i3,i4,i7
pe
5 I1,i2,i3,i4,i5
6 I3,i4,i5,i6

4.a) How to identify sub graphs in a graph?

rs
b) Give an overview of correlation analysis. [8+7]

5.a) Explain classification as a two step process.

Fe
b) State Bayes theorem. How this concept is used in classification. [8+7]

6. What is a decision tree? Explain decision tree induction algorithm. [15]

b
7.a) Contrast k-means clustering with k-medoids clustering approach.
b) Discuss the merits and demerits of hierarchical approaches for clustering. [8+7]
20
8. How to apply mining techniques to unstructured text database? Explain with example.
[15]
22
---ooOoo---