Download JNTUH MCA 4th Sem R17 2019 December 844AD Data Warehousing And Datamining Question Paper

FirstRanker.com

Firstranker's choice

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

Code No: 844AD R17

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

MCA 1V Semester Examinations, December - 2019

DATA WAREHOUSING AND DATAMINING

Time: 3hrs Max.Marks:75

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

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

Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks and may have a, b, c as sub questions.

PART - A

5 x 5 Marks =25

1. a) Describe three challenges to data mining regarding data mining methodology and user interaction issues. [5]
2. b) Illustrate the OLAP operations in the Multidimensional Data Model. [5]

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

3. c) How to develop a scalable SVM algorithm for efficient classification in large datasets? [5]
4. d) Discuss about Outlier detection using deviation based approach. [5]
5. e) Differentiate structured, unstructured and semi-structured data. [5]

PART -B

5 x 10 Marks =50

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

1. a) What is Data Mining? Explain the steps involved in KDD with neat sketch.
2. b) Describe the classification of Data Mining System. [6+4]

OR

1. a) Distinguish the methods used for integration of Data Mining System with data warehousing system.
2. b) Describe various methods involved in Data Cleaning process. [5+5]

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

1. a) Describe the similarities and the differences of star schema, and snowflake schema then analyze their advantages and disadvantages from each other.
2. b) Discuss about the algorithm that computes closed iceberg cubes efficiently. [5+5]

OR

1. a) A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions.
   1. (1) What is the maximum number of cells possible in the base cuboid?
   2. (i) What is the minimum number of cells possible in the base cuboid?

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

   3. (ii1) What is the maximum number of cells possible in the data cube, C? (including both base cells and aggregate cells)
   4. (iv) What is the minimum number of cells possible in the data cube, C?
2. b) Discuss about bitmap indexing. [6+4]

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

1. A database has five transactions. Let min sup = 60% and min conf = 80%.
   
   
   
   

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

   
   
   
   
   

   TID	items bought
   T100	M,O,N,K,E, Y
   T200	D,O,N,K,E, Y
   T300	M,A K E
   T400	M, UCK,Y
   T500	C,0,0,K,I,E

   
   

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

   
   
   Find all frequent item sets using Apriori and FP-growth, respectively. Compare the efficiency of the two mining processes. [10]

OR

1. Discuss about Multilayer Feed-Forward Neural Network.

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

2. Describe Back Propagation Algorithm for classification and explain with an example. [6+4]

1. Differentiate AGNES and DIANA clustering algorithms.
2. Explain about k-means algorithm with an example. [10]

OR

1. Given two objects represented by the tuples (22, 1;42, 10) and (20, 0, 36, 8):
   1. a) Compute the Euclidean distance between the two objects.

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

   2. b) Compute the Manhattan distance between the two objects.
   3. c) Compute the Minkowski distance between the two objects, using q = 3. [5+5]

1. a) What is time-series data? Explain in brief about mining Time-series data.
2. b) Enumerate the steps in Multimedia Data mining. [5+5]

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

OR

1. Design a Web document classification method that can take index classification standard to classify a set of Web documents automatically. [10]

---00000---

FirstRanker.com

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