QUESTION PAPER CODE: Z 5215

M.C.A DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009.

Elective
MC 1630-DATA WAREHOUSING AND DATA MINING
(Regulation 2005)
Time : Three hours Maximum: 100 marks
Answer ALL questions.
PART A -- (10 X 2 = 20 marks)
1. What is Data Mining?
2. Distinguish between Object-Oriented Databases and Object-Relational
Databases.
3. Why preprocess the Data?
4. How are association rules from large databases?
5. How is prediction different from classification?
6. What is cluster Analysis?
7. Write down the star schema and snow flacks.
8. What is concept hierarchy?
9. List out the any five data mining tools
10. What is meant by authoritative web pages?

PART B – (5 X 16 =80 marks)

11. (a) (i) Explain elaborately various steps in the process of knowledge discovery
in data
Mining (8)
(ii) What are the major issues in Data Mining? (8)
Or
(b) Describe in detail the data mining functionalities. (16)

12. (a) Define association rule mining and explain the single dimensional Boolean
Association rule from transactional databases. (16) Or
(b) What is Concept Description? Explain the attribute-Oriented Induction and
how is Attribute oriented induction actually implemented. (16)
13. (a) (i) Describe issues regarding preprocessing the data for classification and
prediction (8)
(ii) Briefly explain the classification by decision tree Induction (8)
Or
(b) What is cluster analysis and explain the classification of major clustering
methods? (16)
14. (a) (i) What is data warehouse and distinguish between operational database
system and data warehouse? (8)
(ii) How are concept hierarchies useful in OLAP and explain OLAP operations in
Multi- dimensional Data model? (8)

Or
(b) (i) Explain the different types of OLAP server. (6)
(ii) Explain the basic steps involved in the design and construction of Data
Warehouses.(10 )
15. (a) Discuss in detail the application of data mining for financial data analysis.
Give suitable data flow diagrams. (16)
Or
(b) Give short notes of
(i) Web Mining. (6)
(ii) Mining spatial Databases (5)
(iii)Mining Text Databases (5)
DATA WAREHOUSING AND MINING 2008

PART-A
1. Write down the applications of data warehousing.
2. When is data mart appropriate?
3. What is concept hierarchy? give an example.
4. What are the various forms of data preprocessing?
5. Write the two measures of Association Rule.
6. Define conditional pattern base.
7. List out the major strength of decision tree method.
8. Distinguish between classification and clustering.
9. Define a spatial database.
10. list out any two various commercial data mining tools.

PART-B

11.(a) (i) With a neat sketch explain the architecture of a data warehouse
(ii) Discuss the typical OLAP operations with an example.
Or
(b) (i) Discuss how computations can be performed efficiently on data cubes.
(ii) Write short notes on data warehouse meta data.

12.(a) (i) Explain various methods of data cleaning in detail.

(ii) Give an account on data mining Query language.
Or
(b) How is Attribute-Oriented Induction implemented? Explain in detail.

13. (a) Write and explain the algorithm for mining frequent item sets without
candidate generation. Give relevant example.
Or
(b) Discuss the approaches for mining multi level association rules from the
transactional databases. Give relevant example.

14. (a) (i) Explain the algorithm for constructing a decision tree from training
samples.
(ii) Explain Bayes theorem.
Or

(b)Explain the following clustering methods in detail:

(i) BIRCH
(ii) CURE

15.(a) (i) What is a multimedia database? Explain the methods of mining

multimedia database?

Or
(b) (i) Discuss the social impacts of data mining.
(ii) Discuss spatial data mining.