0% found this document useful (0 votes)
36 views7 pages

DWDM

Study ????

Uploaded by

arunofficial3331
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
36 views7 pages

DWDM

Study ????

Uploaded by

arunofficial3331
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Total Pages : 4 312304 December 2022 BCA (OS)-IIl SEMESTER Data Warehouse and Data Mining (BCA-DS-204) Time : 3 Hours] (Max. Marks : 75 Instructions : 1. It is compulsory to answer all the questions (1.5 marks each) of Part-A in short. 2. Answer any four questions from Part-B in detail. 3. Different sub-parts of a question are to be attempted adjacent to each other. 4. Assume data wherever required. PART-A 1. (@) Differentiate OLAP systems with typical OLTP systems. (1.5) (6) What is metadata repository in data warehousing? (1.5) (©) What is meant by concept hierarchy? Explain its need. (1.5) (d) What do you mean by Bitmap indexing? (1,5) 312304/155/1 11/233 ww [P.T.O. 2. 2 (e) (p (a) (h) (i) (a) (b) (a) a Describe various methods for data cube materialization, (1,5) Differentiate between ROLLUP and DRILLDOWN operations of data warehouse, (1.5) What is meant by Data Marts? What are its types? (1,5) How we can find center and radius of a cluster? (1.5) What is the difference between supervised and unsupervised learning? (1.5) Why data preprocessing is an important issue for both data warehousing and data mining? (1.5) PART-B Explain three tier data warehouse architecture with the help of an explanatory diagram. (10) What is the difference between ROLAP, MOLAP and HOLAP servers? (5) Describe in detail the concepts behind clustering. Also explain why k-medoids algorithm is better than k-means algorithm? (10) Describe various steps of KDD in detail. (S) 312304/155/111/233 2 . 4. (a) Suppose that a Data Warehouse for a Big-University (b) (a) (b ~ consists of four dimensions student, course, semester and instructor and two measures count and avg_grade. When at the lowest conceptual level (e.g. for a given student, course, semester and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade Stores average grade for the given combination. (@ Draw the schema diagram for the above data warehouse using snowflake schema class. (ii) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations should one perform in order to list the average grade of CS courses for each Big_University student. (10) How tuning and testing of data warehouse is performed? (S) What are Decision trees? How they assist in classifying data? Explain with the help of suitable example. (10) How genetic algorithm approach assists in the process of classification? 6) 312304/155/1 11/233 3 [PT.0: 6. A database has four transactions. Let min_sup=2 and min_conf=85% : TID (a) Find all the frequent itemsets using A-priori algorithm. (b) List all the strong association rules satisfying the min_sup and min_conf. The rules should match the following metarule, where X is a variable representing customers and items denotes variable representing items : V, €transaction, buys(X, item, )”* buys(X, item,) => buys(X, item,), (15) Write short note on the following (any three) : (a) Mining spatial databases. (b) Data Mining Query Language. (c) Time-Series Data mining. (d) Data Warehouse back-end tools. (15) 312304/155/111/233 4 . dy oe Satyug Darshan Institute of Engincering & Technology Faridabad 8 tal Test — 1 (Odd Semester 2022-23) BCA [Branch/Sections: BCA GEN], SEM- 3rd SuilectNaiie eDWOM agian ats) show Max. Marks : 59 Subject Code : BCA-DS-204 Time :2 Hour Instructions : 1. Question ONE is conipulsory. 2. Attempt any four from section B. COL: To use Concepts of Data Warehouse, OLAP and OLTP CO2: To use Data mining and different Process in it, applications back end tools of Data Mining. Section— A QL-@) Why we use Data Warehouse? (©) Differentiate between ROLAP and MOLAP, (©) Why we do Data Mining? (@) What are the applications of Data mining? (€) What do you understand by the term Aggregation? Section -B Q2. Explain the architecture of Data Warehouse in detail, Q3. (2) What are the Star Schemas and Fact Constellation? (6) Compare OLAP and OLTP. What is ETL? Q4.(a) Differentiate between DBMS and Data Warehouse. (b) What is Distributed and virtual data warehouse? QS. What are Data Cubes? What operations can be perfermed on them? (b) Explain the Phases of Data Mining. What is KDD? Q6. (2) What are data warehouse back end tools, (b) How we can do tuning of Data warehouse? CO1 KL2 2 COl KL2 2 CO2 KL2 2 CO2 KLI 2 CO2 KLI 2 COl KLI 10 COl KLI «5 COl KL2 5 COl K12 5 COl KLI 5 CO2 KLI 5 CO2 KLI 5 C02 KLI 5 CO2 KL2 5 Varidabad Subject Name:DWDM Roll No: LoA-D 5. Aff@o7 Subject Code § BCA-DS-204 Instructions : 1, Question ONE Is compulsory. 2. Allempt any four from section B. Satyug Darshan Institute of KE ngineering & Technology Sessional Test ~ 2 (Odd Semester 2022- 23) HCA [Branch/Sections: BCAGEN, SEM- 3rd Max. Marks : 50 Time 2 Hour CO¥: To understand DMQL, Clustering techniques, knowledge of Association and Apriori algorithm. CO4: To understand different databases and web mining, Section ~A QU(a) Why we do Data Mining? (b) Differentiate between Separable and Non- seperable data set. (c) What is Clustering? (d) What are the applications of Data mining? (©) What do you understand by Text databases? Section ~B Q2. Explain Apriori Algorithm with example in detail. Q3, (4) What are Data Mining Query Languages? (b) Why we use Fuzzy technique in Data Mining? 04.(4) What are Support Vector Machines in Data Mining? Wha is Concept Hierarchy? (b) Explain Rough Sets with an example in detail. Q5. (a) What are Complex data objects in Data Mining? (b) Explain Sequence Data Mining with an example. 26. What are Spatial and Multimedia databases? How we can mine World Wide Web? CO3 KL2 2 CO3 KL2Z 2 CO4 KL2 2 CO4 KLI 2 CO4 KLI 2 CO3 KLI 10, CO3 KLI 5 i C03 KL2 C03 KL2 CO3 KLI CO4 KLI CO4 KLI CO4 KLI 10 w i Gy te

You might also like