Soft Computing

Week 01 : Assignment 01
The due date for submitting this assignment has passed.

Due on 2024-02-07, 23:59 IST.
Assignment submitted on 2024-02-05, 21:02

IST
2 points
Which of the following is True?
a. Hard computing always requires fuzzy logic.

b. Soft computing is always more computationally expensive.
c. Hard computing is deterministic, while soft computing is probabilistic.
d. Soft computing always provides precise solutions.
Yes, the answer is correct.

Score: 2
Accepted Answers:
c. Hard computing is deterministic, while soft computing is probabilistic.
2 points
Which of the following best describes the range of values a fuzzy membership function
can take on?
a. (0 ,1)
b. [0 ,1]
c. (0 ,1]
d. (-∞ ,∞)

Score: 2
Accepted Answers:
b. [0 ,1]
2 points
Which of the following statements regarding crisp sets and fuzzy sets is correct?
a. A fuzzy set is a special case of a crisp set.

b. Fuzzy sets are subsets of crisp sets.
c. Crisp and fuzzy sets are distinct concepts with no relationship.
d. A crisp set is a special case of a fuzzy set.
No, the answer is incorrect.

Score: 0
Accepted Answers:
d. A crisp set is a special case of a fuzzy set.
2 points
A fuzzy set has a non-empty 1-cut (α-cut with α = 1). What can you say about its normality
and core?
a. It is guaranteed to be normal, and its core is non-empty.

b. It is normal, but its core could be empty or non-empty.
c. It is definitely not normal, and its core is definitely empty.
d. Normality and the core of fuzzy sets are unrelated to the 1-cut.

Score: 0
Accepted Answers:
d. Normality and the core of fuzzy sets are unrelated to the 1-cut.
2 points
A Gaussian membership function of x, with two parameters, c and σ, is given by
a.
b.
c.
d.

Score: 2
Accepted Answers:
b.
2 points
Two fuzzy set A and B are given by A ={(x1, 0.3), (x2, 0.9), (x3, 0.4)}, and B ={(x1, 0.1), (x2, 0.5), (x3, 0.4)}
Intersection of these two sets i.e. A⋂B is given by
a. {(x1, 0.3), (x2, 0.5), (x3, 0.4)}
b. {(x1, 0.1), (x2, 0.9), (x3, 0.4)}
c. {(x1, 0.1), (x2, 0.5), (x3, 0.9)}
d. {(x1, 0.1), (x2, 0.5), (x3, 0.4)}

Score: 2
Accepted Answers:
d. {(x1, 0.1), (x2, 0.5), (x3, 0.4)}
2 points
If A and B are two fuzzy sets with membership functions
μA(x) = {0.6,0.5,0.1,0.7,0.8}
μB(x) = {0.9,0.2,0.6,0.8,0.5}
Then the value of μ(A∪B)’(x) will be
a. {0.9, 0.5, 0.6, 0.8, 0.8}

b. {0.6, 0.2, 0.1, 0.7, 0.5}
c. {0.1, 0.5, 0.4, 0.2, 0.2}
d. {0.1, 0.5, 0.4, 0.2, 0.3}

Score: 0
Accepted Answers:
c. {0.1, 0.5, 0.4, 0.2, 0.2}
2 points
A ∩ B = B ∩ A This property is called
a. Associativity
b. Distributivity
c. Commutativity
d. Transitivity

Score: 2
Accepted Answers:
c. Commutativity
2 points
Two fuzzy relations are given by
The Max-product composition is

a.
b.
c.
d.

Score: 2
Accepted Answers:
a.
2 points
The set of all points x in X in a fuzzy set A is defined as a “core”, if
a. μA(X) = 0
b. μA(X) > 1
c. μA(X) = 1
d. μA(X) < 1

Score: 2
Accepted Answers:
c. μA(X) = 1
Due on 2024-02-07, 23:59 IST.

IST
2 points
What is the primary difference between crisp propositions and fuzzy propositions?
a. Crisp propositions always return a value between 0 and 1.

b. Fuzzy propositions always return a binary value.
c. Crisp propositions are two-valued, whereas fuzzy propositions can have values
between 0 and 1.
d. Fuzzy propositions are two-valued, whereas crisp propositions can have values
between 0 and 1.

Score: 2
Accepted Answers:
c. Crisp propositions are two-valued, whereas fuzzy propositions can have values
between 0 and 1.
2 points
In the context of fuzzy logic, which operation evaluates the minimum membership value
at each point?
a. P ∨Q
b. P ∧Q
c. P ⇒Q
d. P ⇔Q

Score: 2
Accepted Answers:
b. P ∧ Q
2 points
Which of the following operations is NOT associated with the T-norm operator?
a. Minimum
b. Algebraic product
c. Union
d. Drastic product

Score: 2
Accepted Answers:
c. Union
2 points
Given the conditional statement "If a student studies hard, then they will pass the exam,"
and the observation that "the student did not pass the exam". What is the valid inference
using Modus Tollens?
a. The student did not study hard.

b. The student studied hard.
c. The exam was too difficult.
d. The student will never pass any exam.

Score: 2
Accepted Answers:
a. The student did not study hard.
2 points
Given two fuzzy sets:
A ={(a1,0.3),(a2,0.6),(a3,0.8)} , B={(b1,0.4),(b2,0.5)}
find R=(B×A) ?
a.
b.
c.
d.

Score: 0
Accepted Answers:
a.
2 points
Which of the following defuzzification methods is not a centroid method?
a. Centre of gravity method (COG)

b. Center of Mass (CoM)
c. Centre of sum method (COS)
d. Center of Area method (CoA)
Score: 2
Accepted Answers:
b. Center of Mass (CoM)
2 points
Consider the two fuzzy sets
Using Zadeh’s notations, the fuzzy set A∪B into λ –cut sets for λ = 0.7 is
a. {0.7, 0.3, 0.6}

b. {0.4, 0.3, 0.6}
c. {0.5, 0.2, 0.6}
d. {0.2, 0.4, 0.6}

Score: 0
Accepted Answers:
d. {0.2, 0.4, 0.6}
2 points
Which of the following is the correct mathematical expression of the COG method?
a.
b.
c.
d. None of the above

Score: 2
Accepted Answers:
a.
2 points
What is the following sequence of steps taken in designing a fuzzy logic system?
a. Fuzzification → Rule evaluation → Defuzzification
b. Fuzzification → Defuzzification → Rule evaluation
c. Rule evaluation → Fuzzification → Defuzzification
d. Rule evaluation → Defuzzification → Fuzzification

Score: 2
Accepted Answers:
a. Fuzzification → Rule evaluation → Defuzzification
2 points
A fuzzy conjunction operation denoted as t(x,y) and fuzzy disjunction operator denoted as
s(x,Y) from dual pair if they satisfy the condition:
a. t(x,y) = 1 – s(x,y)
b. t(x,y) = s(1-x,1-y)
c. t(x,y) = 1- s(1-x,1-y)
d. t(x,y) = s(1+x,1+y)

Score: 2
Accepted Answers:
c. t(x,y) = 1- s(1-x,1-y)
Due on 2024-02-14, 23:59 IST.

IST
2 points
Which fuzzy inference system approach prioritizes interpretability at the expense of
accuracy?
a. Mamdani approach
b. Takagi and Sugeno's approach
c. Both approaches provide the same level of interpretability and accuracy.
d. The choice depends on the specific application and its priorities.

Score: 2
Accepted Answers:
a. Mamdani approach
2 points
What does the term "linguistic hedges" refer to in a fuzzy logic system?
a. Techniques for defining the universe of discourse

b. Methods for calculating membership values
c. Modifiers that adjust the meaning of linguistic terms
d. Algorithms for fuzzy inference

Score: 2
Accepted Answers:
c. Modifiers that adjust the meaning of linguistic terms
2 points
Consider a fuzzy logic system where the input variable is “Temperature” ranging from 0°C to 50°C. The
fuzzy sets for this variable are defined as “Cold”, “Warm”, and “Hot”. The membership function for the
“Warm” set is a triangular function defined by the points (10,0),(25,1),(40,0), where the function
increases linearly from 10°C to 25°C and decreases linearly from 25°C to 40°C. If the current temperature
is 30°C, what is the membership value of the “Warm” set?
a. 0.33
b. 0.5
c. 0.75
d. 0.67

Score: 0
Accepted Answers:
d. 0.67
2 points
Consider a fuzzy logic system that controls a heater in a room. The system takes two
inputs: the temperature x and the humidity y. The fuzzy sets
for x are Cold and Hot with membership functions μCold(x) and μHot(x), respectively.
Similarly, the fuzzy sets for y are Dry and Wet with membership
functions μDry(y) and μWet(y), respectively. The output z controls the heater and has
Low and High fuzzy sets.
The system has two rules:
1. If the room is Cold and Dry, then the heater is set to Low.
2. If the room is Hot and Wet, then the heater is set to High.
Now, suppose on a particular day, the membership functions for the inputs are as
follows: μCold(x) = 0.4, μHot(x) = 0.6, μDry(y) = 0.5, and μWet(y) = 0.5. Can you compute the rule
strengths for the two rules?
a. 0.5, 0.5
b. 0.2, 0.3
c. 0.4, 0.5
d. 0.24,0.25

Score: 2
Accepted Answers:
c. 0.4, 0.5
2 points
High interpretability is followed by the fuzzy logic controller (s)
a. Mamdani approach
b. Takagi and sugeno’s approach
c. Both a, b

Score: 2
Accepted Answers:
a. Mamdani approach
2 points
Limitations of the traditional optimization approaches are
a. Discrete (integer) variables are difficult to handle.

b. Method may not be suitable for parallel computing.
c. Methods may not necessarily be adaptive.
d. All the above.

Score: 2
Accepted Answers:
d. All the above.
2 points
The genetic algorithm works based on the mechanisms of
a. Neural network and natural language processing

b. Natural genetics and natural evaluation.
c. Artificial intelligence and machine learning.
d. None of these.

Score: 2
Accepted Answers:
b. Natural genetics and natural evaluation.
2 points
Combinatorial optimization is
a. NP‐Hard problem
b. NP‐complete problem
c. Scholastic Assessment problem

Score: 2
Accepted Answers:
a. NP‐Hard problem
2 points
In Steady-state Genetic algorithm
a. Population size is small and Chromosomes are of longer length.

b. Population size is small and Chromosomes are of smaller length.
c. Population size is large and Chromosomes are of smaller length.
d. Population size is large and Chromosomes are of longer length.

Score: 0
Accepted Answers:
a. Population size is small and Chromosomes are of longer length.
2 points
Fuzzy Logic Controller contains
a. Fuzzy rule base

b. Fuzzy inference engine
c. A fuzzification module
d. All the above

Score: 2
Accepted Answers:
d. All the above
Due on 2024-02-28, 23:59 IST.

IST
2 points
Which encoding method is useful in ordering problems such as the Travelling Salesman
Problem (TSP)?
a. Binary Encoding
b. Permutation Encoding
c. Value Encoding

Score: 2
Accepted Answers:
b. Permutation Encoding
2 points
Using a binary encoding scheme for a job-shop scheduling problem with three jobs (J1,
J2, and J3) and two machines (M1 and M2), how would you represent a solution where J1
is scheduled on M1, J2 is scheduled on M2, and J3 is not scheduled on any machine?
a. 100100
b. 100000
c. 100110
d. 101100

Score: 0
Accepted Answers:
a. 100100
2 points
Consider a binary tree-encoded genetic algorithm. The tree represents arithmetic
expressions where the nodes can be operators (+, -, *, /). If the maximum depth of the
tree is 3 (root is at depth 0), what is the maximum number of nodes the tree can have?
a. 15
b. 7
c. 45
d. 9
Score: 2
Accepted Answers:
a. 15
2 points
In the context of genetic algorithms and their selection processes, why might the
Roulette Wheel Selection method be considered advantageous yet potentially
problematic?
a. It guarantees the selection of the best individual in every generation, ensuring rapid
convergence.
b. It distributes selection probabilities based on fitness, favouring fitter individuals but
potentially sidelining lesser-fit individuals over time.
c. It always promotes diversity by selecting individuals randomly, ensuring a wide range
of solutions in subsequent generations.
d. It eliminates the need for a fitness function, relying solely on random chance for
selection.

Score: 2
Accepted Answers:
b. It distributes selection probabilities based on fitness, favouring fitter individuals but
potentially sidelining lesser-fit individuals over time.
2 points
Which type of generation gap typically leads to higher selection pressure?
a. No gap
b. Small gap
c. Large gap
d. The type of gap doesn't affect selection pressure

Score: 2
Accepted Answers:
c. Large gap
2 points
In real value encoding, if XL =2 and XU = 17 are two extreme decoded values of a variable
x. n= 4 is the number of binary bits in the representation of x. If the decoded value of x is
10, then x will be
a. 1100
b. 1010
c. 1110
d. 1111

Score: 2
Accepted Answers:
a. 1100
2 points
If the mating pool size is N, how many mating pairs are to be formed in Random Mating?
a.
b.
c.
d.

Score: 2
Accepted Answers:
b.
2 points
The generation gap with N population size and p number of individuals is
a.
b.
c.
d.

Score: 2
Accepted Answers:
a.
2 points
Which coding scheme has evolved to overcome the binary code-related problem?
a. Pink coding.
b. Grey coding.
c. Yellow coding.
d. Black coding.

Score: 2
Accepted Answers:
b. Grey coding.
2 points
Which is not the drawback of the binary crossover problem?
a. End point Bias.

b. Hamming cliff problem.
c. Positional bias.
d. Uniform variation.

Score: 2
Accepted Answers:
d. Uniform variation.
Due on 2024-02-28, 23:59 IST.

IST
2 points
In blend crossover, what is the purpose of the alpha and beta parameters?
a. They control the spread of children's solutions

b. They determine the length of the chromosome
c. They represent the gene values of parents
d. They define the crossover probability

Score: 2
Accepted Answers:
a. They control the spread of children's solutions
2 points
How does simulated binary crossover differ from linear and blend crossover in terms of
choosing alpha values?
a. Simulated binary crossover requires a probabilistic approach for alpha

b. Linear crossover uses a probability distribution function for alpha
c. Blend crossover uses a constant value for alpha
d. Simulated binary crossover guarantees global optima

Score: 2
Accepted Answers:
a. Simulated binary crossover requires a probabilistic approach for alpha
2 points
Consider two parent sequences for a genetic algorithm:
Parent 1: [1, 2, 3, 4, 5, 6, 7, 8] Parent 2: [8, 7, 6, 5, 4, 3, 2, 1]
What offspring sequences will be if we perform a single-point order crossover after
position 4?
a. Offspring 1: [1, 2, 3, 4, 5, 6, 7, 8], Offspring 2: [8, 7, 6, 5, 1, 2, 3, 4]

b. Offspring 1: [1, 2, 3, 4, 8, 7, 6, 5], Offspring 2: [8, 7, 6, 5, 1, 2, 3, 4]
c. Offspring 1: [1, 2, 3, 4, 4, 3, 2, 1], Offspring 2: [8, 7, 6, 5, 5, 6, 7, 8]
d. Offspring 1: [1, 2, 3, 4, 1, 2, 3, 4], Offspring 2: [8, 7, 6, 5, 8, 7, 6, 5]
Score: 2
Accepted Answers:
b. Offspring 1: [1, 2, 3, 4, 8, 7, 6, 5], Offspring 2: [8, 7, 6, 5, 1, 2, 3, 4]
2 points
Consider two parent sequences for a genetic algorithm:
Parent 1: [A, B, C, D, E, F, G, H, I] Parent 2: [I, H, G, F, E, D, C, B, A].
What are the offspring sequences after performing the position-based crossover
operation with the positions 3, 5, and 7?
a. Offspring 1: [I, B, G, D, E, F, C, H, A], Offspring 2: [A, H, C, F, E, D, G, B, I]

b. Offspring 1: [I, H, C, F, E, D, G, B, A], Offspring 2: [A, B, G, D, E, F, C, H, I]
c. Offspring 1: [A, B, G, D, E, F, C, H, I], Offspring 2: [I, H, C, F, E, D, G, B, A]
d. Offspring 1: [A, H, C, F, E, D, G, B, I], Offspring 2: [I, B, G, D, E, F, C, H, A]

Score: 0
Accepted Answers:
b. Offspring 1: [I, H, C, F, E, D, G, B, A], Offspring 2: [A, B, G, D, E, F, C, H, I]
2 points
When might the inversion operation be performed in a genetic algorithm?
a. After each crossover

b. At the beginning of the algorithm
c. Only in the final iteration
d. Occasionally, on selected chromosomes

Score: 2
Accepted Answers:
d. Occasionally, on selected chromosomes
2 points
The fitness scaling is useful to avoid
a. premature convergence, and slow finishing.

b. mature convergence, and fast finishing
c. premature convergence, and fast finishing
d. mature convergence, and slow finishing

Score: 0
Accepted Answers:
a. premature convergence, and slow finishing.
2 points
In the context of Multi-Objective Optimization Problems (MOOPs), a set of trade-off
optimal solutions is commonly known as:
a. Optimal Solutions
b. Non-Dominated Solutions
c. Dominated Solutions
d. Converged Solutions

Score: 2
Accepted Answers:
b. Non-Dominated Solutions
2 points
In Multi-Objective Optimization, a Utopian objective vector corresponding to a solution
represents:
a. A solution with the worst possible objective values

b. A solution with objective values is strictly better than any in the search space
c. A solution with objective values equal to the best in the search space
d. A solution with randomly assigned objective values

Score: 2
Accepted Answers:
b. A solution with objective values is strictly better than any in the search space
2 points
Suppose the original solution is 15.6, the random number lying between 0.0 to 1.0 is 0.7,
and the maximum value of the perturbation decided by the user is 2.5. In Random
mutation, the mutation value will be
a. 15.6
b. 17.7
c. 16.1
d. 23.4

Score: 2
Accepted Answers:
c. 16.1
2 points
In Multi-Objective Optimization, the Nadir objective vector corresponds to:

b. A solution with objective values strictly better than any in the search space
c. A solution with objective values equal to the best in the search space
d. A solution with randomly assigned objective values

Score: 2
Accepted Answers:
Due on 2024-03-06, 23:59 IST.

IST
2 points
What property does the domination relation in a multi-objective optimization problem
exhibit?
a. Reflexive
b. Symmetric
c. Transitive
d. Antisymmetric

Score: 2
Accepted Answers:
c. Transitive
2 points
Consider two solutions, P and Q, for a problem where we want to minimize two
objectives. The solutions with their objective values are: Which of
the following are True?
a. P dominates Q.
b. Q dominate P.
c. Both dominate each other.

Score: 0
Accepted Answers:
a. P dominates Q.
2 points
Which of the following statements accurately describes the relationship between non-
dominance sets and Pareto optimal sets in multi-objective optimization?
a. The non-dominance and Pareto optimal sets are the same and can be used
interchangeably.
b. The non-dominance set is a strict subset of the Pareto optimal set.
c. The Pareto optimal set is a strict subset of the non-dominance set.
d. The non-dominance set and the Pareto optimal set are unrelated concepts.

Score: 0
Accepted Answers:
a. The non-dominance and Pareto optimal sets are the same and can be used
interchangeably.
2 points
Which of the following is NOT included in the list of non-Pareto-based multi-objective
optimization approaches?
a. Lexicographic ordering
b. Criterion selection (VEGA)
c. Simple weighted approach (SOEA)
d. Non-dominated Sorting based approach (NSGA)

Score: 0
Accepted Answers:
d. Non-dominated Sorting based approach (NSGA)
2 points
What does the term "middling performance" refer to in the context of the VEGA
approach?
a. Excellent performance in all objectives

b. Poor performance in all objectives
c. Results neither very bad nor very good
d. Global optimization

Score: 2
Accepted Answers:
c. Results neither very bad nor very good
2 points
What is the basis of NPGA (Niched Pareto Genetic Algorithm) in its selection scheme?
a. Roulette wheel selection

b. Tournament selection and Pareto dominance.
c. Stochastic universal sampling
d. Rank-based selection

Score: 2
Accepted Answers:
b. Tournament selection and Pareto dominance.
2 points
How does NPGA determine the winner solution in its tournament selection?
a. The solution with the highest fitness value wins.

b. The solution with the lowest fitness value wins.
c. The solution based on Pareto dominance principle wins.
d. The solution selected randomly wins.

Score: 2
Accepted Answers:
c. The solution based on Pareto dominance principle wins.
2 points
What is the lexicographic ordering method in multi-objective optimization?
a. An a priori technique employing stochastic sampling.

b. A posteriori technique based on dominance relationships.
c. An a priori technique based on the principle of "aggregation with ordering."
d. A selection strategy involving tournament-based competition.

Score: 2
Accepted Answers:
c. An a priori technique based on the principle of "aggregation with ordering."
2 points
In the context of Multi-Objective Genetic Algorithms (MOGA), what does "fitness sharing"
refer to?
a. A technique for evaluating the fitness of individuals based on their Pareto dominance.
b. A mechanism for sharing the fitness values equally among all individuals in the
population.
c. An approach for preventing premature convergence by penalizing solutions that are
too similar.
d. A method for randomly selecting individuals for crossover and mutation operations.

Score: 2
Accepted Answers:
c. An approach for preventing premature convergence by penalizing solutions that are
too similar.
2 points
What is a significant disadvantage of the Vector-Evaluated Genetic Algorithm (VEGA)
regarding solution dominance?
a. Solutions are locally and globally dominated

b. Solutions are Pareto-dominated and globally dominated
c. Solutions are locally non-dominated but not necessarily globally dominated.
d. Solutions are locally and globally non-dominated

Score: 2
Accepted Answers:
c. Solutions are locally non-dominated but not necessarily globally dominated.
Due date: 2024-03-13, 23:59 IST.
Your last recorded submission was on 2024-03-03, 16:48 IST
2 points
What is the time complexity of the Non-dominated Sorting Procedure in the context of
Genetic Algorithms, where m is the number of objectives, and n is the population size?
a. O(n^2)
b. O(mn)
c. O(mn^2)
d. O(log n)
2 points
What is the purpose of the sharing technique in NSGA?
a. To assign dummy fitness values

b. To increase computation speed
c. To favor elitism approach
d. To maintain population diversity
2 points
What is the significance of the crowding distance method in NSGA-2?
a. It improves crossover operations

b. It ensures the fastest execution of the algorithm
c. It helps select diverse solutions from the last front
d. It enhances the mutation rate
2 points
Which selection method does NSGA-II use in its algorithm?
a. Roulette Wheel Selection

b. Rank Selection
c. Crowded Tournament Selection
d. Random Selection
2 points
What does the crowding comparison operator consider when selecting a winner between
two solutions in NSGA-II?
a. Rank of the solutions

b. Mutation rate
c. Crowding distance and rank
d. Crossover probability
2 points
The behavior of a biological neural network can be captured by a simple model called an
artificial neuron or perceptron. Which of the following statements about the perceptron is
correct?
a. Perceptrons can only be used for linearly separable problems.

b. Perceptrons are a type of unsupervised learning algorithm.
c. Perceptrons have no activation function.
d. Perceptrons can have multiple layers, just like deep neural networks.
2 points
In the context of neural network architectures, what distinguishes recurrent neural
networks (RNNs) from feedforward network architectures?
a. RNNs have no hidden layers.

b. RNNs have at least one "feedback loop."
c. RNNs only process input data once.
d. RNNs do not use activation functions.
2 points
To address non-linearly separable problems, which type of neural network architecture is
commonly employed?
a. Single-layer perceptron network

b. Multilayer feedforward neural network
c. Radial Basis Function network
d. Recurrent neural network
2 points
What is the fundamental structural unit of a biological nervous system consisting of
interconnected processing units?
a. Synapse
b. Neuron
c. Axon
d. Dendrite
2 points
What is the chemical present in each neuron that plays a crucial role in transmitting
signals between neurons?
a. Enzyme
b. Hormone
c. Neurotransmitter
d. Antigen
Due date: 2024-03-20, 23:59 IST.
Your last recorded submission was on 2024-03-09, 15:24 IST
2 points
What is the primary purpose of the weight matrix in a perceptron during the training
process?
a. To store input data

b. To define the threshold value
c. To calculate the error gradient
d. To adjust the connection strengths between neurons
2 points
In Hebbian learning, what does the weight adjustment depend on?
a. Correlation between input and output

b. The number of layers in the network
c. The learning rate
d. The transfer function used
2 points
What role does the activation function play in the back-propagation algorithm for training
multilayer feed-forward neural networks?
a. It defines the initial weights of the network.

b. It calculates the error between predicted and actual outputs.
c. It determines the learning rate during weight updates.
d. It introduces non-linearity to the network and aids in capturing complex patterns.
2 points
What role does the learning rate play in the Steepest Descent method?
a. It represents the error function

b. It determines the size of the incremental steps in updating parameters
c. It is the output of the input layer
d. It represents the difference between true output and observed output
2 points
What is the key difference between supervised learning and unsupervised learning in the
context of neural networks?
a. Supervised learning requires labeled output data, while unsupervised learning does
not.
b. Unsupervised learning uses a teacher to guide the learning process.
c. Supervised learning does not involve input data, unlike unsupervised learning.
d. Unsupervised learning requires a predefined threshold value.
2 points
In the Fuzzy Toolbox Library in the Simulink environment, which block is responsible for
implementing the desirable rules based on a FIS variable produced by the FIS Editor?
a. Defuzzification block
b. FIS Variable block
c. Fuzzy Controller block
d. Rule Base block
2 points
In a Sequential Hybrid System, how are the technologies utilized?
a. Parallel execution
b. Hierarchical execution
c. Pipelining fashion
d. Synchronous execution
2 points
In an Embedded Hybrid System, how are the participating technologies integrated?
a. Sequential execution
b. Isolated execution
c. Intertwined integration
d. Modular execution
2 points
What is a characteristic of a fuzzy rule base in a fuzzy logic system?
a. It only contains linguistic terms.

b. It is not involved in decision-making.
c. Rules are expressed in a binary format.
d. It defines relationships between input and output variables.
2 points
Why are fuzzy logic and neural networks considered natural complementary tools in
building intelligent systems in the context of Neuro-Fuzzy Systems?
a. Fuzzy logic focuses on raw data, while neural networks handle linguistic information.
b. Fuzzy logic and neural networks both operate at a high level of abstraction.
c. Neural networks excel in linguistic reasoning, while fuzzy logic deals with raw data.
d. Neural networks handle raw data well, and fuzzy logic is effective in dealing with
linguistic information.

Soft Computing

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Soft Computing

Uploaded by

Copyright:

Available Formats

Week 01 : Assignment 01

The due date for submitting this assignment has passed.

Assignment submitted on 2024-02-05, 21:02

a. Hard computing always requires fuzzy logic.

Yes, the answer is correct.

Yes, the answer is correct.

a. A fuzzy set is a special case of a crisp set.

No, the answer is incorrect.

a. It is guaranteed to be normal, and its core is non-empty.

No, the answer is incorrect.

Yes, the answer is correct.

Yes, the answer is correct.

Then the value of μ(A∪B)’(x) will be

a. {0.9, 0.5, 0.6, 0.8, 0.8}

No, the answer is incorrect.

Yes, the answer is correct.

The Max-product composition is

Yes, the answer is correct.

Yes, the answer is correct.

Assignment submitted on 2024-02-05, 21:49

a. Crisp propositions always return a value between 0 and 1.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

a. The student did not study hard.

Yes, the answer is correct.

No, the answer is incorrect.

a. Centre of gravity method (COG)

a. {0.7, 0.3, 0.6}

No, the answer is incorrect.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

Assignment submitted on 2024-02-13, 19:12

Yes, the answer is correct.

a. Techniques for defining the universe of discourse

Yes, the answer is correct.

No, the answer is incorrect.

The system has two rules:

Yes, the answer is correct.

Yes, the answer is correct.

a. Discrete (integer) variables are difficult to handle.

Yes, the answer is correct.

a. Neural network and natural language processing

Yes, the answer is correct.

Yes, the answer is correct.

a. Population size is small and Chromosomes are of longer length.

No, the answer is incorrect.

a. Fuzzy rule base

Yes, the answer is correct.

Assignment submitted on 2024-02-21, 16:51

Yes, the answer is correct.

No, the answer is incorrect.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

Yes, the answer is correct.

a. End point Bias.

Yes, the answer is correct.

Assignment submitted on 2024-02-21, 17:24

a. They control the spread of children's solutions