2005 Andhra University MCA DATA WARE HOUSING AND DATA MINING Question paper for exam preparation. Question paper for 2005 Andhra University MCA DATA WARE HOUSING AND DATA MINING Question paper, 2005 Andhra University MCA DATA WARE HOUSING AND DATA MINING Question paper. SiteMap

Exam Preparation

 • AIPMT Exam Preparation • Civil Services Exam Preparation • IIT JEE Exam Preparation • Class 12th Standard Exam Preparation • Class 11th Standard Exam Preparation • Class 10th Standard Exam Preparation • Class 9th Standard Exam Preparation • Class 8th Standard Exam Preparation

Question Papers

 • Class 9th Standard Question Paper • Class 10th Standard Question Paper • Class 11th Standard Question Paper • Class 12th Standard Question Paper • BA Question Paper • BBM Question Paper • BCA Question Paper • BCom Question Paper • BE Question Paper • BSc Question Paper • BTech Question Paper • LLB Question Paper • LLM Question Paper • MA Question Paper • MBA Question Paper • MCA Question Paper • MCom Question Paper • MSc Question Paper • MTech Question Paper

2005 Andhra University MCA DATA WARE HOUSING AND DATA MINING Question paper

University Question Papers
2005 Andhra University MCA DATA WARE HOUSING AND DATA MINING Question paper

MCA 3.1.5

DATA WARE HOUSING AND DATA MINING

Elective III

First Question is Compulsory

Answer any four from the remaining

Answer all parts of any Question at one place.

Time: 3 Hrs.
Max. Marks: 100

1. Briefly discuss.
a. Correlation analysis for handling redundancy.
b. Discretization
c. Advantages of ROLAP and MOLAP
d. Ice-berg query.
e. Constraint –based rule mining
f. Scalability of an algorithm
g. Cross table reporting
h. Slicing operations
i. Reasons for data partitioning
j. Components of five-number summary

2. a) What is data mining? Briefly describe the components of a data mining system.
b) What kinds of patterns can be identified in a data mining system?

3. a) Write the differences between operational database and data warehouse.
b) Briefly describe 3-tier Data warehouse architecture

4. a) Write different approaches to data transformation.
b) Propose an algorithm in pseudo-code for automatic generation of a concept hierarchy for categorical data based on the number of distinct values of attributes in the given schema.

5. a. Discuss the essential features of a typical data mining query language like DMQL.
b. Consider association Rule below, which was mined from the student database at Big- University:
Suppose that the number of students at the unive rsity (that is, the number of task-relevant data tuples) is 5000, that 56% of undergraduates at the university major in science, that 64% of the students are registered in programs leading to undergraduate degrees, and that 70% of the students are majoring in science.

a. Compute the confidence and support of above rule.
b. Consider Rule below: