Engineering BE Computer Engineering Sem 6 December 2019 2019 Data Warehouse And Mining Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q2 Answer any three out of remaining five questions
2. Q3 Assume any suitable data wherever required and justify the same
3. Q1 a) Why is data integration required in a data warehouse, more so than in an operational 5 marks
   • b) Describe the steps involved in Data Mining when viewed as a process of knowledge
   • c) Adimension table is wide, the fact table is deep. Explain 5
   • d) Elucidate Market Basket Analysis with an example. 5
4. Q2 a) Suppose that a data warehouse consists of the three dimensions time, doctor and patient, and the two measures count and charge, where charge is the fee that a doctor charges a patient for a visit 10 marks
   • (i) Draw a star schema diagram for the above data warehouse
   • (ii) Starting with the base cuboid [day, doctor, patient], what specific OLAP operations should be performed in order to list the total fee collected by each obtain the same list, write an SQL query assuming the data are stored ina relational database with the schema fee (day, month, year, doctor, hospital,
   • b) Develop a model to predict the salary of college graduates with 10 years of work 10
5. Q3 a) Suppose that the data for analysis includes the attribute salary. We have the following values for salary (in thousands of dollars), shown in increasing order: 30, 36, 47, 50, 10 marks
   • (i) What are the mean, median, mode and midrange of the data?
   • (ii) Find the first quartile (Q1) and the third quartile (Q3) of the data
   • (iii)Show a boxplot of the data Paper Subject Code: 88903 Data Warehouse and Mining
   • b) Why is entity-relationship modeling technique not suitable for the data warehouse? How is dimensional modeling different? 10
6. Q4 a) Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning? 10 marks
   • b) Consider the transaction database given below, Use Apriori Algorithm with min-support count = 2 and min-confidence = 60% to find all frequent itemsets and strong association rules
7. Q5 a) Show the dendrogram created by the complete link clustering algorithm for the given set of points 10 marks
   • b) What is spatial data? Explain CLARANS Extension. 10
8. Q6 a) Demonstrate Multidimensional and Multilevel Association Rule Mining with 10 marks
   • b) What is Web Structure Mining? List the, approaches used to structure the web pages to improve on the effectiveness of search engines and crawlers. Explain Page Rank technique in detail 10

Read from the scan above, so a character or two may differ. The scan is the original.