Printed Page: 1 of 2

Subject Code: BCS058/ BCAI053

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2024-25
DATA WAREHOUSING & DATA MINING
TIME: 3 HRS M.MARKS: 70

Note: Attempt all Sections. In case of any missing data; choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 07 = 14

Q no. Question CO Level
a. List the main components of a data warehouse. 1 K1
b. What is the difference between a star schema and a snowflake schema? 1 K1
c. What is the difference between a centralized data warehouse and a 2 K1
distributed data warehouse?
d. List the primary functionalities of data pre-processing. 2 K2
e. Name two statistical measures commonly used in large databases. 3 K2
f. How do statistical-based algorithms differ from distance-based 4 K1
algorithms in data mining?
g. What are the main types of OLAP servers? 5 K1
SECTION B

46
2. Attempt any three of the following: 40 07 x 3 = 07

5.
_3

16
Q no. Question CO Level
a. Given a dataset, determine whether a star schema or a snowflake schema 1 K2
P1

5.
would be more appropriate and justify your choice.

25
5D

b. Develop a schema design for a warehouse that stores e-commerce 2 K3

3.
transaction data.
P2

|4
c. Describe the process of binning for reducing noisy data. 3 K2
d. Compare and contrast the strengths and weaknesses of DBSCAN and 4 K3
Q

AM
OPTICS in density-based clustering.
e. Design a backup and recovery strategy for a data warehouse containing 5 K3
sensitive customer data.
57
9:

SECTION C
:5
10

3. Attempt any one part of the following: 07 x 1 = 07

Q no. Question CO Level
2 5

a. Examine the relationship between data warehouse components and the 1 K2

20

overall ETL (Extract, Transform, Load) process.

b. Break down the components of a warehouse database and explain their 1 K2
b-

interconnections.
Fe
5-

4. Attempt any one part of the following: 07 x 1 = 07

|0

Q no. Question CO Level

a. Explain the role of parallel processors and cluster systems in a data 2 K3
warehouse environment.
b. Apply the client/server computing model to optimize query processing in 2 K3
a large data warehouse.

1|Page
QP25DP1_340 | 05-Feb-2025 10:59:57 AM | 43.255.165.46
 Printed Page: 2 of 2
Subject Code: BCS058/ BCAI053
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2024-25
DATA WAREHOUSING & DATA MINING
TIME: 3 HRS M.MARKS: 70

5. Attempt any one part of the following: 07 x 1 = 07

Q no. Question CO Level
a. Use dimensionality reduction techniques to simplify a dataset with 3 K3
hundreds of features.
b. Given a dataset with missing values, demonstrate how you would clean 3 K3
it using imputation.

6. Attempt any one part of the following: 07 x 1 = 07

Q no. Question CO Level
a. Use DBSCAN to identify clusters in a spatial dataset and explain how it 4 K4
classifies noise points.
b. Apply the Apriori algorithm to generate association rules for a market 4 K4
basket dataset.

46
7. Attempt any one part of the following: 40 07 x 1 = 07

5.
Q no. Question CO Level
_3

16
a. Compare the functionalities of ROLAP, MOLAP, and HOLAP servers. 5 K2
P1

5.
b. Examine the differences between web mining, spatial mining, and 5 K2

25
5D

temporal mining in terms of their applications.

3.
P2

|4
Q

AM
57
9:
:5
10
2 5
20
b-
Fe
5-
|0

2|Page
QP25DP1_340 | 05-Feb-2025 10:59:57 AM | 43.255.165.46