PYTHON (BEGINNER) program that allows the user to choose any of the three sports options described below and computes the relevant statistic in each case: Quidditch Score Total: Determined based on the number of goals and whether or not the snitch was caught. A goal is scored by propelling the quaffle through a hoop and each earns the team 10 points. If a team catches the snitch, that team earns an additional 30 points. The snitch can be caught at most once. More details on Quidditch available from the International Quidditch Association. (Simplified) Quarterback Rating: Defined as 100 * [5(completions/attempts – 0.3) + 0.25(passing_yards/attempts-3) + 20(touchdown_passes/attempts) + 2.375 – (25 * interceptions/attempts)]/6, where attempts is the number of passing attempts made, completions is the number of completed passing attempts, touchdown_passes is the number of passes for a touchdown, and interceptions is the number of times the ball was intercepted. A perfect passer rating in the NFL is considered to be a 158.3. In addition to the rating, tell the user whether or not the quarterback is a perfect passer. Gymnast Score: Begins with six scores, one for difficulty and five for execution, each between 0 and 10. Of the execution scores, the highest and lowest are dropped. The final score is given by the sum of the difficulty score and the average of the three remaining execution scores. Input Validation: Check if you are going to divide by zero when relevant, and do not do the calculation if that is the case. Before typecasting user inputs to an int, check that it is only digits, and don’t typecast or do the calculation otherwise. (For this assignment, do not worry about checking if floats are valid.) In any case where an error is detected, output an error message. Do not continue the calculation. You may additionally output a result of zero in such a case.
In: Computer Science
Audubon Advisors is a volunteer student organization that uses business skills they’ve learned in their MBA program to advise local charity groups about business decisions. One charity group is planning to make and sell cutting boards at a major cooking show. The boards cost $6 each to make and will sell for $20 each. The boards will be made by volunteers at the show and all materials not used can be returned. That is, the group will make only the number of boards it can actually sell. The cooking show allows three options for groups selling at the show:
A. Pay a fixed booth fee of $5,600
B. Pay a fee of $3,800 plus 10% of all revenue from the boards sold at the show
C. Pay 25% of all revenues from boards sold at the show.
1. Compute the CM per board under each of the three options.
2. Compute the breakeven point in number of boards for each of the three options.
3. Which payment plan has the lowest risk of loss for the charity group? Why?
4. Which payment plan has the highest profit potential assuming that there is very high demand for the boards? Why?
In: Accounting
Sequential Method
Eilers Company has two producing departments and two support departments. The following budgeted data pertain to these four departments:
Support Departments |
Producing Departments | |||
| General Factory |
Receiving | Assembly | Finishing | |
| Direct overhead | $400,000 | $150,000 | $45,000 | $75,000 |
| Square footage | — | 2,700 | 5,400 | 5,400 |
| Number of receiving orders | 300 | — | 1,680 | 1,020 |
| Direct labor hours | — | — | 25,000 | 40,000 |
The support departments are ranked in order of highest cost to lowest cost.
Required:
1. Allocate the costs of the support departments using the sequential method. (Use the rounded values for subsequent calculations. Round allocation ratios to four significant digits. Round allocated costs to the nearest dollar. If an amount is zero, enter "0".)
Allocation ratios:
| General Factory | Receiving | Assembly | Finishing | |
| Square footage | ||||
| Number of receiving orders |
Allocations:
| General Factory | Receiving | Assembly | Finishing | |
| Direct overhead cost | ||||
| Allocate: | ||||
| General Factory | ||||
| Receiving | ||||
| Total | ||||
2. Using direct labor hours, compute departmental overhead rates. (Round to the nearest cent.)
| Overhead Rate | |
| Assembly | _____ per direct labor hour |
| Finishing | ______ per direct labor hour |
In: Accounting
Sequential Method
Eilers Company has two producing departments and two support departments. The following budgeted data pertain to these four departments:
Support Departments |
Producing Departments | |||
| General Factory |
Receiving | Assembly | Finishing | |
| Direct overhead | $400,000 | $160,000 | $43,000 | $74,000 |
| Square footage | — | 2,700 | 5,400 | 5,400 |
| Number of receiving orders | 300 | — | 1,680 | 1,020 |
| Direct labor hours | — | — | 25,000 | 40,000 |
The support departments are ranked in order of highest cost to lowest cost.
Required:
1. Allocate the costs of the support departments using the sequential method. (Use the rounded values for subsequent calculations. Round allocation ratios to four significant digits. Round allocated costs to the nearest dollar. If an amount is zero, enter "0".)
Allocation ratios:
| Receiving | Assembly | Finishing | |
| Square footage | |||
| Number of receiving orders |
Allocations:
| General Factory | Receiving | Assembly | Finishing | |
| Direct overhead cost | $ | $ | $ | $ |
| Allocate: | ||||
| General Factory | ||||
| Receiving | ||||
| Total | $ | $ | $ | $ |
2. Using direct labor hours, compute departmental overhead rates. (Round to the nearest cent.)
| Overhead Rate | |
| Assembly | per direct labor hour |
| Finishing | per direct labor hour |
In: Accounting
6 C++ Questions:
19. Assuming an int is size 4 bytes, what is the size in memory of the below array:
int cards[10] = {7, 4, 7, 5, 7};
20. In the array from question 19, what is the value of the below elements:
cards[1]; cards[8];
Assume you have an array with 128 integers which is sorted from
lowest to highest.
21a. You are searching for a value which is contained in the array
using the binary search algorithm. What is the
minimum number of comparisons it will take?
21b. You are searching for a value which is contained in the array
using the linear search algorithm. What is the
maximum number of comparisons it will take?
22. True/False: in order to use the linear search algorithm on an array, the array must be sorted
23. True/False: a bubble sort on an integer array is guaranteed to do at least one swap.
24. Write a function which takes an array of ints and size of array as parameters, and returns the maximum value in the array. You do not need to demonstrate calling this function from main(). It must have the following signature:
int findMax(const int array[], int size);
In: Computer Science
|
Myrtle Air Express decided to offer direct service from Cleveland to Myrtle Beach. Management must decide between a full-price service using the company's new fleet of jet aircraft and a discount service using smaller-capacity commuter planes. It is clear that the best choice depends on the market reaction to the service Myrtle Air offers. Management developed estimates of the contribution to profit for each type of service based upon two possible levels of demand for service to Myrtle Beach: strong and weak. The following table shows the estimated quarterly profits (in thousands of dollars):
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
In: Statistics and Probability
Suppose you have a pair of tetrahedra. One is red on one face, yellow on two faces, and green on one face. The other is white and has faces marked 1, 2, 3 ,4
a. Complete the table
| 1 | 2 | 3 | 4 | |
| Red | ||||
| Yellow | ||||
| Yellow | ||||
| Green |
b. If both tetrahedra are tossed, what is the probability of a red (facing down) and a 3 (facing down)? Of a yellow (facing down) and a number >1 on the other (facing down?) Of a green (facing down) and a number >4 (facing down) on the other? Of a yellow (facing down) on the colored one and a sum of >2 of faces showing on the other?
In: Statistics and Probability
At a certain intersection, of all cars traveling north, the relative frequency of cars continuing in the same direction is p. The relative frequency of those turning east is q; all others turn west.
Assume that drivers behave independently of one another. A small
group of n cars enters the intersection. For this group
(a) What is the marginal distribution of Y, the number of cars
turning west? Find the conditional distribution of X, the number of
cars turning east, given that Y equals y. Hint: what is the
probability that any car not turning west will turn east?
(b) Find the joint distribution of X and Y. Be careful with the
limits of validity.
In: Statistics and Probability
Do you tailgate the car in front of you? About 45% of all drivers will tailgate before passing, thinking they can make the car in front of them go faster. Suppose that you are driving a considerable distance on a two-lane highway and are passed by 8 vehicles. (a) Let r be the number of vehicles that tailgate before passing. Make a histogram showing the probability distribution of r for r = 0 through r = 8.
(b) Compute the expected number of vehicles out of 12 that will
tailgate. (Round your answer to two decimal places.)
(c) Compute the standard deviation of this distribution. (Round
your answer to two decimal places.)
In: Statistics and Probability
Salaries for teachers in a particular elementary school district are normally distributed with a mean of $41,000 and a standard deviation of $6,100. We randomly survey ten teachers from that district.
A. Give the distribution of ΣX. (Round your answers to two decimal places.)
ΣX - N ( , )
B. Find the probability that the teachers earn a total of over $400,000. (Round your answer to four decimal places.)
C. Find the 80th percentile for an individual teacher's salary. (Round your answer to the nearest whole number.)
D. Find the 80th percentile for the sum of ten teachers' salary. (Round your answer to the nearest whole number.)
In: Statistics and Probability