IV Semester M.Sc. (I.T.) Examination, December 2009/january 2010 Embedded Systems (Repeater)
IV Semester M.Sc. (I.T.) Examination, December 2009/january 2010 Embedded Systems (Repeater)
IV Semester M.Sc. (I.T.) Examination, December 2009/january 2010 Embedded Systems (Repeater)
P.T.O.
IV Semester M.Sc. (IT) Examination, Dec. 2009/Jan. 2010
COMPUTER COGNITION
(Repeater)
Time : 3 Hours Max. Marks : 75
PART A
Answer all questions.
(Question 1 carry 1 mark and question 2 to 13 carries 2 marks each). 25
1. What is sampling ?
2. List any two simulated tools for Computer Cognition.
3. List any three different alternate names for Neural Networks.
4. What is the capacity of a Perceptron ?
5. What do you mean by learning in an ANN ?
6. What are the limitations of Back propagation algorithm ?
7. What is a use of Laplacian operator ?
8. What is function approximation ?
9. What are the parameters of the Gaussian function ?
10. What is an illposed problem ?
11. What is unsupervised learning ?
12. What are dynamic learning algorithms ?
13. Explain genetic algorithms.
PART B
Answer any five questions : (510=50)
1. Derive the expression for the error co-efficients used in the update of the weights
in a MLP network.
2. Explain the K-means algorithm for obtaining the optimal centers for the RBF units.
3. What is convex hull ? Can a three-layer BP network solve any classification problem ?
Explain.
4. Discuss how growing cell structures overcome the drawbacks of Kohonen network.
5. a) What are the differences between uni-modal and multi-modal functions ?
b) Explain structure of a simple genetic algorithm.
6. Discuss the advantages and disadvantages of Evolution Programming and Evolution
Strategy.
7. Write pseudo code for learning CFS and non-learning CFS.
8. Explain Genetic Program and Classifier System in detail.
P.T.O.
IV Semester M.Sc. (I.T.) Examination, December 2009/January 2010
IMAGE PROCESSING
(Repeater)
Time : 3 Hours Max. Marks : 75
PART A
Answer the following : (210+51=25)
1. Name any 4 applications of Image processing.
2. Define digital image.
3. What is a pixel ?
4. Define sampling.
5. List different levels of data representation.
6. Give the equation of Discrete Fourier Transform pair.
7. List the categories of Image processing.
8. Name the types of data redundancies in image processing.
9. What is image segmentation ? Name the different techniques available for image
segmentation.
10. What is false contouring ?
11. Briefly explain the following :
i) thresholding
ii) histogram
iii) image restoration
iv) sobel operator
v) quantization.
PART B
Answer any five : (510=50)
1. Explain the steps involved in Digital Image Processing.
2. Explain Digital Image properties.
3. Describe the different topological data structures.
4. Show that the Fourier Transform of the convolutes of two functions is the product
of their Fourier transform.
5. How do you restore images from degradation ? Explain.
6. Explain lossy predictive encoder and decoder with block diagram.
7. Explain the different boundary descriptors.
8. Explain split and merge algorithm.