Scribd
Upload
90 views

DMDW 1

Uploaded by

raju rama raj kumar
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
90 views

DMDW 1

Uploaded by

raju rama raj kumar
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/ 2
Roll No. Total No. of Pages : 02 Total No. of Questions : 09 B.Tech. (CSE) (Sem-7,8) DATA MINING AND DATA WAREHOUSING Subject Code : BTCS702-18 M.Code : 90488 Date of Examination : 21-06-2023 Time : 3 Hrs. Max. Marks : 60 INSTRUCTIONS TO CANDIDATES : 1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each. 2, SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions. 3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions. SECTION-A 1. Write briefly : a) Define Data Warehouse. b) Name some open source data mining tools, ©) Write some data cube operations. 4). Differentiate between Classification and clustering. &) Define Information Gain, 1) Let us suppose that there are 200 pages available on internet for machine learning. The search on this term returns total 210 pages, out of which 190 belongs to Machine Learning, calculate precision and recall for our algorithm. g) What is density based methods in clustering? hh) What is enterprise search? i) What are different challenges in clustering the data? i) What is web usage mining? SECTION-B 2. What is Data Mining and explain the knowledge discovery process. 3. What is classification? Explain decision tree induction by taking a suitable example. https:/Awww.ptustudy.com 4, What is web content mining? Write its different steps. 5. The distance between some Indian cities are given below, Apply the clustering algorithm to make three clusters. Indicate intermediate steps. Bathinda | Patiala | Delhi ‘Amritsar [ Mathura Bathinda 0 190. 400. 250. 460. Patiala 190 0 240 225, 300 Delhi 400 240 0 450. 60, Amritsar 250 225 450 0 510 ‘Mathura 460 300 60 310 0 6. Explain Naive Bayes Classification. SECTION-C 7. Explain the association rule mining problem. Consider an example with the following set of transactions. There are 10 items. https:/www.ptustudy.com TD items bought 001 BLM.T.Y 002 BLM (003 ATS? (004 A.B.CD (005 AB 006) T.Y.E.M 007 A,BLM 008 B,C.D.T.P 009 D.T.S 010 A, BM ‘Assume that we wish to find association rules with at least 30% support and 60% confidence. Find the frequent itemsets and then the association rules. 8. Explain the architecture of search engine in detail. Draw suitable diagrams. 9. What is OLAP? Explain its architecture, characteristics and multi dimensional view. NOTE : Disclosure of Identity by writing Mobile No, or Making of passing request on any age of Answer Sheet will lead to UMC against the Student. 2| m-goase (52)-2831 https:/www.ptustudy.com

You might also like