Course Code: R2331051 FE HTNO
VIGNAN’S LARA INSTITUTE OF TECHNOLOGY & SCIENCE
(Autonomous)
III [Link] I Semester Regular Examinations, November 2025
DATA WAREHOUSING AND DATA MINING
(Computer Science and Engineering)
Time: 3 Hrs Max. Marks: 70
Answer All the Questions
Part-A
Short Answer Questions
10x2=20 Marks
Q. Question Marks
BL CO PO
No.
1 a Mention any two advantages of data warehousing. 2 Remember 1 1
b What is ETL in data warehousing? 2 Understand 1 1
c Why is data preprocessing important in data mining? 2 Understand 2 1
d What is coefficient and covariance method? 2 Remember 2 2
e List any two steps in the classification process. 2 Remember 3 1
f Name two attribute selection techniques. 2 Remember 3 1
g What is the primary goal of Association Analysis? 2 Analyze 3 2
h State the Apriori Principle. 2 Remembering 3 1
What is the main objective function that K-means clustering tries
i 2 Understanding 3 2
to minimize?
What are the two main parameters required by the DBSCAN
j 2 Remembering 3 1
algorithm?
Part-B
Long Answer Questions
Q.
Marks BL CO PO
No.
What are various schemas for multidimensional databases?
2 a 5 Understand 1 2
Explain in detail.
b What are various types of OLAP servers? Explain. 5 Analyze 1 2
OR
3 a Explain Datawarehouse architecture with neat diagram 5 Understand 1 1
b Write about different attribute types? 5 Remember 1 2
4 a Explain in detail about data pre-processing. 5 Understand 2 3
What is the need of dimensionality reduction? Explain any two
b 5 Analyze 2 1
techniques for dimensionality reduction.
OR
Normalize the following group of data by using the following
techniques. 200, 300, 400, 600, 1000 i) min-max normalization
5 a 5 Understand 2 1
technique ii) z-score normalization iii) Decimal scaling. Write
your observations on the above techniques.
b Write about different types of data integration? 5 Remember 2 1
Explain the decision tree induction algorithm with appropriate
6 a examples. Discuss the disadvantages of this approach? What is over 5 Remember 3 1
fitting, and how can it be prevented for decision trees
b Given a training dataset Y: 5 Understand 3 1
Page 1 of 3
A B C Class
15 1 A C1
20 3 B C2
5 2 A C1
30 4 A C1
35 2 B C2
25 4 A C1
15 2 B C2
Find the best split point for decision tree for attribute A.
OR
Make a decision tree for the following database using
GiniIndex. Indicate all intermediatesteps.
Example Colour Shape Size Class
1 Red Square Big +
2 Blue Square Big +
7 a 5 Remember 3 1
3 Red Circle Big +
4 Red Circle Small –
5 Green Square Small –
6 Green Square Big –
b Explain the Information Gain with one example? 5 Understand 3 1
1. ) Make a comparison of Apriori and FP-Growth algorithms for
frequent item set mining in transactional [Link] these
algorithms to the following data:
TID LISTOFITEMS
1 Bread,Milk,Sugar,TeaPowder,Cheese,Tomato
2 Onion,Tomato,Chillies,Sugar,Milk
8 a 3 Milk,Cake,Biscuits,Cheese,Onion 5 Understand 3 3
4 Chillies,Potato,Milk,Cake,Sugar,Bread
5 Bread,Jam,Mik,Butter,Chilles
6 Butter,Cheese,Paneer,Curd,Milk,Biscuits
7 Onion,Paneer,Chilies,Garlic,Milk
8 Bread,Jam,Cake,Biscuits,Tomato
A database has four [Link] min_sup=60% and min_conf=80%
TID Date items_bought
100 10/15/2022 {K,A, B, D}
200 10/15/2022 {D,A, C,E,B}
b 5 Apply 3 2, 3
300 10/19/2022 {C,A, B,E}
400 10/22/2022 {B,A,D}
Find all frequent items using Apriori& FP-growth, respectively.
Compare the efficiency of the two-mining process
OR
Consider the transaction data-set:
TransID Items
T1 {a,b}
9 a T2 {b,c,d} 5 Remember 3 1, 2
T3 {a,c,d,e}
T4 {a,d,e}
Page 2 of 3
T5 {a,b,c}
T6 {a,b,c,d}
T7 {a}
T8 {a,b,c}
T9 {a,b,d}
T10 {b,c,e}
Construct the FP tree by showing the trees separately after reading each
transaction
Discuss Apriori Algorithm with a suitable example and explain how its
b efficiency can be improved 5 Understand 3 1, 2
Explain the following
i) Agglomerative hierarchical clustering. PO2,
10 a ii) divisive clustering 5 Analyzing 3
PO4
Suppose that the data-mining task is to cluster the following eight points
(representing location) into three clusters: A1 (2;10); A2 (2;5); A3 (8;4)
; B1 (5;8) ; B2 (7;5) ; B3 (6;4) ; C1(1;2) ; C2 (4;9). The distance
b function is Euclidean distance. Suppose initially we assign A1, B1, and 5 Understanding 3 PO2
C1 as the center of each Cluster respectively. Use the k-means algorithm
determine: the three cluster centers after the first round of execution.
OR
PO2,
11 a Explain K-means algorithm with an example. 5 Evaluating 3
PO4
b Explain Different types of clustering techniques? 5 Remembering 3 PO1
*****
Page 3 of 3