1- Suppose a genetic algorithm uses chromosomes of the form X = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual X be calculated as: f(X) = (a + b)(c + d) + (e + f) − (g+h) Let the initial population consist of 6 following chromosomes: I. II. III. X1=65413532 X2=87126601 X3 239 21285 X4=41852094 X5 83 93 1775 X6=52769863 Evaluate the fitness of each individual (show all stages). Then select 4 of them for next generation and write chromosomes which are selected. (Consider maximization.) Perform the following crossover operation on the initial population: Do crossover on X2 and X6 (parents) and name offspring as X7 and X8. Consider one-point crossover and the crossover point between "c" and "d". Write chromosomes X7 and X8. Evaluate offspring generated by crossover operation above (Chromosomes X7 and X8). Do their fitness are better than their parents?

1- Suppose a genetic algorithm uses chromosomes of the form X = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual X be calculated as: f(X) = (a + b)(c + d) + (e + f) − (g+h) Let the initial population consist of 6 following chromosomes: I. II. III. X1=65413532 X2=87126601 X3 239 21285 X4=41852094 X5 83 93 1775 X6=52769863 Evaluate the fitness of each individual (show all stages). Then select 4 of them for next generation and write chromosomes which are selected. (Consider maximization.) Perform the following crossover operation on the initial population: Do crossover on X2 and X6 (parents) and name offspring as X7 and X8. Consider one-point crossover and the crossover point between "c" and "d". Write chromosomes X7 and X8. Evaluate offspring generated by crossover operation above (Chromosomes X7 and X8). Do their fitness are better than their parents?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer)…

A: In fibonacci series next number is the sum of previous two numbers.

Q: 10. Let K be your birth year and let N be your 7-digit phone number. Use Euclid's Algorithm to find…

A: 10.

Q: Create a random number generation algorithm using a distribution represented by a finite series of…

A: A random number generation algorithm using a distribution represented by a finite series of weights.

Q: Find the answer on the given sets below corresponding the operations (union, intersection and…

A: Complement of a set: The complement of any set is represented as A', B', C' etc. In other words, we…

Q: A certain computer algorithm executes twice as many operations when it is run with an input of size…

A: In mathematics, a geometric progression, also known as a geometric sequence, is a sequence of…

Q: void X(int n) { for(int i=0; i<n; i++) for(int j=0; j<n; j++) for(int k=0; k<n; k++)…

A: summary: - hence we discussed all the points

Q: The search algorithm developed will be used for users to search the catalog for all items matching…

A: Let us first see what exactly is happening here. Assume that you are searching for something on a…

Q: The english alphabet contains 26 letters: 21 consonants (including y) and 5 vowels. The following…

Q: The following algorithm construct a sequence of positive whole numbers, which demonstrates the…

A: Actually, algorithm is an step by step process.

Q: number of operations

A: Explanation: m=0; for( i = 1 to n) for( j = i+1 to n) m= max(ai,aj,m) Then here,…

Q: MATLAB Project : Fuzzy Control of Air-conditioner • Use M a x -Min O p e r a tio n & S u g e n o’s…

A: Abstract There has been a rising concern in reducing the energy consumption in building. Heating…

Q: Pseudo-random numbers Randomly generating numbers is a crucial subroutine of many algorithms in…

A: Below is the complete solution with explanation in detail for the given question about the…

Q: Consider the following functions: ● log2 x ● x.log₂ x • (3/2)* • x/log₂ x • 2x • √x • x² • (log₂ x)²…

A: The order of growth of a function is a way to measure the rate at which the function's value…

Q: Suppose you are responsible for organizing and determining the results of an election. An election…

A: A divide and conquer algorithm for this problem. The problem of finding a winner in an election with…

Q: 2. Given three different sorting algorithms to solve a sorting problem and their runtimes are…

A: - We have to determine the sorting algorithm to be used based on the symbols and complexity…

Q: Use a Genetic Algorithm to find the value of x that maximizes XTC f(x) = sin( in the interval 0 ≤ x…

A: We have to discuss Use a Genetic Algorithm to find the value of x that maximizes.

Q: Let A = {h, i, r), B = {1,7). AxB={ BXA = { AXA = { BxB = {

A: Cartesian product of sets A and B is denoted by A×B. A × B = {(a, b) : a ∈ A and b ∈ B} Here the…

Q: Tom and Jerry being bored in this pandemic, decides to play a game. Given an integer N. On each…

A: Write an algorithm for the given problem, algorithm should be of constant space and time complexity.…

Q: (a) Consider the following algorithm. Input: A non-negative integer n. (1) If n % 5 = 0, stop.…

A: As per Bartleby rules, we are answering only one question 2. (a) We are using PYTHON here to…

Q: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into…

A: The problem you described is a classic coin change problem in the field of dynamic programming. It…

Q: There are n different sizes of boxes, from 1 to n. There is an unlimited supply of boxes of each…

A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…

Question

1- Suppose a genetic algorithm uses chromosomes of the form X = abcdefgh with a fixed length of
eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual X be
calculated as:
f(X) = (a + b)−(c+d) + (e+f) - (g+h)
Let the initial population consist of 6 following chromosomes:
I.
II.
III.
X1=65413532
X2=87126601
X3 239 21285
X4=4185 2094
X5 83931775
X6=52769863
Evaluate the fitness of each individual (show all stages). Then select 4 of them for next
generation and write chromosomes which are selected. (Consider maximization.)
Perform the following crossover operation on the initial population: Do crossover on X2
and X6 (parents) and name offspring as X7 and X8. Consider one-point crossover and
the crossover point between "c" and "d". Write chromosomes X7 and X8.
Evaluate offspring generated by crossover operation above (Chromosomes X7 and X8).
Do their fitness are better than their parents?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1 Introduction:

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

7. Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n(log2 n) operations and the second algorithm uses exactly n3/2 operations. As n grows, which algorithm uses fewer operations?
Code req positive integer decompose, find an algorithm to find the number ofnon-negative number division, or decomposition. The complexity is O(n^2). Example 1:Input: 4Output: 5Explaination:4=44=3+14=2+24=2+1+14=1+1+1+1 Example :Input: 7Output: 15Explaination:7=77=6+17=5+27=5+1+17=4+37=4+2+17=4+1+1+17=3+3+17=3+2+27=3+2+1+17=3+1+1+1+17=2+2+2+17=2+2+1+1+17=2+1+1+1+1+17=1+1+1+1+1+1+1.
Q10. Consider the following algorithm: g1 = 7 g2 = 6 For k starting at 3 and ending with 8: gk = (k-1)·gk-1 + gk-2 What is the last term, g8, of the recursive sequence generated as a result of executing this algorithm?
Algorithm 1 [WhoKnows(a1, a2, ..., an: integers)] 1: m := 0 2: for (i := 1 to n – 1) do for (j := i+1 to n) do 3: if (Jai – a;| > m) then m := |ai – a;| 4: 5: 6: end if 7: end for 8: end for 9: return m (a) What does the algorithm compute? (b) Find the exact number of comparisons performed for an input of size n? (c) What is the complexity of the algorithm in terms of big-O notation for the size of input n? (d) Open question. Can you think of a more efficient algorithm solving the same problem as Algorithm (1)? Discuss the details and the complexity.
Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Select the dominant term(s) having the steepest increase in n and specify the lowest Big-Oh complexity of each algorithm. For example, the dominant term in 0.1n + 10n4 is 10n4 and it is O(n4). Expression Dominant term(s) O(. . .) 5 + 0.001n3 + 0.025n 500n + 100n1.5 + 50n log10 n 0.3n + 5n1.5 + 2.5 · n1.75 n2 log2 n + n(log2 n)2 n log3 n + n log2 n 100n + 0.01n2 0.01n + 100n2 2n + n0.5 + 0.5n1.25 0.01n log2 n + n(log2 n)2 100n log3 n + n3 + 100n
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.
There are m towns in a straight line, with a road joining each pair of consecutive towns. Legends say that an ordinary person in one of these towns will become a hero by completing a sequence of n quests. The first quest will be completed in their home town, but after each quest they may complete their next quest either in the same town or after moving to a neighbouring town.For example, if n = 5 and m = 4, a resident of town 2 may become a hero as follows:• begin in town 2 for quest 1,• then move to town 3 for quest 2,• stay in town 3 for quest 3,• return to town 2 for quest 4, and• move to town 1 for quest 5.Design an algorithm which runs in O(nm) time and finds the total number of waysto complete n quests.
Consider array A of n numbers. We want to design a dynamic programming algorithm to find the maximum sum of consecutive numbers with at least one number. Clearly, if all numbers are positive, the maximum will be the sum of all the numbers. On the other hand, if all of them are negative, the maximum will be the largest negative number. The complexity of your dynamic programming algorithm must be O(n2). However, the running time of the most efficient algorithm is O(n). Design the most efficient algorithm you can and answer the following questions based on it. To get the full points you should design the O(n) algorithm. However, if you cannot do that, still answer the following questions based on your algorithm and you will get partial credit. Write the recursion that computes the optimal solution recursively based on the solu- (a) tion(s) to subproblem(s). Briefly explain how it computes the solution. Do not forget the base case(s) of your recursion.
%matplotlib inline import numpy as np from matplotlib import pyplot as plt import math
please answer with proper explanation and step by step solution.