Download JNTUH MCA 4th Sem R13 2017 August 814BD Data Warehousing And Data Mining Question Paper

FirstRanker.com
Firstranker's choice FirstRanker.com

--- Content provided by‍ FirstRanker.com ---

Code No: 814BD R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

--- Content provided by‌ FirstRanker.com ---

MCA 1V Semester Examinations, August - 2017

DATA WAREHOUSING AND DATA MINING

Time: 3 Hours Max. Marks: 60

Note: This question paper contains two parts A and B.

--- Content provided by⁠ FirstRanker.com ---

Part A is compulsory which carries 20 marks. Answer all questions in Part A.

Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.

PART - A

5 x 4 Marks = 20

1. a) Explain data mining functionalities. [4]

--- Content provided by‌ FirstRanker.com ---

b) What is data mart explain with example? [4]

c) What is the set of closed item sets? [4]

d) Differentiate classification and prediction. [4]

e) Explain outlier analysis. [4]

PART - B

--- Content provided by‌ FirstRanker.com ---

5 x 8 Marks = 40

2. a) Explain descriptive data summarization with suitable examples. [4]

b) Explain applications of data warehousing. [4] [4+4]

OR

3. a) Explain how to integrate data mining system with database or data warehouse system? [4]

--- Content provided by​ FirstRanker.com ---

b) Discuss concept hierarchy in brief. [4] [4+4]

4. Explain a multi tiered architecture of data warehouse with neat diagram. [8]

OR

5. a) Discuss discovery driven exploration of data cubes with example. [5]

b) Explain iceberg cube in detail. [3] [5+3]

--- Content provided by​ FirstRanker.com ---

6. Explain Apriori algorithm to generate frequent item sets with suitable example. [8]

OR

7. Discuss mining frequent item sets without candidate generation with suitable example. [8]

8. Explain Naive Bayesian classifier with suitable example. [8]

OR

--- Content provided by⁠ FirstRanker.com ---

9. a) Explain different methods for evaluating accuracy of a classifier or predictor. [4]

b) Explain rule based classification with suitable example. [4] [4+4]

10. a) Explain partitioning around medoids with suitable example. [4]

b) Explain constraint-Based cluster analysis. [4] [4+4]

OR

--- Content provided by FirstRanker.com ---

11. a) Explain over all frame work of chameleon. [4]

b) Discuss wavelet transformation based clustering. [4] [4+4]