Scribd
Upload
69 views

Assignment 2: S.No. UID Assignment Set

This document contains 12 assignments related to genetic algorithms. Each assignment contains 4 questions focusing on genetic algorithm concepts and operations such as crossover, mutation, selection, representation, inversion, deletion, and applications. Students are asked to elaborate on statements, provide examples, compare genetic algorithms to traditional algorithms, and explain genetic algorithm concepts, models, and implementations.

Uploaded by

aattish
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
69 views

Assignment 2: S.No. UID Assignment Set

This document contains 12 assignments related to genetic algorithms. Each assignment contains 4 questions focusing on genetic algorithm concepts and operations such as crossover, mutation, selection, representation, inversion, deletion, and applications. Students are asked to elaborate on statements, provide examples, compare genetic algorithms to traditional algorithms, and explain genetic algorithm concepts, models, and implementations.

Uploaded by

aattish
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Assignment 2

S.No. UID ASSIGNMENT SET


1 15BCS1008
2 15BCS1021
3 15BCS1033 Assignment 2.1
4 15BCS1047
5 15BCS1062
6 15BCS1067 Assignment 2.2
7 15BCS1070
8 15BCS1071
9 15BCS1076 Assignment 2.3
10 15BCS1081
11 15BCS1085
12 15BCS1093 Assignment 2.4
13 15BCS1098
14 15BCS1107
15 15BCS1108 Assignment 2.5
16 15BCS1217
17 15BCS1248
18 15BCS1250 Assignment 2.6
19 15BCS1253
20 15BCS1261
21 15BCS1273 Assignment 2.7
22 15BCS1288
23 15BCS1295
24 15BCS1343 Assignment 2.8
25 15BCS1467
26 15BCS1548
27 15BCS1562 Assignment 2.9
28 15BCS1568
29 15BCS1715
30 15BCS1764 Assignment 2.10
31 15BCS1772
32 15BCS1940
33 15BCS1969 Assignment 2.11
34 15BCS1992
35 15BCS2000
36 15BCS2005 Assignment 2.12
37 15BCS2025 Assignment 2.1
38 15BCS2026
39 15BCS2039
40 15BCS2045
41 15BCS2055
42 16BCS8001 Assignment 2.2
43 16BCS8008
44 16BCS8016
45 15BET1028 Assignment 2.3

Assignment-2.1
Q1. GA is better than other traditional algorithm in that they are more robust. Satisfy this
statement with suitable examples and comparison between traditional and GA Techniques.

Q2. Inversion operator inverts the bits between two random sites. While deletion operator
randomly selects a bit and duplicates it. Verify the above statement with some valid point and
examples.

Q3.Elaborate Genetic Modeling: Inversion and deletion

Q4. Elaborate Inversion – deletion and duplication

Assignment-2.2
Q1. Mutation prevents the algorithm to be trapped in a local minimum. It plays the role of
recovering the genetic materials as well as for randomly distributing genetic information. Justify
the statement with suitable examples.

Q2. GA is observed to have many implementation issues with its various applications. Mention
such issues and relate them with advantages of GA over traditional systems.

Q3. Compare Deletion andregeneration process in GA.

Q4. Elaborate Segregation – cross over and inversion.


Assignment-2.3
Q1. According to a study If two breaks occur in one chromosome, sometimes the region between
the breaks rotates 180 degrees before rejoining with the two end fragments. Justify such scenario
with relation to Mutation process.

Q2. An inversion occurs when a single chromosome undergoes breakage and rearrangement
within itself. Briefly mention inversion criteria and its types that will support the answer.

Q3. Elaborate Bit-wise operators – one’s complement operator

Q4. Elaborate Logical bit-wise operators – shift operators

Assignment-2.4
Q1. Translocation and inversion of chromosomes are mutations; crossing over is not. Clarify the
statement with suitable examples.

Q2. Genetic variation is a necessity for the process of evolution. Genetic operators used in
genetic algorithms are analogous to those in the natural world like survival of the fittest,
or selection; crossover and mutation. Specify examples to prove the statement.

Q3.Expound Bit-wise operators used in GA

Q4. Deliberate Generational cycle convergence of GA.

Assignment-2.5
Q1. While each operator acts to improve the solutions produced by the genetic algorithm
working individually, the operators must work in conjunction with each other for the algorithm
to be successful in finding a good solution. Support the statement with some suitable operations
and examples.

Q2. It is observed that most natural representation for candidate solutions in GAs when solving a
discrete binary problem is a string of bits. Elaborate the statement with assumptions and
examples.

Q3. List the Applications of GA?

Q4. List down some features of Segregation and inversion.


Assignment-2.6
Q1. The one's complement operator (~), sometimes called the "bitwise complement" operator,
and yields a bitwise one's complement of its operand. Support the statement with some examples
related to GA.

Q2. The initial population is randomly generated and then the algorithm iterates until the optimal
solution is found. Elaborate the statement in relation with algorithm of GA.

Q3. Differences and Similarities between GA and Other Traditional Methods

Q4. List the advantages of Inversion, deletion and duplication?

Assignment-2.7
Q1. The Locus Shift operator in GA can give various types of linear chromosomes from a parent
circular chromosome. Mention some steps required for such operation in GA.

Q2. Shift operators in GA are regarded as important part of GA operators. An algorithm is


always required for such an operation. In order to support the statement, mention the Locus-
Operator algorithm.

Q3. Expound GA application of Historical Interaction.

Q4. Elaborate Dejung&Function optimization.

Assignment-2.8
Q1. The initial population is randomly generated and then the algorithm iterates until the optimal
solution is found. Elaborate the statement in relation with algorithm of GA.

Q2. Differences and Similarities between GA and Other Traditional Methods

Q3. Applications of GA.


Assignment-2.9
Q1. Elaborate Coding Whole Fuzzy Partitions in Genetic Algorithm. Specify some Fuzzy
Partitions schemes with examples.

Q2. It is observed that most natural representation for candidate solutions in GAs when solving a
discrete binary problem is a string of bits. Elaborate the statement with assumptions and
examples.

Q3. Elaborate current applications of GA.

Assignment-2.10
Q1. Translocation and inversion of chromosomes are mutations; crossing over is not. Clarify the
statement with suitable examples.

Q2. Genetic variation is a necessity for the process of evolution. Genetic operators used in
genetic algorithms are analogous to those in the natural world like survival of the fittest,
or selection; crossover and mutation. Specify examples to prove the statement.

Q3.Compare between traditional algorithms and genetic algorithm.

Assignment-2.11

Q1. It is observed that most natural representation for candidate solutions in GAs when solving a
discrete binary problem is a string of bits. Elaborate the statement with assumptions and
examples.

Q2. GA is observed to have many implementation issues with its various applications. Mention
such issues and relate them with advantages of GA over traditional systems.

Q3. Elaborate multi objective optimization.


Assignment-2.12
Q1. Deliberate Mutation Operators for Real Coded GAs. Clarify the statement with suitable
examples.

Q2. Inversion operator inverts the bits between two random sites. While deletion operator
randomly selects a bit and duplicates it. Verify the above statement with some valid point and
examples.

Q3.Differentiate betweenInversion and deletion modeling

You might also like