Scribd
Upload
66 views2 pages

Elective-III: Pattern Recognition: B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)

This document contains a practice exam for the Pattern Recognition elective course. It consists of 12 questions divided into multiple choice sections. The questions cover topics like the design cycle of pattern recognition, applications of pattern recognition, supervised vs unsupervised learning, probability distributions, decision boundaries, confusion matrices, backpropagation algorithms, support vector machines, Hidden Markov models, fuzzy classifiers, kernel functions, clustering algorithms, and k-means clustering. Students must choose questions from each section to solve, with questions worth between 6-7 marks each. Diagrams and examples are required where appropriate.

Uploaded by

A J
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
66 views2 pages

Elective-III: Pattern Recognition: B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)

This document contains a practice exam for the Pattern Recognition elective course. It consists of 12 questions divided into multiple choice sections. The questions cover topics like the design cycle of pattern recognition, applications of pattern recognition, supervised vs unsupervised learning, probability distributions, decision boundaries, confusion matrices, backpropagation algorithms, support vector machines, Hidden Markov models, fuzzy classifiers, kernel functions, clustering algorithms, and k-means clustering. Students must choose questions from each section to solve, with questions worth between 6-7 marks each. Diagrams and examples are required where appropriate.

Uploaded by

A J
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/ 2

http://www.rtmnuonline.

com

B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)


Elective-III : Pattern Recognition

P. Pages : 2 NRT/KS/19/3692
Time : Three Hours *0696* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Assume suitable data whenever necessary.
10. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Explain the design cycle of pattern recognition with block diagram. 7

b) Explain various application of pattern Recognition with example. 6

OR

2. a) Define pattern Recognition. Also explain it's design principles. 7

b) Write a short note on. 6


i) Supervised learning
ii) Unsupervised learning
iii) Reinforcement learning

3. a) Illustrate the concept of minimum risk estimators with example. 7

b) What is conditional probability? Explain its characteristic.

OR

4. a) Differentiate between probability distribution and probability density functions with 7


example.

b) Explain joint Distribution and Densities with example. 6

5. a) Define minimum error rate classification and its relation to Bayesian risk minimization. 7

b) Explain Decision Boundaries in detail with example. 7

OR

6. a) What does a confusion matrix do? Explain in detail with proper example. 7

b) What is characteristic curves? Explain in detail with example. 7

NRT/KS/19/3692 1 P.T.O

http://www.rtmnuonline.com
http://www.rtmnuonline.com

7. a) Write and explain about back propagation algorithm. 7

b) How does support vector machine (SVM) work explain in details. 7

OR

8. a) Explain Hidden Markov model in detail. 7

b) What is fuzzy classifier? Explain fuzzy based classifiers. 7

9. a) Explain Smooth kernel function and its interpretation. 7

b) Explain Adaptive Decision Boundaries with example. 6

OR

10. a) What is Histogram? How is a real histogram mode? 7

b) What is kernel and window estimators explain in detail. 6

11. a) Differentiate between hierarchical clustering and partitional clustering techniques. 7

b) Describe k-means clustering algorithm with example. 6

OR

12. a) What is clustering? Explain types of clustering. 7

b) Explain any one hierarchical clustering algorithm basic steps with suitable example. 6

************

NRT/KS/19/3692 2

http://www.rtmnuonline.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy