b. Create a new column that gives a numerical value to the ordinal data in the category ‘Satisfaction Level’. Then sort the table by Satisfaction Level from highest to lowest.

SW Company, a chemical firm, has developed an inexpensive chemical specialty item,
and Iskandar, the manager of the company, hopes it will find a huge market as a household
product. Iskandar wants to package this product in one-gallon and two-gallon sizes.
A number of container materials would appear to be practical – glass, aluminium,
treated paper, steel, and various types of plastic. A young engineer who Iskandar hired recently
and assigned to the packaging department has done a container-disposal study that shows that
the disposal cost for one-gallon containers can vary by a factor of three depending on the
weight of the container, whether it can be recycled, whether it is easy to incinerate, whether it
has good landfill characteristics, et cetera.
SW Company’s marketing expert believes that the container material with the highest
consumer appeal is the one that happens to present the biggest disposal problem and cost to
communities. He estimates that the sales potential would be at least 10 percent less if the
easiest-to-dispose-of, salvageable container were used because this container would be
somewhat less distinctive and attractive.
Assuming that the actual costs of the containers are about the same, Iskandar must
make a decision.

You are the advisor of a Junior Achievement group in a local high school. You need to help the group make a decision about fees that must be paid to sell gardening tools at the Home and Garden Show. The group sells a set of tools for $20.00. The manufacturing cost (all variable) is $6 per set. The Home and Garden Show coordinator allows the following three payment options for groups exhibiting and selling at the show:

1.Pay a fixed booth fee of $5,600.

2.Pay a fee of $3,800 plus 10% of all revenue from tool sets sold at the show.

3.Pay 15% of all revenue from tool sets sold at the show.

REQUIRED

A.  Compute the breakeven number of tool sets for each option.

B.  Which payment plan has the highest degree of operating leverage?

C.  Which payment plan has the lowest risk of loss for the organization? Explain.

D.  At what level of revenue should the group be indifferent to options 1 and 2?

E.  Which option should Junior Achievement choose, assuming that sales are expected to be 1,000 sets of tools? Explain.

1. A 5 year bond (with $1,000 face value) was issued with an unusual coupon payment schedule. The company promises to pay the following amounts as coupon interest each year:

Time 1      $45

Time 2      $55

Time 3      $65

Time 4      $75

Time 5     $85 (The company will also pay back the face value in time 5).

(a) Find the exact bond price if YTM = 6.5%. Show your work

(b ) Explain using time value of money principles why the bond in part (a) does not sell for exactly $1,000.

2. You have won a contest that pays an award of $100,000 paid over a number of years. Consider the following three choices are given three choices for receiving the award:

A. receive 50,000 in time 0 and 50,000 in time 5

B. receive $10,000 each year from time 0 through time 9

C. receive 20,000 in each year from time 0 through 4

Assuming r > 0, rank the choices with the highest first and the lowest last. Explain your rankings

Chandler Enterprises needs someone to supply it with 142,000 cartons of machine screws per year to support its manufacturing needs over the next five years. It will cost $1,820,000 to install the equipment necessary to start production; you’ll depreciate this cost straight-line to zero over the project’s life. You estimate that in five years this equipment can be salvaged for $152,000. Your fixed production costs will be $267,000 per year, and your variable production costs should be $9.60 per carton. You also need an initial investment in net working capital of $132,000. The tax rate is 22 percent and you require a return of 12 percent on your investment. Assume that the price per carton is $16.20.

a. Calculate the project NPV.

b. What is the minimum number of cartons per year that can be supplied and still guarantee a zero NPV? Verify that the quantity you calculated is enough to at least have a zero NPV.

c. What is the highest fixed costs that could be incurred and still guarantee a zero NPV? Verify that the fixed costs you calculated are enough to at least have a zero NPV.

Problem: Charity Gala (gala.c)

Many charities support good causes, but one of the difficulties each of them has is organizing their fundraising events. You've decided that you'd like to donate your skills to create a program that organizes the typical activities at a fund-raising gala. In particular, your program will help manage the following:

1) Ticket sales

2) Silent Auction

3) Raffle

Your program will log the number of tickets sold both in advance and at the event, a silent auction for donated items, and a raffle for other donated items.

Program Details

Ticket Sales Details

You will sell tickets in advance and at the door. Prices for buying in advance and at the door will be given. Also, the total number of tickets sold in advance will be given. Each guest will have a unique number. If there are n tickets sold in advance, then these guests will be numbered 0 through n-1. As the event starts, requests to buy tickets at the door may be made and these guests will be numbered sequentially, starting at the lowest unassigned number. The maximum number of guests will be 1000.

Silent Auction Details

The silent auction will have up to 1000 items. At any time, users can bid on any item, so long as the new bid exceeds the previous bid. At the point in time when the auction is closed, the items with at least one bid are given to the users who have placed the highest bid on that item. Your program must always keep track of all of the best bids on items so that no matter when the auction closes, you'll have all the data for who has won all of the items. Any item without a bid goes to no one.

Raffle Details

There will be a given number for the total number of raffle tickets sold, that will be 1000 or fewer. Guests can buy raffle tickets for a set price of $2.00. There will be a number of prizes awarded from the raffle (not to exceed 100) after the raffle has finished. For each raffle ticket, you'll have to keep track of which guest has it. The raffle tickets will be numbered starting at 0 through the number of tickets minus one. After the raffle finishes, you will be given the raffle numbers pulled for the winners of each prize. You will be guaranteed that these numbers correspond to numbers that were previously handed out during the raffle. You must determine who wins each prize.

Information for each event is provided from a file. You will take in input from the file and produce output for each event that occurs, in order.

A skeleton of the solution for this assignment is posted on the webcourse. You must fill in the functions that are currently empty. After you write each function, you should test it before moving on. The main function should not be modified for the final submission (you may modify it during testing, as long as you return it to its initial form).

Descriptions of each function are given in the skeleton along with the function Pre- and Post-conditions. The output sample on the webcourse shows the wording you should use and how the program should run when completed. Points are allotted for following the precise wording shown.

Input Specification

The first line of the file contains the following three values, separated by spaces:

Cost of the presales tickets (in dollars), Cost of the tickets at the door (in dollars), and the number of presale tickets. The first two values will be positive real numbers to two decimal places and the last will be a positive integer.

The second line of the file will contain one positive integer representing the number of auction items.

The third line of the file will contain the two following positive integers pertaining to the raffle: the number of raffle tickets available and the number of raffle prizes.

The fourth line of the file will contain a single positive integer, numEvents, representing the number of events that occur at the fundraising event. These events are split into two groups: actions by guests at the ball and awards given (raffle, auction, person, totalrevenue). All of the actions precede all of the awards.

The following numEvents lines will contain information about each event that occurs, with one event or award described for each line.

You will produce exactly one line of output for each event described. Here are the formats of each event that could occur:

If a patron buys a ticket at the door, a command will be on a line by itself:

BUY TICKET k

where k is a positive integer indicating the number of tickets bought at the door. These guests will be numbered as previously mentioned. You are guaranteed that the total number of tickets bought, including presales, will not exceed 1000.

If a patron makes a bid in the silent auction, a command of the following form will be issued:

BIDITEM k p d

where k represents the item number for which the bid is being placed, p represents the number of the person placing the bid, and d represents the dollar amount the person has bid. This last value is a positive real number to two decimal places while the others are non-negative integers within the appropriate ranges.

The following command closes the auction. Any bids made after this command is executed are ignored.

CLOSEAUCTION

If a guest desires to buy raffle tickets, a command with the following format will be used:

BUY RAFFLE k p

This command lets person p buy exactly k raffle tickets. The raffle tickets are numbered as previously described, so long as the tickets are still available. If they aren't available, the person gets whatever tickets remain.

The last several commands in the file will deal with awarding prizes. These commands will take the following forms.

A query about a raffle item will be of the following form:

AWARD RAFFLE i t

where i is the raffle item being given out and t is the number of the winning ticket of that raffle item. Your program will have to respond with the winner of this item. You will be guaranteed that this query will appear EXACTLY once for each raffle prize and that all queries of this form will appear AFTER the last raffle ticket is sold. Furthermore, you are guaranteed that the raffle ticket number was purchased by an individual and that the raffle prize number is valid. Finally, a single raffle ticket will correspond to at most one raffle prize.

A status query about a silent auction item will be of the following form:

AWARD AUCTION i

where i represents the silent auction item being queried. Your program will have to respond with the winner of this item and the amount they paid for it OR that there were no bids for that item.

The final status query in the file will be the following line:

TOTAL REVENUE

Output Specification

For the input command of the form:

BUY TICKET k

output a single line of the form:

SOLD TICKETS a - b

where a is the starting number of the tickets sold and b is the ending number (inclusive) of the tickets sold. If k is 1, then a and b will be equal. (Note: For the very first command of this type, the value of a will equal the number of presold tickets, since the presale tickets are numbered from 0 to the total number of presale tickets minus 1.)

For the input command of the form:

BIDITEM k p d

output a single line with one of the following forms:

BIDITEM k ACCEPTED for PERSON p at d DOLLARS

BIDITEM k REJECTED for PERSON p at d DOLLARS

The two reasons to reject a bid are if the new bid is not higher than the previous bid OR if the auction has been closed already.

For the CLOSEAUCTION command, simply print a single line with the exact same output:

CLOSEAUCTION

For the input command

BUY RAFFLE k p

output a single line of one of the two following forms:

RAFFLE TICKETS a - b given to PERSON p

NO RAFFLE TICKETS given to PERSON p

where a represents the first raffle ticket number issued and b represents the last raffle ticket number issued to person p. If there are no more raffle tickets left with the command is issued, the latter format is used. Note that the former format may be used if the person asks for a certain number of raffle tickets, but gets fewer since she bought all that were left.

For the input command

AWARD RAFFLE i t

output a single line of the following format:

RAFFLE i WON BY PERSON p

where i is the raffle item in question (in the query) and p is the number of the guest who won the item.

For the input command

AWARD AUCTION i

output a single line of the following format:

AUCTION ITEM i WON BY PERSON p for $d.dd

where i is the number of the auction item, p is the person who won the item and d.dd is the number of dollars he paid for it, to two decimal places. Or, if there are no bids for the item, output a single line of the following format:

NO BIDS FOR AUCTION ITEM %d

For the input command

TOTALREVENUE

output a single line with the following format:

TOTALREVENUE is $d.dd

where d.dd is the total amount gained by the event via ticket sales, auction sales, and raffle ticket sales. (We are assuming that all items were donated so that there was no cost associated with the event.

/*Header Comment
*/

#include <stdio.h>
#include <string.h>

//Constants to be used.
//MAXSIZE is the maximum size of all strings
//MAXAUCTIONITEMS is the maximum number of items in the auction
//MAXRAFFLE is the maximum number of available raffle tickets
#define MAXSIZE 100
#define MAXAUCTIONITEMS 1000
#define MAXRAFFLE 1000

//Function prototypes - do not change these
void initRaffle(int raffles[MAXRAFFLE]);
void initAuction(float auction[2][MAXAUCTIONITEMS]);
void buyTickets(float * totalRevenue, int * ticketsSold, int numTickets, float price);
void buyRaffle(float * totalRevenue, int raffles[MAXRAFFLE], int availTickets, int numTickets, int person);
void bid(float auction[2][MAXAUCTIONITEMS], float bid, int auctionNumber, int person, int flag);
float awardAuction(float auction[2][MAXAUCTIONITEMS], int auctionNumber);
void awardRaffle(int raffles[MAXRAFFLE], int raffleNumber, int winner);

//Main function
int main() {
FILE * ifp;
char filename[MAXSIZE], event[MAXSIZE], item[MAXSIZE];
float presale, dayOf, totalRevenue = 0;
float auctions[2][MAXAUCTIONITEMS];
int raffles[MAXRAFFLE];
int numPresale, numAuctions, numRaffle, numPrizes, numEvents;
int i, ticketsSold = 0, auctionFlag = 1;

printf("Please enter the input file name.\n");
scanf("%s", filename);

ifp = fopen(filename, "r");

fscanf(ifp, "%f%f%d", &presale, &dayOf, &numPresale);

totalRevenue += numPresale * presale;
ticketsSold = numPresale;

fscanf(ifp, "%d", &numAuctions);
fscanf(ifp, "%d%d", &numRaffle, &numPrizes);
fscanf(ifp, "%d", &numEvents);

initRaffle(raffles);
initAuction(auctions);

for (i=0; i<numEvents; i++) {
fscanf(ifp, "%s", event);

if (strcmp(event, "BUY") == 0) {
fscanf(ifp, "%s", item);
if (strcmp(item, "TICKET") == 0) {
int numTickets;
fscanf(ifp, "%d", &numTickets);
buyTickets(&totalRevenue, &ticketsSold, numTickets, dayOf);
}
else if (strcmp(item, "RAFFLE") == 0){
int numTickets, person;
fscanf(ifp, "%d%d", &numTickets, &person);
buyRaffle(&totalRevenue, raffles, numRaffle, numTickets, person);
}
}
else if (strcmp(event, "BIDITEM") == 0) {
int itemNumber, person;
float amount;
fscanf(ifp, "%d%d%f", &itemNumber, &person, &amount);
bid(auctions, amount, itemNumber, person, auctionFlag);
}
else if (strcmp(event, "CLOSEAUCTION") == 0) {
printf("CLOSE AUCTION.\n");
auctionFlag = 0;
}
else if (strcmp(event, "AWARD") == 0) {
fscanf(ifp, "%s", item);
if (strcmp(item, "AUCTION") == 0) {
int auctionNumber;
fscanf(ifp, "%d", &auctionNumber);
totalRevenue += awardAuction(auctions, auctionNumber);
}
else if (strcmp(item, "RAFFLE") == 0){
int raffleNumber, winner;
fscanf(ifp, "%d%d", &raffleNumber, &winner);
awardRaffle(raffles, raffleNumber, winner);
}
}
else {
printf("TOTALREVENUE is $%.2lf.\n", totalRevenue);
}
}

fclose(ifp);
return 0;
}
void initRaffle(int raffles[MAXRAFFLE]) {

}
void initAuction(float auction[2][MAXAUCTIONITEMS]) {

}
void buyTickets(float * totalRevenue, int * ticketsSold, int numTickets, float price) {

}

void buyRaffle(float * totalRevenue, int raffles[MAXRAFFLE], int availTickets, int numTickets, int person) {}// Pre-conditions: auction is an 2D array that holds the current highest bid and the person with

void bid(float auction[2][MAXAUCTIONITEMS], float bid, int auctionNumber, int person, int flag) {

}
float awardAuction(float auction[2][MAXAUCTIONITEMS], int auctionNumber) {}
void awardRaffle(int raffles[MAXRAFFLE], int raffleNumber, int winner) {}

1. CC Car Wash specializes in car cleaning services. The services offered by the company, the exact service time, and the resources needed for each of them are described in the table following:

   Service	Description	Processing Time	Resource
   A. Wash	Exterior car washing and drying	10 minutes	1 automated washing machine
   B. Wax	Exterior car waxing	15 minutes	1 automated waxing machine
   C. Wheel Cleaning	Detailed cleaning of all wheels	16 minutes	1 employee
   D. Interior Cleaning	Detailed cleaning inside the car	20 minutes	1 employee

   The company offers the following packages to their customers:

   • Package 1: Includes only car wash (service A).

   • Package 2: Includes car wash and waxing (services A and B).

   • Package 3: Car wash, waxing, and wheel cleaning (services A, B, and C).

   • Package 4: All four services (A, B, C, and D).

   Customers of CC Car Wash visit the station at a constant rate (you can ignore any effects of variability) of 50 customers per day. Of these customers, 30 percent buy Package 1, 30 percent buy Package 2, 15 percent buy Package 3, and 25 percent buy Package 4. The mix does not change over the course of the day. The store operates 10 hours a day.

   a. Define “minute of work” as the flow unit, what is the capacity rate of the employee at the interior cleaning step per day? Round the answer to the nearest whole number. For example, if your answer is 2543.65, round to 2544; if you answer is 2543.12, round to 2543.

   Your answer is .

   b. What is the implied utilization rate for the employee at service C (wheel cleaning)? Round your answer to the nearest whole number and ignore the percentage sign. For example, if your answer is 0.45 or 45%, fill in 45; if your answer is 0.76 or 76%, fill in 76.

   Your answer is .

   c. What is the implied utilization rate for the automated washing machine? Round your answer to the nearest whole number and ignore the percentage sign. For example, if your answer is 0.45 or 45%, fill in 45; if your answer is 0.76 or 76%, fill in 76.

   Your answer is .

   d. What resource has the highest utilization rate? Input 1 for washing machine, input 2 for waxing machine, input 3 for employee at C, input 4 for employee at D.

   Your answer is .

   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

   For the next summer, CC Car Wash anticipates an increase in the demand to 80 customers per day. Together with this demand increase, there is expected to be a change in the mix of packages demanded: 40 percent of the customers ask for Package 1, 30 percent for Package 2, 20 percent for Package 3, and 10 percent for Package 4. The company will install an additional washing machine to do service A. Answer the following questions based on this new situation.

   e. What is the implied utilization rate for the washing machines? Round your answer to the nearest whole number and ignore the percentage sign. For example, if your answer is 0.45 or 45%, fill in 45; if your answer is 0.76 or 76%, fill in 76.

   Your answer is .

   f. What is the implied utilization rate for the employee at service C (wheel cleaning)? Round your answer to the nearest whole number and ignore the percentage sign. For example, if your answer is 0.45 or 45%, fill in 45; if your answer is 0.76 or 76%, fill in 76.

   Your answer is .

   g. What resource has the highest utilization rate? Input 1 for washing machine, input 2 for waxing machine, input 3 for employee at C, input 4 for employee at D.

   Your answer is .

Problem 1 (3 + 3 + 3 = 9) Suppose you draw two cards from a deck of 52 cards without replacement. 1) What’s the probability that both of the cards are hearts? 2) What’s the probability that exactly one of the cards are hearts? 3) What’s the probability that none of the cards are hearts?

Problem 2 (4) A factory produces 100 unit of a certain product and 5 of them are defective. If 3 units are picked at random then what is the probability that none of them are defective?

Problem 3 (3+4=7) There are 3 bags each containing 100 marbles. Bag 1 has 75 red and 25 blue marbles. Bag 2 has 60 red and 40 blue marbles. Bag 3 has 45 red and 55 blue marbles. Now a bag is chosen at random and a marble is also picked at random. 1) What is the probability that the marble is blue? 2) What happens when the first bag is chosen with probability 0.5 and other bags with equal probability each?

Probem 4 (3+3+4=10) Before each class, I either drink a cup of coffee, a cup of tea, or a cup of water. The probability of coffee is 0.7, the probability of tea is 0.2, and the probability of water is 0.1. If I drink coffee, the probability that the lecture ends early is 0.3. If I drink tea, the probability that the lecture ends early is 0.2. If I drink water, the lecture never ends early. 1) What’s the probability that I drink tea and finish the lecture early? 2) What’s the probability that I finish the lecture early? 3) Given the lecture finishes early, what’s the probability I drank coffee?

Problem 5 (4+4+4=12) We roll two fair 6-sided dice. Each one of the 36 possible outcomes is assumed to be equally likely. 1) Find the probability that doubles were rolled. 2) Given that the roll resulted in a sum of 4 or less, find the conditional probability that doubles were rolled. 3) Given that the two dice land on different numbers, find the conditional probability that at least one die is a 1. Problem 6 (8) For any events A, B, and C, prove the following equality: P(B|A) P(C|A) = P(B|A ∩ C) P(C|A ∩ B)

Assigned Problem:

On New Year's Eve, the probability of a person driving while intoxicated or having a driving accident is 0.38. If the probability of driving while intoxicated is 0.31 and the probability of having a driving accident is 0.11, find the probability of a person having a driving accident while intoxicated.

show work.

Analyzing dice rolls is a common example in understanding probability and statistics. The following calculates the number of times the sum of two dice (randomly rolled) equals six or seven.

import java.util.Scanner;
import java.util.Random;

public class DiceStats {
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
Random randGen = new Random();
int i; // Loop counter iterates numRolls times
int numRolls; // User defined number of rolls
int numSixes; // Tracks number of 6s found
int numSevens; // Tracks number of 7s found
int die1; // Dice values
int die2; // Dice values
int rollTotal; // Sum of dice values

numSixes = 0;
numSevens = 0;

System.out.println("Enter number of rolls: ");
numRolls = scnr.nextInt();

if (numRolls >= 1) {
// Roll dice numRoll times
for (i = 0; i < numRolls; ++i) {
die1 = randGen.nextInt(6) + 1;
die2 = randGen.nextInt(6) + 1;
rollTotal = die1 + die2;

// Count number of sixs and sevens
if (rollTotal == 6) {
numSixes = numSixes + 1;
}
else if (rollTotal == 7) {
numSevens = numSevens + 1;
}
System.out.println("Roll " + (i+1) + " is " +
rollTotal + " (" + die1 +
"+" + die2 + ")");
}

// Print statistics on dice rolls
System.out.println("\nDice roll statistics:");
System.out.println("6s: " + numSixes);
System.out.println("7s: " + numSevens);
}
else {
System.out.println("Invalid rolls. Try again.");
}

return;
}
}

Create different versions of the program that:

1. Calculates the number of times the sum of the randomly rolled dice equals each possible value from 2 to 12.
2. Repeatedly asks the user for the number of times to roll the dice, quitting only when the user-entered number is less than 1. Hint: Use a while loop that will execute as long as numRolls is greater than 1. Be sure to initialize numRolls correctly.
3. Prints a histogram in which the total number of times the dice rolls equals each possible value is displayed by printing a character like * that number of times, as shown below.

Figure 9.17.1: Histogram showing total number of dice rolls for each possible value.

Dice roll histogram:

2:  ******
3:  ****
4:  ***
5:  ********
6:  *******************
7:  *************
8:  *************
9:  **************
10: ***********
11: *****
12: ****