1.

Define Soft Computing

Soft computing is a set of algorithms, including neural networks, fuzzy

logic, and genetic algorithms. Soft computing is the use of approximate
calculations to provide imprecise but usable solutions to complex
computational problems. The approach enables solutions for problems that
may be either unsolvable or just too time-consuming to solve with
current hardware. Soft computing is sometimes referred to as computational
intelligence.
2. Differentiate Supervised and Unsupervised Learning.

The main differences between Supervised and Unsupervised learning are

given below:

Supervised Learning Unsupervised Learning

Supervised learning algorithms are Unsupervised learning algorithms

trained using labeled data. are trained using unlabeled data.

Supervised learning model takes Unsupervised learning model does

direct feedback to check if it is not take any feedback.
predicting correct output or not.

Supervised learning model predicts Unsupervised learning model finds

the output. the hidden patterns in data.
In supervised learning, input data is In unsupervised learning, only
provided to the model along with the input data is provided to the
output. model.

The goal of supervised learning is to The goal of unsupervised learning

train the model so that it can predict is to find the hidden patterns and
the output when it is given new data. useful insights from the unknown
dataset.

Supervised learning needs Unsupervised learning does not

supervision to train the model. need any supervision to train the
model.

Supervised learning can be Unsupervised Learning can be

categorized in Classification and classified in Clustering and
Regression problems. Associations problems.

Supervised learning can be used for Unsupervised learning can be

those cases where we know the used for those cases where we
input as well as corresponding have only input data and no
outputs. corresponding output data.
 Supervised learning model produces Unsupervised learning model may
an accurate result. give less accurate result as
compared to supervised learning.

Supervised learning is not close to Unsupervised learning is more

true Artificial intelligence as in this,
close to the true Artificial
we first train the model for each
Intelligence as it learns similarly as

data, and then only it can predict the a child learns daily routine things
correct output. by his experiences.

It includes various algorithms such It includes various algorithms such

as Clustering, KNN, and Apriori
as Linear Regression, Logistic
algorithm.
Regression, Support Vector
Machine, Multi-class Classification,
Decision tree, Bayesian Logic, etc.

3. Define the term Neural Network.

A neural network is a series of algorithms that endeavours to recognize
underlying relationships in a set of data through a process that mimics the
way the human brain operates. In this sense, neural networks refer to
systems of neurons, either organic or artificial in nature.

4. Differentiate Single layer and Multilayer Perceptron.

 Single Layer Perceptron - This is the simplest feedforward neural network and
does not contain any hidden layer.
Multi Layer Perceptron - A Multi Layer Perceptron has one or more hidden layers.

A Multi Layer Perceptron (MLP) contains one or more hidden layers (apart from one
input and one output layer). While a single layer perceptron can only learn linear
functions, a multi layer perceptron can also learn non - linear functions

5. What are the Fuzzy Composition methods

There are another 2 types of composition they are “max product

composition” and “max min and max product composition”

6. Define Fuzzy Equivalence Relation.

A fuzzy relation µ on X is a fuzzy equivalence relation if it is a fuzzy
reflexive, symmetric and transitive relation on X. A fuzzy relation µ on X is
a fuzzy G-equivalence. relation if it is a fuzzy G-reflexive, symmetric and
transitive relation on X.
7. List the constraints in GA.

8. Differentiate Fine grained and Coarse grained PGAs

9. Define the constraints of ANFIS
The computational cost of ANFIS is high due to complex structure and
gradient learning. This is a significant bottleneck to applications with large
inputs. Broadly, the limitations are: (a) the type and number of membership
functions; (b) the location of a membership function; and (c) the curse of
dimensionality
10. What is meant by Linear Separability?
Linear separability is the concept wherein the separation of input space into
regions is based on whether the network response is positive or negative.
A decision line is drawn to separate positive and negative responses.