The Gourmand Cooking School runs short cooking courses at its small campus. Management has identified two cost drivers it uses in its budgeting and performance reports—the number of courses and the total number of students. For example, the school might run two courses in a month and have a total of 63 students enrolled in those two courses. Data concerning the company’s cost formulas appear below:

For example, administrative expenses should be $3,700 per month plus $46 per course plus $7 per student. The company’s sales should average $850 per student.

The company planned to run four courses with a total of 63 students; however, it actually ran four courses with a total of only 59 students. The actual operating results for September appear below:

Required:

1. Prepare the company’s planning budget for September.

Prepare the company’s planning budget for September.

2. Prepare the company’s flexible budget for September.

Prepare the company’s flexible budget for September.

3. Calculate the revenue and spending

Professor Jennings claims that only 35% of the students at Flora College work while attending school. Dean Renata thinks that the professor has underestimated the number of students with part-time or full-time jobs. A random sample of 83students shows that 38 have jobs. Do the data indicate that more than 35% of the students have jobs? Use a 5% level of significance.

What are we testing in this problem?

single mean

single proportion     

(a) What is the level of significance?


State the null and alternate hypotheses.

H₀: p = 0.35; H₁: p > 0.35

H₀: μ = 0.35; H₁:  μ < 0.35     

H₀: p = 0.35; H₁:  p < 0.35

H₀: μ = 0.35; H₁: μ > 0.35

H₀: p = 0.35; H₁:  p ≠ 0.35

H₀: μ = 0.35; H₁:  μ ≠ 0.35

(b) What sampling distribution will you use? What assumptions are you making?

The standard normal, since np > 5 and nq > 5.

The Student's t, since np < 5 and nq < 5.     

The Student's t, since np > 5 and nq > 5.

The standard normal, since np < 5 and nq < 5.

What is the value of the sample test statistic? (Round your answer to two decimal places.)


(c) Find (or estimate) the P-value.

P-value > 0.250

0.125 < P-value < 0.250     

0.050 < P-value < 0.125

0.025 < P-value < 0.050

0.005 < P-value < 0.025

P-value < 0.005

Sketch the sampling distribution and show the area corresponding to the P-value.

(d) Based on your answers in parts (a) to (c), will you reject or fail to reject the null hypothesis? Are the data statistically significant at level α?

At the α = 0.05 level, we reject the null hypothesis and conclude the data are statistically significant.

At the α = 0.05 level, we reject the null hypothesis and conclude the data are not statistically significant.     

At the α = 0.05 level, we fail to reject the null hypothesis and conclude the data are statistically significant.

At the α = 0.05 level, we fail to reject the null hypothesis and conclude the data are not statistically significant.

(e) Interpret your conclusion in the context of the application.

There is sufficient evidence at the 0.05 level to conclude that more than 35% of the students have jobs.

There is insufficient evidence at the 0.05 level to conclude that more than 35% of the students have jobs.

As you might expect, there has been a spirited discussion about which method is most effective in terms of the effectiveness of delivering course content, student and faculty acceptance of different modes of instruction and the cost to the state of using different delivery methods. As a result of this discussion, five questions have arisen that require the use of statistics to answer them. They are:

1. Does student learning as indicated by average grades suffer if they are taught using alternative modes of instruction: traditional in-class teaching, on-line learning, or mixed on-line/in-class method?

2. Do students have a preference for which type of learning to which they are exposed?

3. Is the acceptance of students of on-line methods independent of their majors?

4. Is the proportion of faculty members favoring on-line or mixed delivery the same for all colleges within the university?

5. Does the average amount of additional instructor time required to deliver courses on-line differ according to the type of courses?

1.) Independent samples Of the course grades of students who took classes using traditional in class presentations, students to take classes online and students taught using mixed methods have been collected. The data are shown in the jpeg of the table below. Use this data to conduct the appropriate hypothesis test to determine if there is any difference between the mean scores of the student populations that took different types of classes. Use Tukey-Kramer to determine where the significant differences are.

Please provide a statistical analysis. You are required to submit the following information:

1.) The null and alternative hypotheses being tested.

2.) The Critical test statistic (F or Chi-Square) from the appropriate table. If it required using the Tukey- Kramer method, show the Q score from the table AND the critical value that you used to make your decisions. Also, specify which mean or means are not equal.

3.) The calculated value that you arrived at and the p-Value.

4.) Your decision, reject or do not reject.

5.) A separate part of the answer must be a memo sheet written in word that answers each of the 5 questions and explains why you answered as you did using the results of your statistical testing.

Blue Bayou Middle School wants to raise money for a new sound system for its auditorium. The primary fund-raising event is a dance at which the famous disc jockey Kray Zee will play classic and not-so-classic dance tunes. Grant Hill, the music and theater instructor, has been given the responsibility for coordinating the fund-raising efforts. This is Grant’s first experience with fund-raising. He decides to put the eighth-grade choir in charge of the event; he will be a relatively passive observer.

Grant had 500 unnumbered tickets printed for the dance. He left the tickets in a box on his desk and told the choir students to take as many tickets as they thought they could sell for $5 each. In order to ensure that no extra tickets would be floating around, he told them to dispose of any unsold tickets. When the students received payment for the tickets, they were to bring the cash back to Grant, and he would put it in a locked box in his desk drawer.

Some of the students were responsible for decorating the gymnasium for the dance. Grant gave each of them a key to the money box and told them that if they took money out to purchase materials, they should put a note in the box saying how much they took and what it was used for. After 2 weeks, the money box appeared to be getting full, so Grant asked Lynn Dandi to count the money, prepare a deposit slip, and deposit the money in a bank account that Grant had opened.

The day of the dance, Grant wrote a check from the account to pay Kray Zee. The DJ said, however, that he accepted only cash and did not give receipts. So Grant took $200 out of the cash box and gave it to Kray. At the dance, Grant had Dana Uhler working at the entrance to the gymnasium, collecting tickets from students and selling tickets to those who had not pre-purchased them. Grant estimated that 400 students attended the dance.

The following day, Grant closed out the bank account, which had $250 in it, and gave that amount plus the $180 in the cash box to Principal Sanchez. Principal Sanchez seemed surprised that, after generating roughly $2,000 in sales, the dance netted only $430 in cash. Grant did not know how to respond.

Identify as many internal control weaknesses as you can in this scenario, and suggest how each could be addressed.

Blue Bayou Middle School wants to raise money for a new sound system for its auditorium. The primary fund-raising event is a dance at which the famous disc jockey Kray Zee will play classic and not-so-classic dance tunes. Grant Hill, the music and theater instructor, has been given the responsibility for coordinating the fund-raising efforts. This is Grant’s first experience with fund-raising. He decides to put the eighth-grade choir in charge of the event; he will be a relatively passive observer. Grant had 500 unnumbered tickets printed for the dance. He left the tickets in a box on his desk and told the choir students to take as many tickets as they thought they could sell for $5 each. In order to ensure that no extra tickets would be floating around, he told them to dispose of any unsold tickets. When the students received payment for the tickets, they were to bring the cash back to Grant, and he would put it in a locked box in his desk drawer. Some of the students were responsible for decorating the gymnasium for the dance. Grant gave each of them a key to the money box and told them that if they took money out to purchase materials, they should put a note in the box saying how much they took and what it was used for. After 2 weeks, the money box appeared to be getting full, so Grant asked Lynn Dandi to count the money, prepare a deposit slip, and deposit the money in a bank account that Grant had opened. The day of the dance, Grant wrote a check from the account to pay Kray Zee. The DJ said, however, that he accepted only cash and did not give receipts. So Grant took $200 out of the cash box and gave it to Kray. At the dance, Grant had Dana Uhler working at the entrance to the gymnasium, collecting tickets from students and selling tickets to those who had not pre-purchased them. Grant estimated that 400 students attended the dance. The following day, Grant closed out the bank account, which had $250 in it, and gave that amount plus the $180 in the cash box to Principal Sanchez. Principal Sanchez seemed surprised that, after generating roughly $2,000 in sales, the dance netted only $430 in cash. Grant did not know how to respond. Identify as many internal control weaknesses as you can in this scenario, and suggest how each could be addressed.

8.

All the real zeros of the given polynomial are integers. Find the zeros. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = x³ + 6x² − 32

x =

Write the polynomial in factored form.
P(x) =

9.

Find all rational zeros of the polynomial. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = 4x⁴ − 45x² + 81

x =

Write the polynomial in factored form.
P(x) =

10.

All the real zeros of the given polynomial are integers. Find the zeros. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = x³ − 19x − 30

x =

Write the polynomial in factored form.
P(x) =

11.

All the real zeros of the given polynomial are integers. Find the zeros. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = x³ − 9x² + 27x − 27

x =

Write the polynomial in factored form.
P(x) =

12.

Find all rational zeros of the polynomial. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = 9x³ + 9x² − x − 1

Write the polynomial in factored form.

13.

Find all the real zeros of the polynomial. Use the quadratic formula if necessary, as in Example 3(a). (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = 4x³ + 6x² − 7x − 9

x =

14.

Find all rational zeros of the polynomial. (Enter your answers as a comma-separated list. Enter all answers including repetitions.)

P(x) = 9x³ − 13x + 4

Write the polynomial in factored form.

Write all your answers for this problem in a text file named aa.txt – for each problem write the problem number and your answer.

1.1 What type of object can be contained in a list (write the letter for the best answer)?

a. String b. Integer c. List d. String and Integer only e. String, Integer, and List can all be contained in a list

1.2 Which statement about the debugger is not correct? a. It is a powerful tool in PyCharm and it can help trace the execution of a program. b. You can set breakpoints in the code to indicate where the computer should pause execution. c. The debugger can step through the program execution, but you cannot see the value of a variable without using a print statement. d. The PyCharm debugger highlights the line it will execute next.

1.3 Binary search takes a smaller number of comparisons to run compared to linear search. However, binary search cannot always be used. What is required for binary search to work?

1.4 Write TRUE or FALSE regarding the following statement: “The Merge Sort algorithm we studied in Chapter 5 was implemented with recursion”

1.5 Suppose a list is defined with the following assignment statement: numbers = [1, 2, 3, 4, 5, 6, 7] If we use the binary search algorithm we studied, how many comparisons (i.e. iterations of the while loop) will it take to find the number 5?

1.6 Suppose a list is defined with the following assignment statement: numbers = [33, 22, 55, 11, 44] Explain in 2-4 sentences in your own words how the Merge Sort (msort) function will sort the above list. Be sure to explain how it will merge and sort the groups for each step.

about python

PYTHON......

Working with lists, functions, and files Objective: Work with lists Work with lists in functions Work with files Assignment:

Part 1: Write a program to create a text file which contains a sequence of test scores. Ask for scores until the user enters an empty value. This will require you to have the scores until the user enters -1.

After the scores have been entered, ask the user to enter a file name. If the user doesn’t not enter a file name exit the program. If the user does enter a file name, write out the scores to the specified file. Then ask the user if they wish to create another data file. Continue on with this process until the user indicated they do not wish to create another data file or they do not enter a file name.

Part 2: Write a program that will ask the user for a data file. Use one of the data files created from part 1. Each line of the file must contain a single value. Fill a list with the values from the file.

Once the list has been filled with values, the program should display, with appropriate labels, the largest value from the list, the smallest value from the list, and the average of the list (with 2 places after the decimal point). Then ask the user for a lower limit and an upper limit. Display all the values from the list that fall within that range.

The code to find the largest, smallest, and average must be done in value-returning functions. Do not use any built-in functions to find these values, write loops to implement these functions. The code to print out a range of scores must be done a function. The arguments for that function MUST be a list, a lower limit and an upper limit. The “matching values” function can print out values. For the rest of the program, only the main function will ask questions or print output.

Implement a priority queue using a DoublyLinkedList where the node with the highest priority (key) is the right-most node.
The remove (de-queue) operation returns the node with the highest priority (key).
If displayForward() displays List (first-->last) : 10 30 40 55
remove() would return the node with key 55.
Demonstrate by inserting keys at random, displayForward(), call remove then displayForward() again.

You will then attach a modified DoublyLinkedList.java (to contain the new priorityInsert(long key) and priorityRemove() methods).

Use the provided PQDoublyLinkedTest.java to test your code.

I cant get PQDoublyLinkedTest to work with my code. I already got the rest of code working. Please comment if you want me to add the rest of the code.

PLEASE DO NOT MODIFY PQDoublyLinkedTest!!! its just for testing the code.

public class PQDoublyLinkedTest
{
public static void main(String[] args)
{ // make a new list
DoublyLinkedList theList = new DoublyLinkedList();

theList.priorityInsert(22); // insert at front
theList.priorityInsert(44);
theList.priorityInsert(66);

theList.priorityInsert(11); // insert at rear
theList.priorityInsert(33);
theList.priorityInsert(55);
  
theList.priorityInsert(10);
theList.priorityInsert(70);
theList.priorityInsert(30);

theList.displayForward(); // display list forward
Link2 removed = theList.priorityRemove();
System.out.print("priorityRemove() returned node with key: ");
removed.displayLink2();
  
} // end main()
} // end class PQDoublyLinkedTest

public class DoublyLinkedList
{
private Link first; // ref to first item
private Link last; // ref to last item
public DoublyLinkedList() // constructor
{
first = null; // no items on list yet
last = null;
}

public boolean isEmpty() // true if no links
{
return first == null;
}

public void insertFirst(long dd) // insert at front of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
last = newLink; // newLink <-- last
else
first.previous = newLink; // newLink <-- old first
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}

public void insertLast(long dd) // insert at end of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
first = newLink; // first --> newLink
else {
last.next = newLink; // old last --> newLink
newLink.previous = last; // old last <-- newLink
}
last = newLink; // newLink <-- last
}

public Link deleteFirst() // delete first link
{ // (assumes non-empty list)
Link temp = first;
if (first.next == null) // if only one item
last = null; // null <-- last
else
first.next.previous = null; // null <-- old next
first = first.next; // first --> old next
return temp;
}

public Link deleteLast() // delete last link
{ // (assumes non-empty list)
Link temp = last;
if (first.next == null) // if only one item
first = null; // first --> null
else
last.previous.next = null; // old previous --> null
last = last.previous; // old previous <-- last
return temp;
}
// insert dd just after key

public boolean insertAfter(long key, long dd)
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)

return false; // didn't find it
}
Link newLink = new Link(dd); // make new link

if (current == last) // if last link,
{
newLink.next = null; // newLink --> null
last = newLink; // newLink <-- last
} else // not last link,

{
newLink.next = current.next; // newLink --> old next
// newLink <-- old next
current.next.previous = newLink;
}
newLink.previous = current; // old current <-- newLink
current.next = newLink; // old current --> newLink
return true; // found it, did insertion

}

public Link deleteKey(long key) // delete item w/ given key
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)
return null; // didn't find it
}

if (current == first) // found it; first item?
first = current.next; // first --> old next
else
// not first
// old previous --> old next
current.previous.next = current.next;

if (current == last) // last item?
last = current.previous; // old previous <-- last
else
// not last
// old previous <-- old next
current.next.previous = current.previous;
return current; // return value
}

public void displayForward()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning
while (current != null) // until end of list,
{
current.displayLink(); // display data
current = current.next; // move to next link
}
System.out.println("");
}

public void displayBackward()
{
System.out.print("List (last-->first): ");
Link current = last; // start at end
while (current != null) // until start of list,
{
current.displayLink(); // display data
current = current.previous; // move to previous link
}
System.out.println("");
}

public void insertSorted(long key)
{
// if list is empty or key is less than current first, inserting at
// first
if (isEmpty() || key < first.dData) {
insertFirst(key);
return; // exiting method
}
// taking a reference to first
Link current = first;
// looping as long as current.next is not null
while (current.next != null) {
// checking if key can be added between current and current.next
if (key >= current.dData && key <= current.next.dData) {
// adding between current and current.next and updating all
// links
Link lnk = new Link(key);
lnk.next = current.next;
current.next.previous = lnk;
current.next = lnk;
lnk.previous = current;
return; //exiting
}
//otherwise, advancing to next link
current = current.next;
}
//if the element is still not inserted, adding to the end
insertLast(key);
}
} // end class DoublyLinkedList

class Link
{
public long dData; // data item
public Link next; // next link in list
public Link previous; // previous link in list
public Link(long d) // constructor
{
dData = d;
}

public void displayLink() // display this link
{
System.out.print(dData + " ");
}
} // end class Link