Unit – II
1. Define core of a membership function.
The core of a membership function is defined as the region of universe that is characterized by
complete and full membership function in the set.
2. Define support of a membership function.
The support of a membership function is defined as the region of universe that is characterized
by non-zero membership function in the set.
3. What is a normal fuzzy set?
A normal fuzzy set is one whose membership function has atleast one element x in the universe
whose membership value is unity.
4. Define height of a fuzzy set.
Height of a fuzzy set is the maximum value of membership function in a given set.
5. Define crisp ordering.
For issues or actions that are deterministic there is no ambiquity in the ranking, we call this as
crisp ordering.
6. Define degree of consensus.
The individual preference of those in the decision group are collected to form a group metric
whose properties are used to produce a scalar measure of “degree of consensus”.
7. Define crisp ordering.
For issues or actions that are deterministic there is no ambiquity in the ranking ,we call this as
crisp ordering.
8. Define a convex fuzzy set.
A convex fuzzy set is described by the membership function whose membership values are
monotonically increasing or decreasing.
9. Define degree of consensus.
The individual preference of those in the decision group are collected to form a group metric
whose properties are used to produce a scalar measure of “degree of consensus”.
10. Define height of a fuzzy set.
Height of a fuzzy set is the maximum value of membership function in a given set.
11. List the three operators in GA
Cross over, Mutation and Reproduction.
12. Define Reproduction.
Reproduction is the process by which strings with better fitness values receive correspondingly
better copies in the new generation.
13. Define Mutation.
Mutation is the process in which strings are able to mix and match their desirable qualities in a
random fashion.
14. List the properties of crisp sets?
Commutativity AUB=BUA
A∩B= B_A
Associativity AU (BUC) = (AUB) UC
A∩ (B∩C) = (A∩B) ∩C
Distributivity AU (B∩C) = (AUB) ∩ (AUC)
A∩ (BUC) = (A∩B) U (A∩C)
Idempotency AUA =A
A∩A=A
Identity AUØ=A
A∩X=A
A∩Ø=Ø
AUX=X
Transitivity If A ≤ B ≤ C, then A ≤ C
Involution A=A
15. What are fuzzy relations?
Fuzzy relations R is a mapping from Cartesian space X ×Y to the unit interval[0,1] where the
strength of mapping is expressed by the membership function of the relation for ordered pairs
from the two universal or μ (x,y)
R
PART B
Unit - II
1. Explain the different types of membership function used in fuzzification process.
EXPLANATION OF MEMBERSHIP FUNCTION WITH FUZZY SETS
2. Write a Short note on Gustafson Kesssel Algorithm.
3. What is Hard and Fuzzy partitions.
4. Explain Fuzzy C Means Clustering.
5. Explain Fuzzy Supervisory Control.
It can be explained with any one example. – given some introduction.
6. Discuss in detail the basic feedback control system and how it can be implemented
with fuzzy system.
7. Explain Triangular Fuzzy Number and Trapezoidal Fuzzy Number.
8. Explain clusters and prototypes in Fuzzy C-means Clustering.
‘
