0% found this document useful (0 votes)
13 views4 pages

Act CWQP

The document discusses various advanced topics in data science and machine learning, including algorithms like Levenberg-Marquardt and k-nearest neighbors. It also covers concepts related to image processing, data mining techniques, and the architecture of parallel computing systems. Additionally, it highlights the advantages and disadvantages of different methods and technologies used in these fields.
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)
13 views4 pages

Act CWQP

The document discusses various advanced topics in data science and machine learning, including algorithms like Levenberg-Marquardt and k-nearest neighbors. It also covers concepts related to image processing, data mining techniques, and the architecture of parallel computing systems. Additionally, it highlights the advantages and disadvantages of different methods and technologies used in these fields.
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/ 4

Advonod Carulig echnaues

(ouise work poper- !

fue 6luesi os (5x 20 1n)


1. a) 2llustrate he shuctue
Maps amd kow Ihe shuchure kas romid
Yur kohonen Mop.
6) Lluidat to ndestand Levenberg- Marquardt
(M) Algoritim.
diffeen us belun luzzy Set and
a) piscus Ie
Ci set, abyo biyhaiglt
tuzy sets buasi-Nettoy nethad
b) Cluudat to wndevstand

diffaNene benan Smoothisy and


a) tgbo the inage aud Luplain
shanpening iler in
fllars,
1) and
advanjags
image Carnpratiy aud
fuind out ha lages Tast Effiuent lossles
a) lear skalh on (ELIeS).
tnyukion syg an
'naage
Calgorie
sdianqs aud disedvanags
Datk
3. a) Answer e
teit ning
prous. (3)
(i) Descne aud liA ut ie Dak nini technigues
clustuig 3)
4)
chii) Discriinale : clasiziatm and
Relearse k- nearekt negh sors Agoithm
b) with reevent ample.
(SUM)
veter Maehine tlgsihm nith
a) tppise Supput
suitabee
Random
b) Ascertain itk a lear sketch en

inputs
in data einis aud
4 a) Brieg out

Cons.

b) Sketh cut ae six phaes tae Dat nciaiy


Lije gle. ndei in Data
ot he methods
a) List out any tro metkods Nhich
einie aud orie wed ils relevert
we
example VLDB i6sues and
b) Analyz2e frOst a Cmin
Cemmn Causes.
uilislo mabis slock
Sygtem
muliproAtn Parallel
'aud Matix Shat 6)
algstim multpicahm
fanor nuliplicahn
modal. memrybisibubed
2lws a)
aud model meog eMoy shared
hared aehale
characterishcs. arhitecture
4
Elueidat
ta a) 7.
MIMD
menuoYydismbubed
tefg wire tù)
Wnee
Nrite 6)
6)
Discs
to
bale ills
issues. its aud SEe COMseunty. newok
prape 4)
ompoans te
prepae ) 6.
Netwr mlasres tha nobe a
ellman Diffie weyou do
how Cmen, tis in
priate awd puttie csiate Dis
b)
aplai and Sawiy foniy
5I2 in -AA s &256 SHA-
2sHA- Nhoat
is b)
Encryphu Asymmetne Ec ie out Btiey
enyplim. yile andSeeany Proukser
mwed algunthm( ALS tae Asa a)
5.
seLun
y. maiElaehonic
l
Disus
to b)
a
notGummaize
e
njorm. Hough winydetecim Boundy &
Linkig Edge illshae
tae Compare
to b)
segmentatn image debectn
and
boundy techniges
wsed
f Esplain
te A)
architeture. ART1 Adapixewith Corelate
it
xplain 4)
aud Koy Resmane Adaptve 8
Cormapuig fanalel
erpLeug
ad
cenplexity TimTiAnalye:
ent 8) 1.

You might also like