Download JNTUH MCA 4th Sem R13 2019 December 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 IV Semester Examinations, December - 2019

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) What is data preprocessing? What are the various forms of it.
2. b) Explain the architecture of data warehouse.

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

3. c) Distinguish between Apriori algorithm and Frequent pattern growth algorithm.
4. d) What are the steps involved in preparing the data for classification?
5. e) What are the advantages and disadvantages of k-means algorithm.

PART -B

5 x 8 Marks =40

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

1. a) Explain about the Integration of a Data mining system with a Database or Data warehouse system.
2. b) List the techniques for Data cleaning. [4+4]

OR

1. a) What are the issues in Data mining?
2. b) Explain about the classification of data mining systems. [4+4]

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

4. Explain in detail about the implementation of a data warehouse. [8]

OR

5. Illustrate OLAP operations in the Multidimensional Data Model. [8]

6. Discuss the FP-growth algorithm. Explain with an example. [8]

OR

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

7. Discuss about mining multilevel association rules from transaction databases in detail. [8]

8. Explain in detail about classification of Back propagation algorithm. [8]

OR

9. Explain linear regression and non-linear regression with example. [8]

10. Write algorithms for k-medoid clustering and Explain with simple data. [8]

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

OR

11. Explain about the Statistical-based outlier detection. [8]

--00000---

FirstRanker.com

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