BTS (C)- VIL-(S) - 06 ~ 037 (U) B. Tech Degree VII Semester (Supplementary) Examination June 2006 EB/EC/CS 705 (C) ARTIFICIAL NEURAL NETWORKS {Urior 0 2002 Admissions) Time : 3 Hours Maximum Marks : 100 L (9) Desin aMLP neared 2 siete two input XORprten. Meat eee pal pied an it ih a LL (@ Whats dts lmsing rio? Hist te liceato, @) (b) Write down the expression for sigmoidal and Gaussian activation functions and draw them. How activation funetions arc classified? a2 cum en kL Phe oe ee ee @) (b) Explain the BP algorithm: with momentum and smoothing? How it improves the performance of standard BP algorithm? 2) OR IV. (a) What do you mean by over Ieaming? How the problem is eliminated? (0) How the local minima problem is deait in BP training. Mention two stopping criteria in BP algorithm, a2) \V. (a) How training is applied te Kehonen layer? Explain with relevant equations. ao) (© Exp on piel aplication of counter propagation see networks, Go) ‘VL. (@) What is preprocessing of input vectors? Why it is requir:d? How initial weights arc decided in a network? How these factors will affect the network performance? ia) (&) Explain the structure of a feed forward counter propagat on network. ® ‘VIL (@) Whats sixmlated annealing? Explain how the concept is spp in awa tining? 10) (0) alan how scr serwck is apledn opinieion robes. vo. (@ compere he fotres of BP and Couey’ nig ger fms. Go) (©) Write down the Bottzman training slgorithm and explain the steps. do) TX (a) How discrete Hopficld network stores binary pattems? Explain the capacity limitations. 0) (©) Explain rotation and erosover operations in GA with c-amples, Qo) XX (@) How the data retrieval operation is performed in BAM? 0) (@) Explain the structureof AR:T-I type networks. do)