You found an exciting summer job for five weeks. It pays a set amount per hour (for example, $15.50). Suppose the total tax you pay on your summer job income is 16%. After paying the taxes, you spend 12% of your net income (income after taxes) to buy new clothes and other accessories for the next school year and 1% on buying school supplies. After buying clothes and school supplies, you use 30% of the remaining money to buy savings bonds. For each whole dollar, you spend to purchase savings bonds (rounded down), your parents contribute $0.50 of additional savings bonds for you. Write a program that prompts the user to enter the pay rate per hour and the number of hours you worked each week. The program then outputs the following: a. Your income before and after taxes from your summer job. b. The money you spend on clothes and other accessories. c. The money you spend on school supplies. d. The money you spend to buy savings bonds. e. The money your parents spend to buy additional savings bonds for you. f. The remaining income after expenses and investments.

You found an exciting summer job for five weeks. It pays a set amount per hour (for example, $15.50). Suppose the total tax you pay on your summer job income is 16%. After paying the taxes, you spend 12% of your net income (income after taxes) to buy new clothes and other accessories for the next school year and 1% on buying school supplies. After buying clothes and school supplies, you use 30% of the remaining money to buy savings bonds. For each whole dollar, you spend to purchase savings bonds (rounded down), your parents contribute $0.50 of additional savings bonds for you. Write a program that prompts the user to enter the pay rate per hour and the number of hours you worked each week. The program then outputs the following: a. Your income before and after taxes from your summer job. b. The money you spend on clothes and other accessories. c. The money you spend on school supplies. d. The money you spend to buy savings bonds. e. The money your parents spend to buy additional savings bonds for you. f. The remaining income after expenses and investments.

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

A flight of stairs has 10 steps numbered 1 to 10 as shown in the figure below. i. How many ways could you climb up the set of stairs, assuming that you can skip any number of stairs with each step, but you must end on step 10 and you can only go up, never down and never remaining on the same step. ii. How many ways could you climb up the set of stairs, assuming you take exactly 4 steps. Again, your staircase climb ends on step 10. JAlthough there are different ways in which you could solve this problem, model the problem as a balls and bins problem for full credit.
The Livewright Medical Supplies Company has a total of 12 salespeople it wants to assign to three regionsthe South, the East, and the Midwest. A salesperson in the South earns $600 in profit per month for the company, a salesperson in the East eams $540, and a salesperson in the Midwest earns $375. The southern region can have a maximum assignment of 5 salespeople. The.company has a total of $750 per day available for expenses for all 12 salespeople. A salesperson in the South has average expenses of $80 per day, a salesperson in the East has average expenses of$70_pér day, and a salesperson in the Midwest has average daily expenses of $50. The company wants to detemine the number of salespeople to assign to each region to maximize profit. a. Formulate an integer programming model for this problem. b. Solve this model by using the computer.
There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.
You found an exciting summer job for five weeks. It pays, say, $15.50 per hour. Suppose thatthe total tax you pay on your summer job income is 14%. After paying the taxes, you spend10% of your net income to buy new clothes and other accessories for the next school yearand 1% to buy school supplies. After buying clothes and school supplies, you use 25% of theremaining money to buy savings bonds. For each dollar you spend to buy savings bonds,your parents spend $0.50 to buy additional savings bonds for you. Write a flowchart that prompts the user to enter the number of hours you worked each week. The program thenoutputs the following:a. Your income before and after taxes from your summer job.b. The money you spend on clothes and other accessories.c. The money you spend on school supplies.d. The money you spend to buy savings bonds.e. The money your parents spend to buy additional savings bonds for you.
Whenever you mail a letter, you must decide how much postage to put on the envelope. You like to use this rule of thumb – use a stamp for every five sheets of paper or fraction thereof. For example, if you have 11 sheets of paper, then you use three stamps. Since you’re parsimonious, if an envelope requires more than three stamps, then you simply don’t mail the envelope. Show how the number of stamps per envelope would be calculated. Provide a solution in the form of pseudocode. Your pseudocode must read in appropriate data and print how many stamps to use.
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…
The distance d between a point p(x, y), where x and y are the coordinates of p, and the center of a circle (a, b), where a and b are the coordinates of the center, is given by the formula: (a, b). r d = (x – a)² + (y – b)² r The point p(x, y) is considered inside the circle if d r. (x, y)' (x', y') Write a Java class called CirclePointthat: a. Reads from the user 2 integer values x and y represent the coordinates of the point p, b. Reads from the user 2 integer values a and b represent the coordinates of the center of the circle, c. Reads from the user a real value r represents the radius of the circle, d. Calculates and prints the distance d (rounded to 2 decimal places) between the point p and the center of the circle, and e. Checks and prints whether the point is inside, on or outside the circle. NOTE: if the radius value is negative, an error message should be shown. Sample Run 1: ==================== Enter the coordinates of the point: 5 7 Enter the coordinates of the center of…
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.
Maximization Problem: Production Optimization A metallurgical company produces three types of metal products: A, B and C. These Products require different amounts of resources to manufacture. The company has limitations on the number of labor hours, machines available and raw Materials. The goal is to maximize total profit. Variables X₁: Quantity of products A to produce. X₂: Quantity of products B to produce. X3: Quantity of products C to be produced. X4: Hours of labor used. X5: Hours of machines used. X: Amount of raw material used for A. X7: Amount of raw material used for B. X₂: Amount of raw material used for C. Xg: Upper limit on total product production. X10: Upper limit on the number of work hours available. Objective Function Maximize Z = 5x, +8x₂+6x3 Restrictions 2x₁+4x₂+3x3 ≤ x₂ (Labor restriction) 3x₁+2x₂+5x3 ≤ X5 (Machine restriction) X ≤ 5x₂ (Raw material for A) 2x, ≤ 6x₂ (Raw material for B) 3x ≤ 4x, (Raw material for C) X₂+x₂+x3 ≤ x₂ (Limit on total production) X4 SX₂0…
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.
There are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.