NPTEL Introduction To Soft Computing Week 7 Assignment Answers 2025
1. What is the role of the niche method in NSGA?
a. To reduce computational complexity
b. To ensure diversity in the population by maintaining a stable subpopulation of good points
c. To improve the efficiency of Pareto sorting
d. To maximize convergence speed
Answer :- For Answers Click Here
2. What is the purpose of fitness sharing in multi-objective optimization?
a. To select individuals with the highest fitness values
b. To promote diversity in the population
c. To ensure faster convergence to the Pareto front
d. To eliminate dominated individuals
Answer :-
3. What quantity is used to calculate the niche count??
a. The distance between individuals
b. The rank of individuals
c. The objective values of the individuals
d. The total population size
Answer :-
4. What happens if the phenotype distance d, between two individuals is greater than T shared?
a. sh(dij) = 1
b. sh(dij) = 0
c. sh(dij) = dij
d. sh(dij) = T shared
Answer :-
5. Which of the following is a major drawback of the original NSGA algorithm?
a. NSGA has a high computational complexity of O(mn’) due to its classification method.
b. NSGA follows an elitist selection approach, leading to poor diversity.
c. NSGA outperforms both MOGA and NPGA in all comparative studies.
d. NSGA does not require any additional parameters, making it highly efficient.
Answer :-
6. Which of the following is NOT a step in the NSGA-II algorithm?
a. Creating an offspring population using genetic operators like crossover and mutation.
b. Combining the parent and offspring populations to form a larger population.
c. Selecting individuals based purely on their fitness values, ignoring diversity.
d. Applying non-dominated sorting to classify solutions into Pareto fronts.
Answer :- For Answers Click Here
7. Why does NSGA-II use the crowding distance metric?
a. To ensure diversity in the population when selecting individuals from the last non-dominated front.
b. To speed up the genetic algorithm by eliminating non-dominated solutions.
c. To assign fixed ranks to solutions based on a predefined objective hierarchy.
d. To ensure that only a single global optimal solution is selected at the end.
Answer :-
8. Which of the following statements about the crowding comparison operator in NSGA-II is
TRUE?
a. A solution x wins over a solution y only if x has a strictly better dominance rank.
b. If two solutions have the same rank, the solution with a higher crowding distance is preferred.
c. NSGA-II resolves ties using a randomly assigned fitness value when solutions belong to the same front.
d. Crowding distance is used to identify and remove non-dominated solutions from the Pareto front.
Answer :-
9. Which of the following is TRUE about the crowding tournament selection in NSGA-II?
a. NSGA-II is a non-elitist approach that selects solutions based solely on random sampling.
b. NSGA-II replaces the explicit sharing concept with crowding tournament selection to maintain diversity.
c. The non-dominated sorting procedure in NSGA-II has a time complexity of O(mn3), making it slower than NSGA.
d. The overall time complexity of NSGA-II is O(mn3) ,which makes it computationally inefficient.
Answer :-
10. Which of the following is a key characteristic of Artificial Neural Networks (ANNs)?
a. ANNs require a predefined mathematical model before learning any task.
b. ANNs can only process trained data and fail to generalize to unseen data.
c. ANNs can map input patterns to associated output patterus and generalize to unseen data.
d. ANNs do not require training and can make inferences directly from raw data.
Answer :- For Answers Click Here
