Download AKTU B-Tech 6th Sem 2017-2018 NCS 066 Datawarehousing And Data Mining Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 6th Semester (Sixth Semester) 2017-2018 NCS 066 Datawarehousing And Data Mining Question Paper

Printed Paesz02 Sub Code: NCS 066
Paperld: IJIIIDEE RollNo.| | | | | | | | | | |
B.Tech
(SEM VI) THEORY EXAMINATION 2017-18
DATAWAREHOUSING AND DATA MINING
T ime: 3 Hours T 0tal Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Draw the diagram for key steps of data mining.
Define the term Support and Confidence.
What are attribute selection measures? What is the drawback of information gain?
Differentiate between classification and clustering
Write the statement for Apriori Algorithm.
What are the drawbacks of k-mean algorithm?
What is Chi Square test?
Compare Roll up, Drill down operation.
What are Hierarchal methods for clustering?
Name main features of Genetic Algorithm.
F'H-rmwegcp?w
SECTION B
2. Attempt any three of the following: 10 x 3 = 30
a. Explain the data mining/ knowledge extraction process in detail?
b. Differentiate between OLAP and OLTP.
Find frequent patterns and the association rules by using Apriori Algorithm for the
C following transactional database:
TID T100 T200 T300 T400 T500
Items M,O,N,K,E,Y D,O,N,K,E,Y M,A,K,E M,U,C,K,Y C,0,0,K,I,E
_bought
Let Minimum support: 60% and Minimum Confidence: 80%
What are different database schemas .shows with an example?
6 How data back- up and data recovery is managed in data warehouse?
SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Draw the 3-tier data warehouse architecture. Explain ETL process.
(b) Elaborate the different strategies for data cleaning.
4. Attempt any one part of the following: 10 x 1 = 10
(a) What are different clustering methods? Explain STING in detail.
(b) What are the applications of data warehousing? Explain web mining and spatial
mining.
5. Attempt any one part of the following: 10 x 1 = 10
(a) Define data warehouse. What strategies should be taken care while designing a
warehouse?

(b) Write short notes on the following:
(i) Concept Hierarchy (iii) Gain Ratio
(ii) ROLAP vs MOLAP (iv) Classification Vs Clustering
6. Attempt any one part of the following: 10 x 1 = 10
(a) Compute the decision rules by deriving a decision tree classifier and information gain
as selection measure for the given database in table.
Table 6
Age Income Student Credit rating Class : buys
computer
youth high No Fair No
youth high No Excellent No
middle high No Fair Yes
aged
senior medium No Fair Yes
senior low Yes Fair Yes
senior low Yes Excellent No
middle low Yes Excellent Yes
aged
youth medium No Fair No
youth low Yes Fair Yes
senior medium Yes Fair Yes
youth medium Yes Excellent Yes
middle medium No Excellent Yes
aged
middle high Yes Fair Yes
aged
senior medium No Excellent No
Given: Gain (age) = 0.246, Gain (student) =0.151 and Gain (Credit Rating) =0.048
b) What is Laplacian Correction in Bayesian Classifier? Compute the class of the for
following tuple by using Bayesian classification for given database in table 6.
X: (Age = senior, Credit rating = fair, Income: medium, student: no)
7. Attempt any one part of the following: 10 x 1 = 10
(a) Write the k- mean algorithm. Suppose that the data mining task is to cluster points
(with (x,y) representing location ) into three clusters , where the points are:
A1 (2, 10), A2 (2, 5) A3 (8, 4)
Bl (5, 8), 32 (7, 5) B3 (6, 4)
c1(1, 2), c2 (4, 9)
The distance function is Euclidian distance. Suppose initially we assign A1, B1, and C1
as the center of each cluster, respectively. Use the k- means algorithm to show only
The three cluster centers after the first round of execution.
(b) What is Hierarchical method for clustering? Explain BIRCH method.