Professional Documents
Culture Documents
Data Warehousing Jan 2018 (2010 Scheme)
Data Warehousing Jan 2018 (2010 Scheme)
com
(r'';''' '
USN J:"- " ,<::)9}S74
,/ '~,~ /"~,.,)
m
Time: 3 hrs. \, .".....t_, (>~ax, Marks: 100
'«(,~ote: Answer any FIVEfull questions, selecti'JfJ"~~))
(~>,<~
,(;;;j:/\
at least TWO questions from each pa(t:~
c-. :>
("2~(",
.co
PART - A_'!"':''::;
1 a, Give the definitid~_~91data warehousing, Discuss the need for~at~)warehousing. (06 Marks)
b. Give the d ifference 6et~vG~nOL TP and data warehouse sy em ':-~ (04 Marks)
c. Discuss the characteriiBc» of operational data store wi¢\,A~/ design and imp lernentation
. .,:-,./ ,,/\ ("" \ :0
Issues. ,/~"(\ \ .) \ \;;',r (10 Marks)
g
\' '" \,
\ ':-!:'G,
" <, V
2 a, Describe the operations ordara'" ube. '\ ~ -,-,) (10 Marks)
lo
b. Present five major characte~lst\Ss from Codd's rul(~~),) (05 Marks)
c. Explain the difference between:t00GAP and ROLAP.,/ (05 Marks)
'-""/ ' ,_ '..1 \ vI
3
4
a.
b.
a.
Explain various tasks of data mi~n£~jth example for each.
ib
Explain: (i) Data mining application, ,,'lOO 'Isstie~/in proximity calculation.
V 1.1"0
What is Frequent Itemset Generation? Ex0ain Frequent Itemset Generation using Apriori
(10 Marks)
(10 Marks)
ik
principle. '::;'''.,'0 5,) (10 Marks)
b. Given the following set of transactions ill m;lrke~ basket model. Build a frequency pattern
(FP tree) show each transaction sepa.(~t~y. \0,•... "", --
aw
PART-B //'" .
U'Sing H un t s algor! . d .. (/e, \\\., c. II . d
5 a. Explain Hu ~.'~t1t
t I ithm wr t t e eCIsron tre\:.!9Ptlie 10 owing ata:
.p
m.
/fid" ':'Home Annual Marital Default /;:..,\
\\\! owner Income Status borrower ir /J
~·~~r~~
, '11
Yeas 125 K Single No tr> '::>
w
\,:..~('.,
No~n 100 K Married No <>;:;,. ,.\
(. / !,-'\
~' 3 No 70 K Single No
\, r> I
4 Yes 120 K Married No ()\~J>
w
\. /' ('>
5 No 95 K Divorced Yes c;-;--"
.., 6 No 60K Married No [;;(?
o 7 Yes 220 K Divorced No ~\s:
w
z 8 No 85 K Single Yes
9 No 75 K Married No
10 No 90K Single Yes
(10 Marks)
b. Explain the various measures for selecting the best splits. (05 Marks)
c. Explain the rule evaluation criteria for classification. (05 Marks)
1 of2
!) 101874
, £---~.•.
,..:..---,
6 a. <,,'Wn~tare Bayesian classifiers? Explain Baye's theorem for classification, (10 Marks)
b. v'E~lain how the predictive accuracy of classification methods be estimated. ,(10 Marks)
r //>
'- ./
m
(10 Marks)
b. Explain tlje"'following clustering technique with algorithm.
i) K-m !1 .rriethod
ii) Divisive ierarchical method. (10 Marks)
co
0~;;0
'.-/~--
v'(~\r-,
8 a. What is Web data m)i{in},? Explain Web document clustering. (06 Marks)
b. Exp lain different text';YIIl'pg approach. (" ,,'1 (08 Marks)
g.
c. Describe sequential rilinipg technique, with an example. :»> (06 Marks)
~\~, r \:;
\) fr;,.---.., <'-..(,~
lo
\-
.J<0(I ***** ~
C~ 'Si"f'
~
2{b ibo
ik
i aw
ed
.p
w
w
o V
w
------'
20f2