Write a C program to solve the fractional knapsack problem. For example, the weights and values of 3 divisible items are given in the table below. The capacity of the knapsack bag is 50. Find an optimal solution to maximize the value to weight ratio. Item Weight Value 1 10 $60 2 20 $100 3 30 $120 Note: Read knapsack capacity, number of items, weights of items and profits of items from the user. Print the solution. Round the solution to one fractional digit after decimal point. For example the solution for the above problem would be 1.0 1.0 0.7 For example:

Write a C program to solve the fractional knapsack problem. For example, the weights and values of 3 divisible items are given in the table below. The capacity of the knapsack bag is 50. Find an optimal solution to maximize the value to weight ratio. Item Weight Value 1 10 $60 2 20 $100 3 30 $120 Note: Read knapsack capacity, number of items, weights of items and profits of items from the user. Print the solution. Round the solution to one fractional digit after decimal point. For example the solution for the above problem would be 1.0 1.0 0.7 For example:

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

consider a jewler who shows a collection of diamonds to a person. all diamonds have different integer ounce weights and are laid out in a single row on the table. what is the largest weight amount of diamonds that the person can take, provided that the person cannot select adjacent diamonds? use standard pseudocode notation similar to python to write a dynamic programming bottom up algorithm that solves this problem for any n number of diamonds.
A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Ex: If the input is: 1712 the output is: 1712 is a leap year. Ex: If the input is: 1913 the output is: 1913 is not a leap year. Your program must define and call the following function. The function should return True if the input year is a leap year or False otherwise.def is_leap_year(user_year)
Computer Science C++ please, use Monte Carlo integration to calculate the volume of a d-dimensional hypersphere of radius r = 1. (Note that for d=1, 2, and 3, the common names for d-dimensional volume are length, area, and volume, respectively.) Print out each volume and narrow the answer down to 4 digits with 99% confidence. How far can you push d for this method?
Using pyhton coding to solve: Suppose the Great Frederick Fair wants to update its ticketing software. They need you to write a program to handle the price calculations, using the rules*: ● The basic price of a ticket is $40. Senior citizens (age >= 65) get a 50% discount. Children under 6 are free (100% discount). For residents of Frederick County, the basic price is $35; the same discounts still apply. So the individual ticket prices range from $0 to $40. ● . Your program should request age and county name from the user. The age will be entered as an integer and the county name as a string. Before calculating the price, confirm that the user's age is valid - not negative and not more than 110. If it is not, give a message and do not do the price calculation. Also, the county name should not be case sensitive - for example, Frederick, frederick, and FREDERICK should all be acceptable. Your program should then calculate and print out the ticket price, using the appropriate…
Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…
G E N E T I C - A L G O R I T H M OBJECT REWARD WEIGHT A 20 1 B 5 2 C 10 3 D 40 8 E 15 7 F 25 4 G 4 5 H 7 2 Here, 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 labeled “H”. Encode the problem and create an initial population of 4 different chromosomes. 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. Using the selected chromosomes perform a single point crossover to get 2 offspring. Perform mutation and check the fitness of the final offspring. Explain your work.
Start with a pile of n stones and successively split a pile into two smaller piles until each pile has only one Each time a split happens, multiply the number of stones in each of the two smaller piles. (For example, if a pile has 15 stones and you split it into a pile of 7 and another pile of 8 stones, multiply 7 and 8.) The goal of this problem is to show that no matter how the pile of n stones are split, the sum of the products computed at each split is equal to n(n - 1)/2. Using strong mathematical induction, prove that no matter how the pile of n stones are split, the sum of the products computed at each split is equal to n(n - 1)/2.
What Python code will solve the following: The goal of this section is to estimate the probabilities Pij (transition probabilities) associated with finding food from any location (i, j) inside the maze. A rat will be considered successful in finding food if the probability of finding food from a given location exceeds 0.5. 1. Use Equation (1) to write down equations for each probability Pij for i = 1, 2, · · · , 6, j = 1, 2, 3, · · · , 5. Equation 1 is : Pij = 1/4Pi-1j + 1/4 Pi+1j +1/4 Pij-1 + 1/4Pij+1 2. Notice that your equations constitutes a system of linear equations with 30 equations and 30 unknowns, with the unknowns as the transition probabilities. Identify the coefficient matrix for the system of equations and write your system in the form Ap = b, where b is some constant vector and p the vector of transition probabilities, ordered from the upper left hand corner of the maze to the lower right hand corner. The goal is to solve the system for p. 2 3. How would you characterize…
In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least one person sitting. Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. Return that maximum distance to closest person. A. Example 1: i. Input: [1, 0, 0, 0, 1, 0, 1] ii. Output: 2 • Explanation: • If Alex sits in the second open seat (seats[2]), then the closest person has distance 2. • If Alex sits in any other open seat, the closest person has distance 1. • Thus, the maximum distance to the closest person is 2. NOTE: "using C++ code"
A group of m people is considering sharing the cost of buying some items for their summer camp. There are a total of n possible items to purchase. Each person writes a list of the items they are interested in purchasing on a paper. For example, person one may write “boat, trampoline, hot tub,” whereas person two may write “ hot tub, kayak, paddleboard”. There is no limit to how many items a person registers on their sheet. The goal is to determine if at least k items can be purchased. The following rules apply 1. The cost of any purchased item must be split equally among all those who listed that item on their sheet. No person can refuse to contribute to an item chosen for purchase, which is listed on their sheet. 2. Since each person has a limited budget, they may only contribute to at most one item on their list. The problem of determining if at least k items can be purchased is called SummerCamp. Show that this problem is NP-complete.
amateur in computer science any idea how to go about solving this? Part A – Implement a change maker program. This program will calculate the correct change from a dollar for the purchase of an item that costs between 0 and 100 cents. The amount of change must be optimal in that you should make maximum use of the largest available coins Example Scenarios: How much is your item (in cents)? >> 65 Your change is: 1 quarter, 1 dime, 0 nickels, and 0 pennies How much is your item (in cents)? >> 43 cents Your change is: 2 quarter, 0 dime, 1 nickels, and 2 pennies Part B – Write a program that prompts for an input string of variable length. Once input, your program will do the following: Output the length of the string Output the first and last characters of the string Output the middle character of the string (and its position) Transpose (switch) the two halves; 2nd half starts with the middle character. Print the string out in all upper case characters…