LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
SECOND SEMESTER – APRIL 2007
CS 2952 – NEURAL NETWORKS
Date & Time: 21/04/2007 / 1:00 – 4:00Dept. No. Max. : 100 Marks
PART – A
Answer ALL the questions 5 x 2 = 10
- Define the term Neural Networks.
- What is called Activation of a Node?
- Explain Madaline in short.
- Write a short note on Heb Rule.
- What is a Maxican Hat net?
- What is meant by Self-Organizing Nets?
- Is there any difference among various versions of ART Networks?
- Provide a short description on Forward-only Counterpropagation.
- What is called White Noise and Coloured Nosie?
- Define the term Annealing.
PART – B
Answer ALL the questions 5 x 8 = 40
- (a) Brief the Applications of ANN.
OR
(b) Explain Perceptron in detail.
- (a) Brief Bidirectional Auto-Associative Memory Nets.
OR
(b) Explain Auto-Associative Memory Nets.
- (a) Explain LVQ.
OR
(b) Explain Counterpropogation Nets.
- (a) Write the Algorithm for ART Networks.
OR
(b) Present the structure of ART and explain Two-Third Rule.
- (a) Explain Neocognitron Networks without Algorithm.
OR
(b) Demonstrate Cascade Correlation.
PART – C
Answer any TWO questions 2 x 20 = 40
- (a) Brief the Mile stones in History of Artificial Neural Networks, by
highlighting on breakthroughs by scientists.
- Write an essay on Iterative Auto-Associative Nets.
- (a) Briefly explain Fixed-Weight Competitive Nets.
- Explain ART Networks.
- (a) Present the Backpropagation Network Architecture and explain it with the
Algorithm.
- Write about Recurrent Nets.