Scribd
Upload
139 views

Roll No. B.E / B.Tech (Full Time) D E G R E E End Semester Examinations, April / May 2014

This document contains information about an exam for an eighth semester degree in information technology. It includes 15 multiple choice and written response questions covering various topics in soft computing, including neural networks, fuzzy logic, genetic algorithms, and Bayesian belief networks. Students are asked to define key terms, provide examples, compare different models, perform calculations, and explain processes related to these topics. They are also asked to implement some examples in MATLAB and C++ to demonstrate applications.

Uploaded by

gpalanimca
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
139 views

Roll No. B.E / B.Tech (Full Time) D E G R E E End Semester Examinations, April / May 2014

This document contains information about an exam for an eighth semester degree in information technology. It includes 15 multiple choice and written response questions covering various topics in soft computing, including neural networks, fuzzy logic, genetic algorithms, and Bayesian belief networks. Students are asked to define key terms, provide examples, compare different models, perform calculations, and explain processes related to these topics. They are also asked to implement some examples in MATLAB and C++ to demonstrate applications.

Uploaded by

gpalanimca
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

Roll No.

B.E / B.Tech ( Full Time ) D E G R E E END S E M E S T E R EXAMINATIONS, APRIL / MAY 2014


INFORMATION TECHNOLOGY
Eight Semester
IT9035 & Soft Computing
(Regulation 2008)
Time: 3 Hours

Answer ALL Questions

Max. Marks 100

PART-A (10 x 2 = 20 Marks)


1.

What is the necessity of activation functions?

2.

Distinguish between Madaiine and Adaline.

3.

What is the cardinality of a fuzzy set? Whether a power set can be formed for a fuzzy
set?

4.

How is fuzzy relation converted into a crisp relation using lamda-cut process?

5.

List the various applications of fuzzy logic controller.

6.

Give an example on extension principle.

7.

State the importance of genetic algorithm.

8.

Define the cut and splice operation.

9.

State the taxonomy of the crossover operator.

10.

What are the syntactic message passing features in Bayesian belief networks?
Part - B ( 5 x 16 = 80 marks)

11.

a)
b)

Compare feed-forward and feedback network.


(8)
Construct and test a heteroassociative memory net to store the given vector pairs:
' S(1)=(0 0 0 1), t(1)=(0 1)
(8)
S(2)=(0 0 1 1 ) ,
t(2)=(0 1)
S(3)=(0 1 0 0),
t(3)=(1 0)
S(4)=(1 1 0 0),
t(4)=(1 0)
Also test the network with "noisy" input patterns

12.

a)

i)

State fuzzy set operations and properties of fuzzy sets. Why the excluded
middle law does not get satisfied in fuzzy logic.
(8)
ii) The discretized membership functions for a transistor and a resistor are given
below:
(8)
u = { 0/0 + 0.2/1 + 0.7/2 + 0.8/3 + 0.9/4 + 1/5 }
u = { 0/0 + 0.1/1 + 0.3/2 + 0.2/3 + 0.4/4 + 0.5/5 }
Find the following (a) Algebraic sum (b) Algebraic product (c) bounded sum
(d) Bounded difference.
T

(OR)
b)

i) With a suitable examples, explain how membership assignment is performed.(8)


ii) State the necessity of defuzzification process. Calculate the A.-cut for the

following fuzzy sets in Zadeh Notation


A = 0/0.2+ 0.8/0.4+1/0.6
And B = 0.9/0.2 + 0.7/0.4 + 0.3/0.6
Express thefuzzy^ets into X =0.7 for the following ogerations^.
i) A ii) B
iii) A U B iv) A D B
v) A D B vi)) A U B

13.

a)

b)

(8)

Explain the architecture of a fuzzy logic controller and the steps involved in
designing a fuzzy controller with suitable example.
(16)
(OR)
i) How are necessity and possibility measures obtained from belief and plausibility
measure? Explain it.
(6)
ii) Consider the two triangular-shape fuzzy number A and B.
(10)
0
.forjf s 1 aikix > 3
&
for -1 < x < 1

IT

* si?)

U-1.1/2

t-ii 1 < A < i

14.

a)

Calculate the fuzzy numbers A+B, A-B, A .B and A/B


i) Explain in detail the various operators involved in genetic algorithm
(8)
ii) Show the first 2 cycles of genetic evolution for optimizing the function y=x in the
interval of 0 < x < 12. Use set P = {1100, 1010, 1011, 0011} as initial population.
(8)
(OR)
i) State and explain the classifications of the parallel genetic algorithm
(8)
ii) Explain the bucket brigade algorithm with example.
(8)
3

b)

15.

a)

b)

ij Expiam the issues when designing a genetic algorithm for intelligent internet
search.
(8)
ii) Implement OR function with bipolar inputs and targets with a MADALINE neural
network in Matlab.
(8)
(OR)
i) Write a C++ program to apply back propagation network for a pattern recognition
problem.
(8)
ii) Describe the optimization of travelling salesman problem using genetic algorithm
approach.
(8)

You might also like