NPTEL Introduction To Soft Computing Week 4 Assignment Answers 2025
1. Which encoding method is useful in ordering problems such as the Travelling Salesman
Problem (TSP)?
a. Binary Encoding
b. Permutation Encoding
C. Value Encoding
d. None of the above
Answer :- For Answers Click Here
2. Using a binary encoding scheme for a job-shop scheduling problem with three jobs (11, 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
Answer :-
3. 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
Answer :-
4. Which of the following genetic algorithm selection strategy is ordinal-based selection?
a. Canonical selection
b. Steady-state selection
c. Rank-based selection
d. Roulette Wheel selection
Answer :-
5. 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
Answer :-
6. In real value encoding, if X, =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
Answer :- For Answers Click Here
7.
Answer :-
8.
Answer :-
9. The real-coded GA is most suitable for optimization in a
a. Discrete search space.
b. Continuous search space
c. Random search space.
d. None of the above
Answer :-
10. Which is not the drawback of the binary crossover problem?
a. End point Bias.
b. Hamming cliff problem.
c. Positional bias.
d. Uniform variation.
Answer :- For Answers Click Here
