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

Similar questions

TM M = (Q, E, I, 6, 90, 9a, qr), where Q = {90, 91, 92, 9a, 9r}, Σ = {0, 1}, r = {0, 1, L}, and 8 is: 8(qo, U) = (qr, U, R) 8(90, 0) = 8(go, 1) (91, 0, R) (qo, 1, R) = 8(g1, L) = (ga, U, R) 8(91,0) = (91, 0, R) 8(91, 1) = (92, 1, R) = (92, U, R) 8(92, U) 8(92, 0) = (90, 0, R) 8(92, 1) = (92, 1, R) i. Prove that M is NOT a decider. ii. Mathematically describe the language A that M recognises. Prove that A ≤ L(M). iii. Prove A = L(M). iv. Is A Turing-decidable? [Give clear reasons for your answer. No need for a formal proof.]
Write the algorithm for the problem that works in constant space and time complexity. Input: N OUTPUT: 1 if Tom wins, 0 if Jerry wins.
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.
Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer) Now consider Fibonacci numbers this way: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, etc. A Fibonacci sequence f(n) is of the form: f(1) = f(2) = 1, and f(n+2) = f(n) + f(n+1) for n >= 1. 6. Write a Java computer program that prints out Fibonacci numbers in a certain data type from f(1) until f(n) with n an integer you input from the keyboard. 7
The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm. Algorithm Euclid(a,b)Require: a, b ≥ 0Ensure: a = GCD(a, b) while b ̸= 0 do t ← b b ← a mod b a ← tend whilereturn a What is the maximum number of iterations of the While loop the algorithm will do?
Set Let S = {1, 4} and T = {a, b, c}, computer: S X T = S X S = |T| = T − S = P(S) =
A certain cat shelter has devised a novel way of making prospective adopters choose their new pet. To remove pet owners’ biases regarding breed, age, or looks, they are led blindfolded into a room containing all the cats up for adoption and must bring home whichever they pick up. Suppose you are trying to adopt two cats, and the shelter contains a total of N cats in one of only two colors: black or orange. is it still possible to pick up two black cats with probability ½, given that there is an even number of orange cats in the room? If so, how many cats should be in the room? How many black, how many orange?
Modeling the spread of a virus like COVID-19 using recursion. Let N = total population (assumed constant, disregarding deaths, births, immigration, and emigration). S n = number who are susceptible to the disease at time n (n is in weeks). I n = number who are infected (and contagious) at time n. R n = number who are recovered (and not contagiuous) at time n. The total population is divided between these three groups: N = S n + I n + R n There are several hidden assumptions here that may or may not apply to COVID-19, such as a recovered person is assumed to not be able to get the disease a second time, at least within the time window being examined. On week 0 (the start), you assume a certain small number of people have the infection (just to get things going). Everyone else is initially susceptible, and no one is recovered. There are two constants of interest: Let period = time period that it takes for an infected person to recover (recover meaning they become not infectious to…
Program this
Suppose that f (n) = 0(g(n)) and f(n) = 0(h(n)), then it is ( always / sometimes / never ) the case that g(n) = 0(h(n)).
Imagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.
Pseudo-random numbers Randomly generating numbers is a crucial subroutine of many algorithms in computer sci- ence. Because computers execute deterministic code, it is not possible (without external influence) to generate truly random numbers. Hence, computers actually generate psuedo- random numbers. The linear congruential method is a simple method for generating pseudo-random numbers. Let m be a positive integer and a be an integer 2 < a <m, and c be an integer 0 ≤ c<m. A linear congruential method uses the following recurrence relation to define a sequence of pseudo-random numbers: In+1=a+c mod m (a) Use the linear congruence method with a = 8, c=5, and m = 14, to compute the first 15 pseudo-random numbers when co= 1. That is, compute zo,X1, X 14- (b) From part (a) we should notice that, with m = 14, the sequence does not contain all 14 numbers in the set Z14. In particular because the sequence is periodic. Using m = 8, determine the value of a which does give all 8…