Data Mining and Warehousing (AD-603 (A)) - Important Questions
-
Unit 17 Marks High Priority
Explain the three-tier data warehouse architecture with a neat diagram.
Predicted for DEC-2026
-
Unit 17 Marks High Priority
Explain the steps involved in data preprocessing, including dimensionality reduction techniques.
Predicted for DEC-2026
-
Unit 17 Marks High Priority
Discuss metadata in the context of data warehousing and its role in data management, including support for data retrieval, transformation, and analysis.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Explain typical OLAP operations on multidimensional data cubes with examples and diagrams.
Predicted for DEC-2026
-
Unit 214 Marks High Priority
Discuss the hardware and operational design considerations for a data warehouse to support OLAP queries and data mining operations.
Predicted for DEC-2026
-
Unit 27 Marks High Priority
Differentiate ROLAP, MOLAP and HOLAP server functionalities.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain the various phases of the knowledge discovery (KDD) process and data mining as a step within it, with a neat diagram.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain why data preprocessing is necessary before data mining and describe the data preprocessing tasks.
Predicted for DEC-2026
-
Unit 37 Marks High Priority
Explain the concept of fuzzy sets and fuzzy logic and how fuzzy logic can be applied to data mining.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Explain the rule-based classifier/algorithm including structure, working, example, use of information gain, real-world applications, strengths, limitations and future evolution.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
With a neat block diagram, explain the general approach to solve a classification problem.
Predicted for DEC-2026
-
Unit 47 Marks High Priority
Discuss about K-nearest-neighbors (KNN) algorithm with example.
Predicted for DEC-2026
-
Unit 57 Marks High Priority
For a transactional database, we can get a large number of association rules. How can we get useful/interesting association rules from such a large set?
Predicted for DEC-2026
-
Unit 514 Marks High Priority
Explain the BIRCH scalable algorithm with example.
Predicted for DEC-2026
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel