102602CS

Roll No………………………..

Course Code: 102602CS

Examination: APRIL-MAY 2023
Course: DATA WAREHOUSING & MINING

Time Allowed: 3 Hours Maximum Marks: 100

Minimum Marks: 35
Note: Attempt all questions. Part (A) of each question is compulsory
and carries 4 marks; attempt any two parts from part (B), (C) and (D)
carrying 8 marks each.
Q1 A What is OLAP cube? 4
B Write difference between operational database 8
systems and data warehouses.
C Explain architecture of data warehousing with 8
suitable diagram.
D Describe Star and Snow-Flake Schema with suitable 8
example.
Q2 A What is Data Preprocessing? 4
B Write major issues in Data Mining. 8
C Describe classification of Data mining system. 8
D What is Hierarchy Generation? Also explain 8
Discretization.
Q3 A What is classification problem? 4
B Explain Naïve-Bayes classifier algorithm. 8
C Write methods for expressing attributes test 8
condition.
Page 1 of 2
102602CS

D What are the methods of evaluating accuracy of 8

classifier or a predictor?
Q4 A Describe Association rule? 4
B What is compact representation of frequent item set? 8
Give an example.
C Explain FP-Growth algorithms with example. 8
D Trace the results of using the Apriori algorithm on the 8
grocery store example with support threshold
s=33.34% and confidence threshold c=60%. Show the
candidate and frequent item sets for each database
scan. Enumerate all the final frequent item sets. Also
indicate the association rules that are generated and
highlight the strong ones, sort them by confidence.
Transaction ID Items
T1 HotDogs, Buns, Ketchup
T2 HotDogs, Buns
T3 HotDogs, Coke, Chips
T4 Chips, Coke
T5 Chips, Ketchup
T6 HotDogs, Coke, Chips
Q5 A What is clustering? 4
B Explain PAM algorithm. 8
C Define the term data mining. Briefly explain different 8
techniques of data mining.
D Explain taxonomy of web mining with suitable 8
diagram.

Page 2 of 2
102602CS

Roll No………………………..

Course Code: 102602CS

Examination: APRIL-MAY 2023
Course: DATA WAREHOUSING & MINING

Time Allowed: 3 Hours Maximum Marks: 100

Minimum Marks: 35
Note: Attempt all questions. Part (A) of each question is compulsory
and carries 4 marks; attempt any two parts from part (B), (C) and (D)
carrying 8 marks each.
Q1 A What is OLAP cube? 4
B Write difference between operational database 8
systems and data warehouses.
C Explain architecture of data warehousing with 8
suitable diagram.
D Describe Star and Snow-Flake Schema with suitable 8
example.
Q2 A What is Data Preprocessing? 4
B Write major issues in Data Mining. 8
C Describe classification of Data mining system. 8
D What is Hierarchy Generation? Also explain 8
Discretization.
Q3 A What is classification problem? 4
B Explain Naïve-Bayes classifier algorithm. 8
C Write methods for expressing attributes test 8
condition.
Page 1 of 2
102602CS

D What are the methods of evaluating accuracy of 8

classifier or a predictor?
Q4 A Describe Association rule? 4
B What is compact representation of frequent item set? 8
Give an example.
C Explain FP-Growth algorithms with example. 8
D Trace the results of using the Apriori algorithm on the 8
grocery store example with support threshold
s=33.34% and confidence threshold c=60%. Show the
candidate and frequent item sets for each database
scan. Enumerate all the final frequent item sets. Also
indicate the association rules that are generated and
highlight the strong ones, sort them by confidence.
Transaction ID Items
T1 HotDogs, Buns, Ketchup
T2 HotDogs, Buns
T3 HotDogs, Coke, Chips
T4 Chips, Coke
T5 Chips, Ketchup
T6 HotDogs, Coke, Chips
Q5 A What is clustering? 4
B Explain PAM algorithm. 8
C Define the term data mining. Briefly explain different 8
techniques of data mining.
D Explain taxonomy of web mining with suitable 8
diagram.
Page 2 of 2