Question

A fast food manager wants to be prepared to have enough of COIN change (pennies, nickels,...

  1. A fast food manager wants to be prepared to have enough of COIN change (pennies, nickels, dimes, and quarters) at the drive through window ready to give to customers. Let X be the amount of COIN change that any customer is given back when they pay for their food at the drive-up window (in decimal form.) Suppose f(x) is as given below.

f(x) = kx(1-x) where 0 ≤ x < 1.00                and k is some constant > 0

  1. Find the value of k that makes this a legitimate pdf. (HINT: For the 2nd condition, set the integral equal to one, do the integration, and solve for k. WHY?)
  2. Graph f(x), including a scale for the X and Y axes.
  3. Show that f(x) is a legitimate pdf for X.
  4. Find the MEAN amount of change a customer receives back when paying for their order.
  5. Using your graph from part (b) and the fact that this distribution is symmetric, what is the median of this distribution? Recall that to the left of the median, there is an area of .5, and to the right of the median, there is an area of .5. Do not use integration for this part.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

l 3Page No. Date Q.Z a.5 fer C22T-)d -) 3 2C fegitimate pdf sf x f is YnennPage No. Date エtis RIR hs medign Median こ0-5

Add a comment
Know the answer?
Add Answer to:
A fast food manager wants to be prepared to have enough of COIN change (pennies, nickels,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 2. Write a JAVA program that prints the numbe r of quarters, dimes, nickels, and pennies...

    2. Write a JAVA program that prints the numbe r of quarters, dimes, nickels, and pennies that a customer should get back as change. Declare and initialize all memory locations as integers. On Output show the original change amount as a monetary amount with the two positions of decimal. Run your program once by performing a compile-time initializations using 92 cents for the calue to be converted. Go into your source code and change the 92 to 27. Return the...

  • Problem: Implement (in C) the dynamic program algorithm for the coin-change algorithm, discussed in class. Assume...

    Problem: Implement (in C) the dynamic program algorithm for the coin-change algorithm, discussed in class. Assume that the coins with which you make change are quarters, dimes, nickels and pennies. Thus you are going to set n = 4 in your program. The amount k for which you have to make change will be provided by the user and your program will return the minimum number of coins needed and also the break-up of the change in terms of the...

  • Your program must meet the following specifications: 1. At program start, assume a stock of 10 nickels, 10 dimes, 10...

    Your program must meet the following specifications: 1. At program start, assume a stock of 10 nickels, 10 dimes, 10 quarters, and 10 pennies. 2. Repeatedly prompt the user for a price in the form xX.xx, where X denotes a digit, or to enter q' to quit 3. When a price is entered a. If the price entered is negative, print an error message and start over requesting either a new price or to quit (indicated by entering a 'q)...

  • Can you please help me with creating this Java Code using the following pseudocode? Make Change C...

    Can you please help me with creating this Java Code using the following pseudocode? Make Change Calculator (100 points + 5 ex.cr.)                                                                                                                                  2019 In this program (closely related to the change calculator done as the prior assignment) you will make “change for a dollar” using the most efficient set of coins possible. In Part A you will give the fewest quarters, dimes, nickels, and pennies possible (i.e., without regard to any ‘limits’ on coin counts), but in Part B you...

  • C++ HW Question Your program will simulate a simple change maker for a vending machine. It...

    C++ HW Question Your program will simulate a simple change maker for a vending machine. It will start with a stock of coins and dollars. It will then repeatedly request the price for an item to be purchased or to quit. If given a price, it will accept nickels, dimes, quarters, one-dollar and five-dollar bills—deposited one at a time—in payment. When the user has deposited enough to cover the cost of the item, the program will calculate the coins to...

  • Consider a cylindrical capacitor like that shown in Fig. 24.6. Let d = rb − ra...

    Consider a cylindrical capacitor like that shown in Fig. 24.6. Let d = rb − ra be the spacing between the inner and outer conductors. (a) Let the radii of the two conductors be only slightly different, so that d << ra. Show that the result derived in Example 24.4 (Section 24.1) for the capacitance of a cylindrical capacitor then reduces to Eq. (24.2), the equation for the capacitance of a parallel-plate capacitor, with A being the surface area of...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT