1:13 ,Ill LTE

/ Big-Data-Analytics-18CS72 ...
r~lil ~IVI
1111·
Seventh Semester B.E. Degree Examination, Feb./Mar.2022
Big Data

Time: 3 hrs. Max. Marks: 100

Nofe: A•,_,. ••Y FIVE f•U 9•atio11J, clloosi111 ONE/•II 9•ntio11 /,_ each •otl•le.

a. Discuss the Evolution of Big Data.

b. Explain the characteristics of Big Data.
c. With a neat block diagram, explain Data Architecture Design. (It

OR
2 a. Write notes on Analytics Scalability to Big Data and Massive Parallel Processing Platforms.
b. Highlight Big Data Analytics applications with one case study. (II

Modale--2
3 a. What are the core components of Hadoop? Explain in brief its each of its components.
(I0Marlu)
b. Explain Hadoop Distributed File System. (10

OR
4 a. Define MapReduce Frame work and its functions. (06
b. Write down the steps on the request to MapReduce and the types of process in MapReduee.
(10
c. Write shon notes on Flume Hadoop Tool. (14 Marlu}

.Mll!IJLltl
5 a. Discuss the characteristics of NoSQL data store along with the features in NoSQL
transactions. (OI Marlu}
b. With neat diagrams, explain the following for shared-Nothing Architecture for Big Data
Tasks,
(i) Single Server model
(ii) Sharding very large databases
(iii) Master Slave distribution model.
(iv) Peer-to-Peer distributioo model. (12 Marlu}

OR
6 a. Define key-value store with eu~lc. What arc the advantages of key-value storc?(I0 Marlu)
b. Write down the steps to provide client 10 read and write values using key-value store. What
are the typical uses of key value store? (10 Marlu)

7 a. With a neat diagram, explain the process in MapReducc when client submiuing a Job.
119
b. Explain Hive Integration and work flow steps iO\'Olvcd "·ith a diagram. (10 Marlul

1of2
 1:13 ,Ill LTE •

< Big-Data-Analytics-18CS72 ...

18CS72.
OR
8 a. Using l·livcQL for lhc following:
(i) Crca1e a table with panition.
(ii) Add, rename and drop a panition 10 a table. (IIMarb)
b. Whal is PIG in Big Oa1a? Explain the features of PIG. (IIMarb)

9 a. In Machine Learning explain linear and non-linear rcla1ionship wi1h essential graphs.
(ltMarb)
b. Wrilc the block diagram of1ext mining process and explain its phases. (It Marb)

OR
10 a. Define multiple reg,cssions. Write down 1he examples involved in forecasting and
op1imiza1ion in regression. (II Marb)
b. Explain lhe parame1~ in social graph ne1work topological analysis using centralities and
PagcRank. (ti Marb)

2of2
 1:12 ,Ill LTE

VTU Question Paper of 18CS...

ij8'(fS 5:ijtlt ~M e
""' I\ I I I I I I I I , -'> l,CS7'
·Se,}iJtb
. // Semester B.E. Dearee Examla,.~uly/Auau1t 1011
:--..,_ • /: j Big Data Anl\lr_t •
. ---<,/ ....
~tj1>rs, (' Max. Marks: 100

Nou: A,.,_ 01ty FIVE f.U ...,

dloos/ltf ONE ft,/1 fUSIUHlfroa .-cJ,
,
I L Define Data, Web data. Big da~~ explain llnlctured...~ unstructured
data. Uy (II Martu)
b. Lisi explain the c ics of big data. IUUSIOle by considering an example of
E-commerce, how big it _- \ (II
~• OR v
2 a. With a neat dia~xplain the function of -h of the live layers in big data arcltitccture

b. ::i-~ ~ D a t a Analytics s t a c ~ analytics tasks? : : :::::

3 a. With a~t'diagram, explain HJ!'!~~DC111s and ecosystem componcnu.

(NMartu)
b. Briefout the features ofHadoo.,P HDFS? Also exp~io. the functions of Name Node
Node. _ ,('),_,_, . . ' J (N Martu)
c. Explain any two H D r ~ with examplel,- 'ti.)
~:-
(N Maru)
\.)
OR,~·
,
4 •. Explainthefo~; : 'J ('~
(i) H~~block replication •~• (ii) HDFS sai, inodc.
(iii) Rack-awareness C'- (iv) Name Node high availability. (12 Martu)
b. DISCUSS the Apache lqOOp I ~~Export neat diagrams (N Martu)

(j
example explain ~c'l;faluc slo~
I\ .,OR
a
L Lisi ~...,arc the ~ ~ B , / l ~ < t > ~ and Parquet data stores.
b.
111MaruJ
(II Martu)

6 L Discuss the usag~MongoDB, CouchDB, Oracle NoSQL and R.iak. (IIMarb)

b. Lisi the Pro~ Cons ofdistrifiu!~ using sbarding. (15Marb)

,
c. Give the ~arison bctw=i J\ToSQL and SQURDBMS.

. MapRcducc Ex~x,n steps

7 L Describe Mmllllt:ih -~--•
wit a neat ......... (12Marb)
b. How node failure can,~ lfandlcd in Hadoop? Discuss.

I I. With a neat d ~ dcscnoc Hive ~~ion and work flow steps. (IIMartu)
b. Explain withjlclum type and Syntax the Hive built-in functions. (IIMarb)

a' I of2
 1:12 ,Ill LTE I•

VTU Question Paper of 18CS...

18CS72

9 •
a. DISCIISS RcgrcssK>n
• AnaIys15 usmg
• Lmear
~ a n dNon•1·tncar ~K>n
- ~ - models. (IIMulls)
b. Explain with an example Apriori algorithm to evaluate ~ c key. (IIMulls)
~.,
OR ~•
10 a. Write a oote on: "1._V
(i) Web mining .~ ,.,_·
(u) Web content mining. •
(iii) Web usage mining. " C; (12Mub)
(NMulls)
~: ~~~~"';'~-comm;~lo'm social netwocl<; , ~ (NMub)

..... (j
,
s~
r- ..
I\~
&
~:.c
~,

, &
c
2of2
 USN
7
cr,TjE /-P 'Ir'h'lrr 'I$'/o-GGJ.=-7:;..:l..
18CS72

Stnn lh Stn,..,., H.E. l>tRrt t Fum l~~ I

• n, • on./Fe h. 1013
. 'II data Anll} rt •
Tim,: J hr~. '-"""-"'Q
."""'-J Mn.x Mark~ 100
nn~ rach mnd•lr.
N"',: A•.•·•.,., ••J' FIVF. f11// qum/nn .,, ~"t.r ; ONF. full quml
,-..
a. Define llig dn1n. E>.pL,in 1hc ctas-rr-ti~t~Y!rif,1
& ata. £,.~
d .L"'l
b• Define Sc~an ·•
I b'I• ahu
1 rt)
•
i1s l)~alo ng with examples. , V flO ~hrtu1

• . OR -0
design with a di.ag,am.
a. E>.plam the func11 0ns~x h layer in Big data ar~_eeturc
. . (10 M•rlut
b. Define da1a • E .
xplam m bncflhc nee sofprcproccssing. (10Mar1u)
prep~ mg.

. ' Modu ii
W~1 IS f:!Q~? Highlight the imponant design features of
the HDFS. (10
3 a.
example.
b. Brmg 9u~e concepts of the HDFS,blo1k replication with an 110

4 a. E><plain Apache sqoop impor tl~:po ~:cth odJ(.~ £iagr am. (10
~.,,,,
b. Demonstrate any SIX !-!Dase commands with orP,°ut.\ ......
~- v .'-"
,
5 a. Explain about NOSQ t data store and its,c,haractcristics. (10

b. Dc,scribc the print"1plc of working of the CAP theorem. L>,-...., (10

,. 7 ~- ~/
~ , OR ~'
e. (IOMan .t>
6 a. Dcmonstratc'ihc working of k~y•valUc store with an exampl
Ip< features ofM•f lO?B, and its indus.f ~tpplic alion. (10 Marks)
b. Dcsc,2 ~
- ,
7
' r'-'
a. 4.0csc rihc the Map tasks~ ~ucc tasks and'M ~ Reduce Executi
on process. {10 Mariu)
(IOMa N)
~'ncs cribe the Hive ~itcct urc and ils c;a4ctcristics.

.(} OR .
),e pig archi1ec1ul(fo~.scrip1S data flow and process ing. (10 Marks)
8 a Dcmonstra1(..!
industrial applica tions for each. (10 Man<>)
b. Dilfer enl~~ wccn Pig and ~•p'Rc duce, give

9 a. Explain lhc simple lin~~rcss ion ~;,~~t5 .

(10 ~hrtu>
(IOMar o)
b. Demonstrate frcquen~1efll set mining and associatK>n rule mining

/'~ . OR . (10 Mariu)

ng.
JO a. With a neat dial!lam, write the steps m K-means clusteri (IOMa ro)

.....
of web usage analyti cs and lhc signific ance of web graphs.
b. Explain 1hc'purp';,sc

/"<,,
,
 II!,~ I IIIIIIII I I •M< sn
s~•·• ·n•h s,•nu ••h•r 11 •· n. 11 .
• • .. ' "'•· ••·• .. •11•n\1i on, .lunc l.luly 202.l
••11 Dat a an4 A~• vt•c •
I 11'1<'
·~ ' q
"'M n, Mnrk o: l()(J

.,._,. 1·w1,· ""II ' '" euclt mmlu l,.

.,.,, qNr.,-,1,,~Al>f,.1·/nK ONh" f"II 'IH«' ,r~/,"
,.,....,
•

._"''M iulJw ::l "' /

• "'
lX'hnC" h1~ ,I run. lllhl t•~,,li,in h) ch11rn~tl'rlsth:11. IMMa rt.o
1 l)t i,n~J t~,plnin dilli.·l\.·ntdatft )1Hm,· c$. ICMM.,1u1
I 'J'llnm U1g d111n ck!Ci~1in~ at\'hit1.•<.·lln''l', IIOMa riu)

OK
l n F
nin 1h ~_ 11 ncti~ ts ~,fl'lh. 'I~ Oflhc Uig Quory lnycrs in big dnln nrchhcctun.: design using
U~~IQ
1
(10 Mer1u )
·~ Ut'I') . ,u'.J StrVl\ .'l' Ill~ ,oo~ll
1 ' Cloud..J'lu1ronn.
h. ( 1) I ~plw,1 big dutn nnul)·l 1.;s npplk1 1titm~ 1

is. ID!Mart..1)
(1i) Wri\1,.• n !hort 1101c on dntn sturui jc lllld nnnl)'s

.. . . ~lli.! !!!!c l
J n \\ llh o 111,.~111 dtngrmn. cxplmn lhS,l'Ul11po11c111.s ofl
IIJA.S1Q_ttdoop Dis1ribJ~On File S)Stcm).
I
llndo op Mt1p Jkduc
'°'
c d111t1 llnw
"~ \ (10Ma r1o)
wor; fur a word co"°t.lflru~11un'l Give an
b. lo,\ docs thL~
' :,;•. . . Y (lOM arkt)
~,run pk:.

()I( 'II "

,oncnts nnd working ot'upnchc flume
.a 11. Whal 1s APACHl: Flume'! IX.·scrihc the Ji:uturc com1 (10 Muiu )
live in hudoop. tlOM arin)
b. 1-:.Apluin UH.' li:allm.•s und tx·ncfi1s ofnpu chc I

.M.!!lll!.lcl ' nmplc. . tlO Mar\., )

5 •· JJiscu,,,NOSQI. dutu un:hilec\'"" pullcrn. with m1;cx ems. (IOMori<,\
probl
b. Explain four diflcn:n• "(:t lot handling big~ u
~, OR\
(0~ Marki )
6 •· (i) E•pluin dillc~nv6mponcnts ofCussm,dm. (°'Ma r1u)
(ii) Exploin dillcrcn( dutu types bu ill Into Cussundrn.
tics.
lkscr ibc d19i-rcnt CQL com ~,ls und their li111ctionuli
(°' M•rkt )
b. (i) (05Ma r1u)
(1i) Writ e• ~,,n note on NOS~!. lo Munugc llig 1)11111.

Modul1•·:I \IOM ,rl"l

JJcs.ribc lhc signilicunce ofnp11d1c pig in hudoop. h-ducc
"·
b. With II ncol diugru111. cxpluin
Mupl(c~lucc l'n1grn111111ing model. I low docs Mupl
ms·1
enables 4uel)• prouo~slng 411iclly in llig 1>11111 l'rublc

.., ()I(
\10 Mari<,)
u. Explain I live •rd1il<'CIUI\: with II IICIII diu11nu11. (0~ M1ri<1)
cc.
b. (i) Oil~rcnllnlc bclwt-cn l'ig ttnd Mupltc'<lu (0~ Markt)
(ii) ~rile.a short note on l'i1111rd1ilc..:lllrc dcsi1111 luycrs.
' I of2
 t•
1 i f:£
I
JfHU l-'P
1 : rtl ltf!HI !hi

18CS72 '
M!lllJlltl
9 L What are outliers? Describe the rcl\50n, fonhc prcscnccdtoutlicrs in a rclatlon5hjp
,•
b. llow can a uni\'crsily student's GP/\ be prcdlc~ from his/her - high school pcrc.cniasc
(HSP) of marl<,? (A5Sume linear n:gn:nion~~••gruph for the same.•") (10 ~1,,1..1

,'-i..-
10 a. Discuss the dilfcn:nt phases of text min\ng process. ,C't (IOMariu)
b. Write a short note on text mining and Web mining. L"-.." IOSM.utu)
c. Discuss thn:c phases for web usage.mining.
,, ,
; ,
.-._;
~? ,
~';, ,
§t
I\"- :'\

,
--~
~I ~-·
:',
,
~- ,

,
,

I',
"
,, ,~
,
,

I
,CJ