Object Reward Weight A 20 1 B 5 10 D 40 8. 15 7 25 4 7 2 Maximum weight = 12 The above problem is a 0/1 Knapsack problem. You have to carry the different objects in your bag in a way such that the reward is maximized without exceeding the weight limit. You can carry an object exactly once but you always have to carry the object labelled “H". Assuming you are asked to use Genetic Algorithm for this problem, answer the following questions 1. Encode the problem and create an initial population of 4 different chromosomes 2. Explain what would be an appropriate fitness function for this problem. Use the fitness function and perform natural selection to choose the 2 fittest chromosomes. ' 3. Using the selected chromosomes perform a single point crossover to get 2 offspring 4. Perform mutation and check the fitness of the final offspring. Explain your work. 4.

Q: The Knapsack Problem is a famous computer science problem that is defined as follows: imagine you…

A: In 0/1 Knapsack we either put the item completely to knapsack or do not put it.

Q: A team sport game has m players in a team and a tournament can have n competing teams. Team ?1 can…

A: (1) Example :{ 20,30,40} , {18,28,38} , {16,26,36} (they can stand in rows) , {20,28,36} doesn't fit…

Q: A chess knight, on one turn, moves either two squares vertically and one horizontally, or two…

A:

Q: The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle.…

A: Summary: In this question, we have to write a Josephus problem in C language. In this program, we…

Q: Consider the doctor-patient problem. There is a Doctor's clinic which has one Doctor, one patient…

A:

Q: Q2. The following algorithm returns the product of two numbers, a and b. The parameters x and y are…

A: Recursion is a problem-solving technique where another method calls himself two or more times within…

Q: Imagine that you have a problem P that you know is N P-complete. For this problem you have two…

A: Answer: if any problem can be solved in exponential time  then it necessary to solve in polynomial…

Q: An object leaves point P, with coordinates (-1,0) and travels with velocity v,=1 in a straight line…

A: Given: The objective is to write a program FULLNAME2 contain optimal h value with x and y values as…

Q: Consider the following bridge crossing problem where n people with speeds s1, ··· , sn wish to cross…

A: Lets see the solution.

Q: the true value. Is 0 (zero) an admissible heuristic? If O were used as a heuristic in A* search, it…

A:

Q: You and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift…

A: Answer: I have given answered in the handwritten format and also I have explained this question.

Q: Suppose you have been given a map of 6 cities connected with each other via different paths. Your…

A: The complete answer is given below with explanation.

Q: Problem 2 Suppose we have height and weight and its corresponding Tshirt size of several customers.…

A: The ask is to predict the t-shirt size for Anna from the given data using KNN algorithm with K=5 and…

Q: X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They…

A: The objective is to write the program based on the given data and output also.

Q: X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They…

A: C Program:// Include the header files#include<stdio.h>#include<stdlib.h>// Declare and…

Q: Suppose you are given two sets A and B, each containing n positive integers. Let a; be the i th…

A: Consider A and B are two sets contain n positive elements each. Now use following MAX-CALCULATE ()…

Q: Domino's pizza is the tastiest pizza to exist, and the reason for that is his special, juicy…

A: Answer is given below .

Q: For this problem, we will explore the issue of truthfulness in the Stable Matching Problem and…

A: Actually, given information; we will explore the issue of truthfulness in the StableMatching Problem…

Q: Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain…

A: Answer: Our guidelines is answer the first three question from the first question. I have given…

Q: You are going to purchase items from a store that can carry a maximal weight of 'w' into your…

A: Given: You are going to purchase items from a store that can carry a maximal weight of 'w' into your…

Q: Assume you are living with two felines: An and B. There are n resting where the two felines normally…

A: Here have to determine correct option forliving with two felines Programming problem statement.

Q: Consider a game with three dice, namely, A, B and C. Each die, when rolled, generates a number…

A: Below are the answers with explanation: As per our company guidelines we are supposed to answer only…

Q: Question: You are asked to learn the concept of "Malaysian Economy Car" from the following data: CAR…

A: Candidate Elimination Algorithm The candidate elimination algorithm incrementally builds the version…

Q: The journey Ben and his friends can be described as follows: There is a total of B dishes on the…

A: here is the python code

Q: Consider GCET’s central library where the librarian Mario is required to sort the books before…

A:

Q: Consider GCET’s central library where the librarian Mario is required to sort the books before…

A: Answer : The best sorting technique here we can use to sort books would be quicksort wherein we…

Q: (Dynamic Programming, Coin-row problem) There is a row of n coins whose values are some positive…

A: Set Min[i] equal to Infinity for all of iMin[0]=0 // Solution 1For i = 1 to S   For j = 0 to N - 1…

Q: (Dynamic Programming, Coin-row problem) There is a row of n coins whose values are some positive…

A: Required:

Q: 2. A celebrity among a group of n people is a person who knows nobody but is known by everybody…

A:

Q: agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the…

A: An hueristic function is admissable when h(n)⁢ is never greater than the actual cost of the shortest…

Q: agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the…

A: Note: Answering the first three subparts as per the guidelines. Given : Search task is given Agent…

Q: Consider you are standing at a street corner, in a city where the streets are laid out in a very…

A: Code: This programe helps to estimate the expected distance a man would move from astarting point…

Q: We want to purchase an item of price and for that, we have an unlimited (!) supply of three types of…

A: The dynamic programming algorithm for problem 4 will be: 1. We will make a 1-D dp array where dp[i]…

Q: Let pn(x) be the probability of selling the house to the highest bidder when there are n people, and…

A: Let pn(x) be the probability of selling the house to the highest bidder when there are n people, and…

Q: from L to R (L is strictly less than R). Ramsay knows that the dish will be tasty and not only…

A: Below is the simplified python code for the above listed problem:

Q: Start from any random state of the 8 puzzle problem. State the goal state for your problem. Then…

A: It is defined as a simple game consisting of a 3 x 3 grid (containing 9 squares). One of the squares…

Q: ird of size N*M. Rows are numbered by integers from 1 to N and col umbered by integers from 1 to M.…

A: It is defined as a powerful general-purpose programming language. It is used in web development,…

Q: The Physics teacher in Alexandra's class is teaching concepts of a bouncing ball. The rubber ball…

A: for _ in range(int(input())):    n,k=map(int,input().split())    l=input().split(" ")    for i in…

Q: The Physics teacher in Alexandra's class is teaching concepts of a bouncing ball. The rubber ball…

A:

Q: The Physics teacher in Alexandra's class is teaching concepts of a bouncing ball. The rubber ball…

A: Here is the detailed and simplified python code for the given question:

Q: The Physics teacher in Alexandra's class is teaching concepts of a bouncing ball. The rubber ball…

A: Below is the detailed python code for the given question statement:

Q: Consider the following sequential game. There are two players, Player 1 and Player 2, who alternate…

A: Answer :-

Q: (Dynamic Programming, Coin-row problem) There is a row of n coins whose values are some positive…

A: Required:

Q: Let l be a line in the x-y plane. If l is a vertical line, its equation is x 5a for some real number…

A: Since the language is not mentioned I am coding this using C++.

Q: A certain cat shelter has devised a novel way of making prospective adopters choose their new pet.…

A: Let say, Total number of cats = N. The number of orange cats is x, which is even. The number of…

Q: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the help of…

A: Answer:

Q: Based on the Gale-Shapley Algorithm, what would happen if we allow any man m or woman ww to have…

A: It is defined as an efficient algorithm that is used to solve the Stable Matching problem. It takes…

Q: a rod of length n inches and an array of prices that contains prices of all pieces of size smaller…

A: solution in the assembly programming language

Q: Consider a set of movies M1, M2, ... , Mk. There is a set of customers, each one of which indicates…

A: We can model this problem with the help of a graph. Each node represents a movie Mi and each edge…