0% found this document useful (0 votes)
22 views2 pages

Bca VI May2017 Data Mining and Data Warehousing

Uploaded by

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

Bca VI May2017 Data Mining and Data Warehousing

Uploaded by

tendots04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

it lll t{tI lilltll K17U Ct427

Name : ---,,,,,,,.........- . ........-

Vl Semester B-C.A. Degree (CSCSS - Regular) Examination, Mav 2017


(2014 Admn )
Core Course in BCA
6818BCA: DATA MINING AND DATA WAREHOUSING

SECTLON ' A

lonewordanswefl (8r0.5=4)

a)' A s a sublecl orienled iniegrated. ime-varyng non-volai e


colectionof dalairsupponof themanagemeni'sdecisonmakingprocess
operaiion performs a selection on one d mens on ol ire
g ven datacube, resulling in asubc!be

c) The task ol qrouping se1 ol oblecls n slch a way thal oblecls n lhe same
-',r.upio.6*"lti"rutt.eachoiherihanlothoseinothergroupslscaled
d) / useo aodsu eq Io sarp''
nleresUng association rules
e) B FCH is an examPle rora -- rype c ustering
a goritli m

t) -
c usteinq iechnlqle stan with as many c lslers as there
'Lre
;cor.ls wlh each c lsierhavino on vone record
g) The sel of dala norma y used to b! dlhe cassl er modelis lermed as
h)-- provLdes an nionnauon-theorelic aPproach 10 measure lhe
goodness ofa sPlit

SECTION_B
Write shortnoles onany seven of the follow ngqleslions I \712-1a)
2. Wlraldoyou mean byihelerm Dataoube ?

3. Lislout vaious OLAP operal ons


i. w d. r' -d._ no l6d , 'o -
K17U0427 i lullfl llu lltfi1ll ll

5 Whatis sequence minifg ?


6 Exp a n ihe concepl beh nd alrequenl temsel
7. Whal is an FP nee ?

L Whatarelhelwo main approaches to clustering ?


I Deiinelheterm inte rattrlbule s! nr mary'

10. What is adeclsontree ?


I 1 What is lhe use ol counl matr x in decis on lree indLrct on ?

SECTLON C
Answerany louroflhe io owingquestions 9"3=12)
12. Explaln aboul lhe coicept!al basic components ora m!ll dimensionaldala mods
13. Disiing uish betwee n DBI\,'lSand Data Mining
r4 Das. bp -/o. g .lPdrlJio. Alao,iln rne oiao -orinrno
r5 Descrlbethe Lrndenyirg pinciple behinclDBSCANclusiering algorilhm
16 whar are the arlvaniages and dsa{lvanlages oi decsion tree approach over
oiherc asslflcal on aPProa€hes ?
l/. Explain aboul any lwo clecision lree con slr!ction algo thrns

SECTION-D
Wr te an essay on any two oi the iollowing q lesuons. (2 <5=1 0)

r8. Briel y discr.rss abo!l var oLr s dala lrare ho!se backend processes

r9. Explain dlfterenlapp caton areas where dala m n ng


jsused

20. Discuss the iollo$, ng dala mining mod€ls i

a) G€nelLcAlooilhm
b) NeuralNetworks
21. Wrile short notes on :
a) Pincer search Algoilhm
b) K'l\,4edodcluste nq a gor lhm

You might also like