Dwm Question Bank Winter 2024
Dwm Question Bank Winter 2024
Dwm Question Bank Winter 2024
INSTRUCTIONS TO CANDIDATES
(1) All questions carry marks as indicated.
(2) Solve Question No. 1 OR Question No. 2.
(3) Solve Question No. 3 OR Question No. 4.
(4) Solve Question No. 5 OR Question No. 6.
(5) Solve Question No. 7 OR Question No. 8.
(6) Solve Question No. 9 OR Question No. 10.
(7) Due credit will be given to neatness and adequate dimension.
(8) Assume suitable data whenever necessary.
Unit 1
1. Define data warehouse. How is a data warehouse different from data base?
2. What is the differentiate between OLAP and OLTP.
3. What is data warehouse? Explain characteristics of data warehouse.
4. Explain the types of Multidimensional data model.
5. Draw and explain three tier architecture of data warehouse.
6. Draw and explain various schemas used to create data warehouse
7. What is OLAP? What are the different OLAP operations that can be performed on
multidimensional data model?
8. Define data warehouse? explain data warehouse architecture along with neat sketch.
9. Differentiate ROLAP, MOLAP and HOLAP server functionalities.
10. 1) Difference between data warehouse and data mart. 2) difference between database
and data warehouse
11. Define following: 1) data mart. 2) data warehouse. 3) data base management system.
Unit 2
Unit 3
1. Explain classification by decision tree induction with explain. Given the steps involved in
decision tree algorithm states its advantages and disadvantage’s
2. Write short note on: 1) rule-based classification. 2) outlier analysis audits application. 3)
density-based clustering. 4) support vector machine (SVM). 5) Classification by back
propagation. 6) constraint-based clustering analysis. 7) k – means partitioned method.
8) agglomerative and decisive hierarchical clustering. 9) DBCAN clustering.
3. What is outlier? Why outlier is importance?
4. Give classification of clustering algorithm’s and explain partition-based clustering
algorithm namely k – means, starting its merits, demerits and application area.
5. Explain classification using naïve Bayesian classification.
6. Explain the difference between k- means and k- medoid algorithm.
7. Briefly outline the major ideas of naïve Bayesian classification.
8. Explain agglomerative and divisive algorithm in brief.
9. Write k- means algorithm apply it to classify the following data in 2- clusters data: 3, 3.5,
5, 3.3, 4.5, 5.2, 6.4, use Euclidean distance method.
10. Write a detailed note on split algorithm based on Gini index
11. What is clusters? Explain the types of clustering analysis.
Unit 4
1. Explain Apriori Algorithm for frequent item sets. what are the drawbacks of apriori
algorithm?
2. What is the process of generating association rules from frequent item sets? Explain with
example.
3. Explain the market- basket analysis using example.
4. Explain EP -Growth algorithm with the help of an example.
5. Generate FP tree for following transaction database. Assume min-sup=40%.
TID Item sets
T1 K, D, B, T
T2 D, G, T, W
T3 B, K, D, T
T4 K, W, G, D, T
T5 W, S, D, T
Unit 5