Question

in phyton programming:

with numpy

Create a function called biochild.

 The function has as parameters the number m and the lists ??????h?? and ??????h??.

 The lists ??????h?? and ??????h?? contain 0’s and 1’s.

 For example: ??????h?? = [1,0,0,1,0,1] and ??????h?? = [1,1,1,0,0,1]

 Both lists have the same length ?.

 The 0's and 1's represent bits of information (remember that a bit is 0 or 1).

 The function has to generate a new list (child).  The child list must have the same length ?.

 child is generated by randomly combining part of the child's information ??????h?? and ??????h??.

 The first part of the child list will be made up of the first ? bits of ??????h?? and the second part by the last ? - ? bits of the ??????h??.

 For example, if ? = 3, ??????h?? = [?, ?, ?, 1,0,1] and ??????h?? = [1,1,1, ?, ?, ?], then ?h??? = [1,0,0,0,0,1].

 The value ? has to be chosen randomly by the function.

 After generating child, each bit in the list is considered for mutation.

 For each bit of child, with probability ? the bit is “mutated” by being replaced by its inverse (If the bit is 0 it is replaced by 1, and if it is 1 it is replaced by 0).

 Finally, the function returns the list child.

Answer 1

Explanation :-

# First I am generating b as random number from 1 to len of biomother - 1

# Next I have initialized child_list to insert first b bits from biomother

# And then n - b bits from biofather starting from b index

# Finally after forming the child_list , I am making a final_list which has inversed bits of child_list

# Lastly returning the final_list formed.

#Function  

def biochild(m,biomother,biofather):
import random
child_list = []
len_biomother = len(biomother)
b = random.randint(1,len_biomother-1)
  
for i in range(b):
child_list.append(biomother[i])
  
for i in range(b,len(biofather)):
child_list.append(biofather[i])
  
final_list = []
for i in child_list:
if i == 0:
final_list.append(1)
else:
final_list.append(0)
return final_list