Introduction to Soft Computing - - Unit 5 - Week 4 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

reviewer2@nptel.iitm.ac.in ▼

Courses » Introduction to Soft Computing

Announcements Course Ask a Question Progress Mentor

Unit 5 - Week 4

Course
outline
Assignment 4
The due date for submitting this assignment has passed. Due on 2018-03-07, 23:59 IST.
How to access
the portal Submitted assignment

Week 1 1) An optimization problem is stated as follows: 1 point

x2 125 +
maximize f (x, y) = 2
+ y2
where x, y ∈ R
Week 2 The above optimization problem comes under the category of

Week 3
Unconstrained optimization problem.

Week 4 Linear optimization problem.

Lecture 16 : GA
Integer value optimization problem.
Operator : Real value optimization problem.
Encoding
schemes No, the answer is incorrect.
Lecture 17 : GA Score: 0
operator : Accepted Answers:
encoding Unconstrained optimization problem.
scheme
(contd.) 2) Which of the following(s) is/are the pre-requisite(s) when Genetic Algorithms are applied to solve 1 point
Lecture 18 : GA problems?
Operator : (i) Encoding of solutions.
Selection (ii) Well-understood search space.
(iii) Method of evaluating the suitability of the solutions.
Lecture 19 : GA
Operator (iv) Contain only one optimal solution.
Selection
(Contd.) i and ii only.

Lecture 20 : GA ii and iii only.

Operator:
Crossover i and iii only.
techniques
iii and iv only.
Quiz :
Assignment 4 No, the answer is incorrect.
Score: 0
Feedback for
Week 4 Accepted Answers:
i and iii only.
Week 4:
Lecture 3)©Which of the following(s) is/are found in Genetic Algorithms?
2014 NPTEL - Privacy & Terms - Honor Code - FAQs -
1 point
Material (i) Evolution
A project of In association with
Solution for (ii) Selection
Assignment 4 (iii) Reproduction
(iv) Mutation
Week 5 Funded by

1 of 4 Thursday 10 May 2018 04:23 PM

Introduction to Soft Computing - - Unit 5 - Week 4 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

Week 6 i and iiPowered

only by

i, ii and iii only

Week 7
ii, iii and iv only
Week 8
All of the above

DOWNLOAD No, the answer is incorrect.

VIDEOS Score: 0
Accepted Answers:
All of the above

4) Suppose, all steps in both SGA and SSGA remain same, except instead of selecting two 1 point
individuals from the current population of size N, Np (Np << N) individuals as in SGA are selected.
Then, the correct statement is

Generation gap of SGA will be more than that of SSGA

Generation gap of SSGA will be more than that of SGA

Generation gap in both algorithms remains same

Nothing can be said precisely

No, the answer is incorrect.

Score: 0
Accepted Answers:
Generation gap of SGA will be more than that of SSGA

5) Which GA operation is computationally most expensive? 1 point

Initial population creation

Selection of sub-population for mating

Reproduction to produce next generation

Convergence testing

No, the answer is incorrect.

Score: 0
Accepted Answers:
Reproduction to produce next generation

6) Which of the following is not true for Genetic algorithms? 1 point

It is a probabilistic search algorithm

It is guaranteed to give global optimum solutions

If an optimization problem has more than one solution, then it will return all the solutions

It is an iterative process suitable for parallel programming

No, the answer is incorrect.

Score: 0
Accepted Answers:
It is guaranteed to give global optimum solutions

7) Which one of the following is not necessarily be considered as GA parameters? 1 point

N , the population size.

∈, the obtainable accuracy

μp , the mutation probability

2 of 4 Thursday 10 May 2018 04:23 PM

Introduction to Soft Computing - - Unit 5 - Week 4 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

f¯, the average fitness score

No, the answer is incorrect.
Score: 0
Accepted Answers:
f¯, the average fitness score
8) Which of the following optimization problem(s) can be better solved with Order GA? 1 point

0-1 Knapsack problem

Travelling salesman problem

Job shop scheduling problem

Optimal binary search tree construction problem

No, the answer is incorrect.

Score: 0
Accepted Answers:
Travelling salesman problem

9) Which of the following is not a valid chromosome in Order GA? 1 point

1 3 5 7 2 4 6 8

A B D E C F H G

1 0 0 1 1 0 0 1

14.6 -23.4 177.23

No, the answer is incorrect.

Score: 0
Accepted Answers:

1 0 0 1 1 0 0 1

10)Roulette wheel selection scheme is preferable when 1 point

Fitness values are uniformly distributed

Fitness values are non-uniformly distributed

Needs low selection pressure

Needs high population diversity

No, the answer is incorrect.

Score: 0
Accepted Answers:
Fitness values are uniformly distributed

11)What GA encoding scheme suffers from Hamming cliff problem? 1 point

Binary coded GA

Real coded GA

Order GA

3 of 4 Thursday 10 May 2018 04:23 PM

Introduction to Soft Computing - - Unit 5 - Week 4 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

Tree coded GA

No, the answer is incorrect.

Score: 0
Accepted Answers:
Binary coded GA

Previous Page End

4 of 4 Thursday 10 May 2018 04:23 PM