Genetic Algorithms Questions eRe amet Reeve aoe Start Complete Exam Preparation Ciesreatcs pre bidity ( Download App Question 1: View this Question Online > Per) DR eet Ina genetic algorithm optimization problem the fitness function isdefined asf(x) = x2 - 4x+ 4, Given a population of four individuals with values of x: {1.5, 2.0,3.0, 4.5} What is the fitnessvalue of the individual that will be selected as the parent for reproduction in one generation? 4, 2:25 2. 6.0 3. 0.0 4. 6.25 A. (Detailed Solution Below) Option 4: 6.25coaching aoe govt. exams Under One Roof ete Genetic Algorithms Question 1 Detailed Solution The correct answeris 6.25 © Key Points. Ina genetic algorithm seeksto find the optimal solution to a problem, guided by the principle of survival of the fittest. fi £, athe fitngss value of each individual in the population, we can use the given fitness function Let's calculatethe fitness values for the ™.: with the given values of x: "jalsy 2. Fes 67 2 22.0)2— 4(2.0) +4=4-844= 5 F002 G.0)2— 4(3.0)+4=9-1244=1 4 FRB) = (Gi.s)2— 4(4.5) + 4 = 20.25 — 18 +4 = 6.25 $8. 3° dtnegsyatues ‘for the individuals are: ths)? —4(1.5) +4=2.25 6 +4=0.25 The individual with the highest fitness value is x = 4.5 with a fitness value of 6.25. Therefore, the correct answeris option 4) 6.25& EME ane oe tetny Slam rch Lely mB) ous raaice mi eca ieee ier aa Gad CRE cn jownload App Question 2: View this Question Onlifie > Which of the following isnot a mutation operator in a genetic algorithm? ~*~ resetting B.Scramble C. Inversion D. Difference Choose the correct answer from the options given below: 1. Aand Bonly 2. Band D only 3. Cand D only 4. D only Answer (Detailed Solution Below) Option 4: D only Genetic Algorithms Question 2 Detailed Solution The correct answeris D only Mutation operators in a Genetic A. are used for perturbing the genes in a solution. They help in keeping the diversity of the population and avoiding premature convergence on local optima. Here's a brief explanation of the operators mentioned:+ A. Random Resetting: Thisis a type of mutation operator where a specificgene in 2 chromosomeis randomly chosenand assigneda new value from the feasible parameter range. + B. Scramble: This operator randomly selectstwo points in the chromosome and then shuffles the genes between those points. + C. Inversion: Inversion mutation operators selecta substring (.e.,a portion of the chromosome) and revert the order of genes within that. + D. Difference: Thisisnot a known mutation operator in the context of genetic algorithms. Therefore, the answer is 4) D only. Ca India's #1 Learning Platform ere Seamer Cel) Dee Gy ee ones Mock Tests Doster Question Bank & Quizzes Download App Question 3: View this Question Online > Which of the following isnot a solution representation in a genetic algorithm? 1. Binary valued 2. Real valued 3.Permutation . 4. Combinations 14 BBA, aed 2. Realvalued 3. Permutation 4. Combinations Answer (Detailed Solution Below) Option 4: CombinationsGenetic Algorithms Question 3 Detailed Solution The correct answeris Combinations © Key Points Ina genetic algorithm, solution representation reféts to how the potential solutions (individuals in the population) are encoded. The given options can be categorized as follows: + Binary valued: Represenissolutionsusing binary encoding, where each gene is typically represented as either 0 or + Real valued: Represents ns using real numbers, allowing for a more continuous representation. + Permutation: Represents solutions as permutations of elements, where the order of elements matters. + Combinations: Thisis not a standard representation in genetic algorithms. While permutations represent ordered arrangements, combinations represent unordered selections of elements. Genetic algorithms typically use representations that capture the structure and relationshipsamong elements, and combinations may not be suitable for many optimization problems. ‘So, the correct answer is 4) Combinations. GER Bee haley Start Complete Exam Preparation Rec Sot Teo ote’ Dea Doscranoa Crested xis Download App Question 4: View this Question Online > Which Al Systemmimicsthe evolutionary processto generate increasingly better solutions to a processto a problem? A Self organizing neural network. B.Backpropagation neural network. C. Genetic algorithm D. Forward propagation’ neural network. Choose the correct answer from the options given below: a 10/A Only2. BOnly 3. COnly 4. D Only Answer (Detailed Solution Below) Option 3: C Only a Genetic Algorithms Question 4 Detailed Solution The correct answeris C only © Key Points ~()>~ + Genetic algorithms mimic the process of natural ‘selection and evolution to generate increasingly better solutions to a problems) + They involve the use of populations of potential solutions, where individuals (potential solutions) undergo nae mutation , crossover , and selection to produce new generations of indivi + Over successivegenerations, tre @igorithm tends to converge towards better solutions. ©; Additional Information. * Self-organizing neural network: This refers to neural networks that can organize themselves based on the input data. They learn to form internal representations without explicit supervision. + Backpropagation neural network: Backpropagation is a supervised learning algorithm used for training artificial neural networks. It involves calculating the gradient of the error with respect to the weights of the network and adjusting the weights to minimize the error. + Forward propagation neural network: Forward propagation is the process of passing input data through the neural network to generate an output. In this phase, input signals are processedlayer by layer until the final output is produced without adjusting the weights. Fg eRe Seen areola Rei Cet Start Complete Exam Preparationyes ea alin ee cae i Download App Question 5: View this Question Online® A4-input neuron has weights 1, 2, 3, 4. The transfer function is linear with the constantof proportionality being equal to 3. The inputs are 5, 7, 10, 30, respectively rao will be, ¥ 120 2. 213 3. 410 4. 507 Answer (Detailed Solution Below) Option 4: 507 Genetic Algorithms Question 5 Detailed Solution The correct answerls 507 © Key Points Alinear neuron isa basictype of artificialneuron or node th aneural network that performs a linear transformation on its inputs. It is a fundamental building block in the field of neural networks. The output of a linear neuron is computed by taking a weighted sum of its input values and applying 2 constant factor called the bias or constant of proportionality. To calculatethe output of the neur u canuse the formula for a linear neuron: Output = Constant of Properly, x (Ot, (Weight, x Inpat,)) + In this case: = Constant of Proportionality = 3 > Weights = [1, 2, 3, 4] » Inputs = [5, 7, 10,30]oe Output = 3x (x 5 +2x 743 x 1044 x30) + Now, epiuaiethg YalBS: 14+ 30 + 120) , Output x 169 , Output = 507 Therefore, the correct answer is: 4) 507 ‘Top Genetic Algorithms MCQ Objective Questions & TCE arc) Start Complete Exam Preparation RCC CRE Soca foray Six Crest aad exert Question 6 View this Question Online > Let the population of chromosomesin genetic algorithm is represented in termsof binary number. The strength of fitness of a chromosome in decimal form, x, is given by Sf(z) = fO), where f(z) =2? The population is given by P where: P= {(01101),(11000),(01000),(10011)} The strength of fitness of chromosome (11000)is. : 1,24 2. 576 4. 49.2 ‘Answer (Detailed Solution Below) Option 4: 49.2Genetic Algorithms Question 6 Detailed Solution P= ((01101),(11000),(01000),(10011)} Also, strength of fitness of a chromasome in decimal form, x is given by: Sf(z) = {© where f(x) =2? So, first convert the population in decimal form, then find f(x). P Valuein decimal | 9) ~ x2 on01 B 1 11000 4 576 01000 8 ~. oh 10011 19 sel We have to find the strength of fitness of chromosome 11000. 11000 in decimal = 24, f(24)= 576 Sf(2)= 270 00> 8TeF 8 80T St(x)= 576/1170 Si(x)= 0.492 a India’s #1 Learning Platform Start Complete Exam Preparation De eee[- Bhd tale d sp Given below are two statements; ‘Statement I: A genetic algorithm isa stochastichill-climbing searchin which a large population of statesis maintained. it Il: In nondeterministic environments, agents can apply AND- OR searchto generate *t plans that reach the goal regardless of which outcomes occur during execution. In the light of the above statements,choose the Correct answer from the options given below 1. Both Statement! and Statement II are true 2. Both Statement| and Statement Il are false 3. Statement! Is correct but Statement Il Is false 4. Statement! is incorrect but Statement!l is true Answer (Detailed Solution Below) Option 1: Both Statement | and Statementl are true Genetic Algorithms Question 7 Detailed Solution ~ 4 The correct answeris option 1. at © Key_Points— A genetic algorithm isa stochastichill-climbing algorithm that maintainsa wide population of states Mutation and crossover, which blends pairs of statesfrom the population, createnew states. Hence Statement | is correct. Agents may use AND-OR searchin non- deterministic environments to produce contingent plans that achieve the target regardless of which outcomes occur during execution Hence Statement Il is correct© Additional Information. + AND-OR search trees: © OR nodes: The only branching in a deterministic setting is implemented by the agent's ‘own choicesin each state; we call these nodes OR nodes. + AND nodes: Branching is often implemented in a non- deterministic setting by the environment's choice of outcome for each action, which we call nodes AND nodes. a Ee sero) Slam Ce CnC) Ree eo Cees es porno ee Question 8 \ View this Question Online > Which of the following isnot a solution representation in a genetic algorithm? 1. Binary valued 2. Real valued 3.Permutation 4. Combinations fs — . 2. Realvalued 3. Permutation 4. Combinations ‘Answer (Detailed Solution Below) Option 4: Combinations‘Genetic Algorithms Question 6 Detalied solution ‘The correct answeris Combinations @ Key Points. Ina genetic algorithm, solution representation reférsto how the potential solutions (individuals in the population) are encoded. The aiven options can be categorized as follows: represented as either 0 or + Real valued: Represents si representation. + Permutation: Represents solutions as permutations of elements, where the order of elements matters. + Combinations: Thisis not a standard representation in genetic algorithms. While peimutations represent ordered arrangements, combinations represent unordered selections of elements. Genetic algorithms typically use representations that capture the structure and relationshipsamong elements, and combinations may not be suitable for many optimization problems. ‘So, the correct answer is 4) Combinations. + Binary valued: —-_ binary encoding, where each gene is typically ns using real numbers, allowing for a more continuous Dee ane ola Start Complete Exam Preparation a ecar oea Gee ay peer k eo Download App Question 9 View this Question Online > Ina genetic algorithm optimization problem the fitness function isdefined asf(x)= x2 - 4x+ 4. Given a population of four individuals with values of x: (1.5, 2.0, 3.0, 4.5} What is the fitnessvalue of the individual that will be selected as the parent for reproduction in one generation? 1. 225 is 3.50.04. 6.25 ‘Answer (Detailed Solution Below) Option 4: 6.25 Genetic Algorithms Question 9 Detailed Solution The correct answeris 6.25 Ina genetic algorithm seeksto find the optimal solution to a problem, guided by the principleo' survival of the fittest. . Fey finggsyq]ue of each ncvidual in the population, we can useshe\giveh ness function Let's calculatethe fitness values for the individuals with the given valles of x: "FOLSy 221.5)? — 4(1.5) + 4=2.25 26 44 025 2.60 7 20o.0)2— 4(2.0) 1 4 ™: 44=0 3-F es 3.02 — (3.0) +4 = 9-1244=1 4 Fels Ais) — 4(4.5) +4 = 20.25 — 18 +4 = 6.25 76.dhe dtpeassaques ‘for the individuals are: The individual with the highest fitness value is x= 4.5 with a fitness value of 6.25. Therefore, the correct answeris option 4) 6.25. & eRe ae een areola Reimer Seles ech cel) ete mo cake eee Cie oi)Download App Question 10 fj i View this Question Online > Which of the following isnot a mutation operator in a genetic algorithm? A. Random fesetting Colm D. Difference Choose the correct answer from the options given below: 1. Aand Bonly 2. Band D only 3. Cand D only 4. D only Answer (Detailed Solution Below) Option 4: D only Vs « Genetic Algorithms Question 10 Detailed Solution The correct answeris D only © Key Points Mutation operators in a Genetic m_are used for perturbing the genes in a solution. They help in keeping the diversity of the population and avoiding premature convergence on local optima. Here's a brief explanation of the operators mentioned: + A. Random Resetting: Thisis a type of mutation operator where a specificgene in a chromosomeis randomly chosenand assigneda new value from the feasible parameter range. + B. Scramble: This operator randomly selectstwo points in the chromosome end then shuffles the genes between those points. + G. Inversion: Inversion mutation operators selecta substring (i.e.,a portion of the chromosome) and revert the order of genes within that. ~ D. Difference: Thicis eat-e inown mutation chereter in the conted of cenciic: sicodiiuns:Therefore, the answer is 4) D only. Tie aR Rarity Start Complete Exam Preparation eC Scat lee mana: pos cieroo " pits jownload App Question 11 View this Question Online > Which Al Systemmimicsthe evolutionary processto generate increasingly better solutionsto a processto a problem? A. Self organizing neural network. B.Backpropagation neural network. C. Genetic algorithm. D. Forward propagation, neural network. Choose the correct answer from the options given below: Wey 2. BOnly 3. C Only 4, D Only ‘Answer (Detailed Solution Below) Option 3: C Only Genetic Algorithms Question 11 Detailed SolutionTES ares Ss OEE © Key Points + Genetic algorithms mimic the process of natural. selection and evolution to generate Increasingly better solutions to a problem. + They involve the use of populations of potential solutions, where individuals (potential solutions) undergo geneti rations such as mutation , crossover , and selection to produce new generations of naval + Over successivegenerations, thetalgorithm tends to converge towards better solutions. ©; Additional_Information + Self-organizing neural network: This refers to neural networks that can organize themselves based on the input data. They learn to form internal representations without explicit supervision. + Backpropagation neural network: Backpropagation is a supervised learning algorithm used for training artificial neural networks. It involves calculating the gradient of the error with respect to the weights of the network and adjusting the weights to minimize the error. + Forward propagation neural network: Forward propagation Is the process of passing input data through the neural network to generate an output. In this phase, input signals are processedlayer by layer until the final output is produced without adjusting the weights. oa erty ee Same Ce Cell PLO ie j Rac eas Cesar poetic Download App Question 12 View this Question Online > A 4-input neuron has weights 1, 2, 3, 4. The transfer function is linear with the constantof proportionality being equal to 3. The inputs are 5, 7, 10, 30, respectively Then the output will be, 1. 120 2. 213 7A 4. 507Answer (Detailed Solution Below) Option 4: 507 Genetic Algorithms Question 12 Detailed Solution The correct answer is 507 © Key Points. Alinear neuron isa basictype of artificialneuron or node in aneural network that performs a linear transformation on its inputs. It is a fundamental building block in the*field of neural networks. The output of a linear neuron is computed by taking a weighted sumof its input values and applying 2 constant factor called the bias or constant of proportionality, Tocalculatethe output of the neuron, you canuse the formula for a linear neuron: Output = Constant of Proportionality x (})" (Weight, x Input,)) + In this case: = Constant of Propotti 3 ° Weights = [1, 2, 3. 4] + Inputs = [5, 7, 10, 30] * So. theoutput WoHld PE 5 2x 743 x 10-44 x 30) + Now, epruiaiethg Vales: 14+ 30 + 120) © Output =3 x 169 © Output = 507 Therefore, the correct answer is: 4) 507 EX ean Baril} Start Complete Exam Preparation Cleese hes f Pe cieoeg Qu Download App Rema ettQuestion 13: View this Question Online > © Let the population of chromosomesin genetic m is represented in terms of binary number. The strength of fitness of a chrom imal form, x, is given by Sf (2) = fh. where © The mene where: ke (01000),(10011)} \e strength of fitness of chromosome(11000)is 1,24 2. 576 3.14.4 4. 49.2 Answer (Detailed Solution Below) Option 4: 49.2 Genetic Algorithms Question 13 Detailed Solution P= {(01101),(11000),(01000),(10011)} Also, strength of fitness of a chromosome in decimal form, x is given by: Sf(2)= ay where f(z) =2? So, first convert the population in decimal form, then find f(x). P Valuein decimal | 44) = 2 01101 8 169 XN ,Jee Ftd x 01000 8 64 10011 19 361 We have to find the strength of fitness of chromosome 11000, 11000 in decimal = 24, f(24)= 576 51 @) = tend Sf(x)= 576/1170 Sf(x)= 0.492 ean pari} Start Complete Exam Preparation CR Tet cles Por cconre Jownload App Question 14: View this Question Online > A 4- input neuron hasweights 1, 2, 3, 4. The transfer function is linear with the constant of proportionality being equal to 3. The inputs are 5, 7, 10, 30 respectively. Output will be: FAnswer (Detailed Solution Below) Option 4: 507 Genetic Algorithms Question 14 Detailed Solution Given weights ere: 1, 2, 3 and 4 Aswe have 4- input neurojimiaputs given’are: 5, 7, 10, 30. Constant of proportionality Output will be = Constant of proportionality x [1x5 + 2x 7+ 3x 10+ 4x 30] = 3x [5+ 144 30+ 120] 3x 169 507 Tien ariel} Sy Camel) CM) CMa ella Rear Sot lee bees Dostana Download App pits Question 15: View this Question Online > Given below are two statements: ‘Statement I: A genetic algorithm isa stochastichill-climbing searchin which a large population of statesis maintained. ‘Statement II: In nondeterministic environments, agents can apply AND-OR searchto generate contingent plans that reach the goal regardless of which outcomes occur during execution. In the light of the above statements, choose the Correct answer from the options given below q Wicorenent and Statement are true 2. Both Statement! and Statement Il are false3. Statement! is correct but Statement Il is false 4. Statement is incorrect but Statement is true Answer (Detailed Solution Below) Option 1: Both Statement| and Statementl are true Genetic Algorithms Question 15 Detailed Solution The correct answeris option 1. A genetic algorithm isa stochastichill-climbing algorit O~ wide population of states. Mutation and crossover, which blends pairs e aS pulation, create new states Hence Statement | is correct. ‘Agents may use AND- OR cca ete S° environments to produce contingent plans that achieve the target regardl: ch outcomes occur during execution Hence Statement Il is correct © Additional Information. + AND-OR search trees + OR nodes: The only branching in a deterministic setting is implemented by the agents ‘own choicesin each state; we call these nodes OR nodes. = AND nodes: Branching is often implemented in a non- deterministic setting by the environments choice of outcome for each action, which we call nodes AND nodes.