Application Exercise:
A team of researchers recruited a random sample of migraine sufferers. Before the study began at baseline, participants were asked to record the duration of headaches they experienced in a week. A few days later, all participants were asked to practice a week-long relaxation technique designed to reduce migraine headaches. A two-week off period in which the participants practiced nothing was given between the relaxation technique. Throughout the relaxation technique participants were asked to record the duration of headaches. What can be concluded with an α of 0.05?

e) Regardless of the H₀ decision in b), conduct Tukey's post hoc test for the following comparisons:
1 vs. 3: difference =_______________ ; significant: ---Select---Yes OR No
1 vs. 2: difference =_______________ ; significant: ---Select---Yes OR No

f) Regardless of the H₀ decision in b), conduct Scheffe's post hoc test for the following comparisons:
1 vs. 3: test statistic = ______________ ; significant: ---Select---Yes OR No
2 vs. 3: test statistic = ______________ ; significant: ---Select---Yes OR No

1- Use LinkList. Write removeLast(n). Delete the last occurrence of an item from a linked list. So if the item is 7 and the list is [1,3,7,4,7,3,7,2], the result is [1,3,7,4,7,3,2]

2- Use LinkList. Write removeAll(int n). Deletes all occurrences of an item n from a linked list. So if the item is 7 and the list1 is [1,3,7,4,7,3,2] , then list1.removeAll(7) then list1 becomes [1,3,4,3,2].

Demonstrate by displaying the list contents before and after calling the above methods. Eg:

lst1
[1,3,7,4,7,3,7,2]
lst1.removelast(7)
[1,3,7,4,7,3,2]

lst1.removeall(7)
[1,3,4,3,2]

------------------------------------------------------------------------------------------------------------------------------------------------------------------

// linkList.java
// demonstrates linked list
// to run this program: C>java LinkListApp
////////////////////////////////////////////////////////////////
class Link
{
public int iData; // data item
public double dData; // data item
public Link next; // next link in list
// -------------------------------------------------------------
public Link(int id, double dd) // constructor
{
iData = id; // initialize data
dData = dd; // ('next' is automatically
} // set to null)
// -------------------------------------------------------------
public void displayLink() // display ourself
{
System.out.print("{" + iData + ", " + dData + "} ");
}
} // end class Link
////////////////////////////////////////////////////////////////
class LinkList
{
private Link first; // ref to first link on list

// -------------------------------------------------------------
public LinkList() // constructor
{
first = null; // no links on list yet
}
// -------------------------------------------------------------
public boolean isEmpty() // true if list is empty
{
return (first==null);
}
// -------------------------------------------------------------
// insert at start of list
public void insertFirst(int id, double dd)
{ // make new link
Link newLink = new Link(id, dd);
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}
// -------------------------------------------------------------
public Link deleteFirst() // delete first item
{ // (assumes list not empty)
Link temp = first; // save reference to link
first = first.next; // delete it: first-->old next
return temp; // return deleted link
}
// -------------------------------------------------------------
public void displayList()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning of list
while(current != null) // until end of list,
{
current.displayLink(); // print data
current = current.next; // move to next link
}
System.out.println("");
}
// -------------------------------------------------------------
} // end class LinkList
////////////////////////////////////////////////////////////////

class LinkListApp
{
public static void main(String[] args)
{
LinkList theList = new LinkList(); // make new list

theList.insertFirst(22, 2.99); // insert four items
theList.insertFirst(44, 4.99);
theList.insertFirst(66, 6.99);
theList.insertFirst(88, 8.99);

theList.displayList(); // display list

while( !theList.isEmpty() ) // until it's empty,
{
Link aLink = theList.deleteFirst(); // delete link
System.out.print("Deleted "); // display it
aLink.displayLink();
System.out.println("");
}
theList.displayList(); // display list
} // end main()
} // end class LinkListApp

-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Class LinkListAppTest.Java is just for testing. Please do not edit in any form.
class LinkListAppTest
   {
   public static void main(String[] args)                      //  NEW MAIN
      {
      LinkList lst1 = new LinkList();                          //  Since the available add method is a pre-add to the first we go in reverse order
      lst1.insertFirst(8,2);                                   // last digit
      lst1.insertFirst(7,7);                                   // entering next to last
      lst1.insertFirst(6,3);                                   // until we get to the the beginning
      lst1.insertFirst(5,7);
      lst1.insertFirst(4,4);
      lst1.insertFirst(3,7);
      lst1.insertFirst(2,3);
      lst1.insertFirst(1,1);

      System.out.println("lst1");                              //  list the name of the linked-list
      lst1.displayList();                                      //  pre-print the entered list unaltered
      System.out.println("lst1.removeLast(7)");                //  list the action to be taken
      lst1.removeLast(7);                                      //  complete the action to remove the last dData == 7;
      lst1.displayList();                                      //  print list post removal of the last dData == 7;
      System.out.println("1st1.removeAll(7)");                 //  list the action to be taken
      lst1.removeAll(7);                                       //  complete the action to remove all remaining dData == 7;
      lst1.displayList();                                      //  print list post removal of all remaining dData == 7;

      }  // end main()

   }  // end class 

1- Use LinkList. Write removeLast(n). Delete the last occurrence of an item from a linked list. So if the item is 7 and the list is [1,3,7,4,7,3,7,2], the result is [1,3,7,4,7,3,2]

2- Use LinkList. Write removeAll(int n). Deletes all occurrences of an item n from a linked list. So if the item is 7 and the list1 is [1,3,7,4,7,3,2] , then list1.removeAll(7) then list1 becomes [1,3,4,3,2].

Demonstrate by displaying the list contents before and after calling the above methods. Eg:

lst1
[1,3,7,4,7,3,7,2]
lst1.removelast(7)
[1,3,7,4,7,3,2]

lst1.removeall(7)
[1,3,4,3,2]

\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\

// linkList.java
// demonstrates linked list
// to run this program: C>java LinkListApp
////////////////////////////////////////////////////////////////
class Link
{
public int iData; // data item
public double dData; // data item
public Link next; // next link in list
// -------------------------------------------------------------
public Link(int id, double dd) // constructor
{
iData = id; // initialize data
dData = dd; // ('next' is automatically
} // set to null)
// -------------------------------------------------------------
public void displayLink() // display ourself
{
System.out.print("{" + iData + ", " + dData + "} ");
}
} // end class Link
////////////////////////////////////////////////////////////////
class LinkList
{
private Link first; // ref to first link on list

// -------------------------------------------------------------
public LinkList() // constructor
{
first = null; // no links on list yet
}
// -------------------------------------------------------------
public boolean isEmpty() // true if list is empty
{
return (first==null);
}
// -------------------------------------------------------------
// insert at start of list
public void insertFirst(int id, double dd)
{ // make new link
Link newLink = new Link(id, dd);
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}
// -------------------------------------------------------------
public Link deleteFirst() // delete first item
{ // (assumes list not empty)
Link temp = first; // save reference to link
first = first.next; // delete it: first-->old next
return temp; // return deleted link
}
// -------------------------------------------------------------
public void displayList()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning of list
while(current != null) // until end of list,
{
current.displayLink(); // print data
current = current.next; // move to next link
}
System.out.println("");
}
// -------------------------------------------------------------
} // end class LinkList
////////////////////////////////////////////////////////////////

class LinkListApp
{
public static void main(String[] args)
{
LinkList theList = new LinkList(); // make new list

theList.insertFirst(22, 2.99); // insert four items
theList.insertFirst(44, 4.99);
theList.insertFirst(66, 6.99);
theList.insertFirst(88, 8.99);

theList.displayList(); // display list

while( !theList.isEmpty() ) // until it's empty,
{
Link aLink = theList.deleteFirst(); // delete link
System.out.print("Deleted "); // display it
aLink.displayLink();
System.out.println("");
}
theList.displayList(); // display list
} // end main()
} // end class LinkListApp
////////////////////////////////////////////////////////////////\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\

Class LinkListAppTest.Java is just for testing. Please do not edit.
class LinkListAppTest
   {
   public static void main(String[] args)                      //  NEW MAIN
      {
      LinkList lst1 = new LinkList();                          //  Since the available add method is a pre-add to the first we go in reverse order
      lst1.insertFirst(8,2);                                   // last digit
      lst1.insertFirst(7,7);                                   // entering next to last
      lst1.insertFirst(6,3);                                   // until we get to the the beginning
      lst1.insertFirst(5,7);
      lst1.insertFirst(4,4);
      lst1.insertFirst(3,7);
      lst1.insertFirst(2,3);
      lst1.insertFirst(1,1);

      System.out.println("lst1");                              //  list the name of the linked-list
      lst1.displayList();                                      //  pre-print the entered list unaltered
      System.out.println("lst1.removeLast(7)");                //  list the action to be taken
      lst1.removeLast(7);                                      //  complete the action to remove the last dData == 7;
      lst1.displayList();                                      //  print list post removal of the last dData == 7;
      System.out.println("1st1.removeAll(7)");                 //  list the action to be taken
      lst1.removeAll(7);                                       //  complete the action to remove all remaining dData == 7;
      lst1.displayList();                                      //  print list post removal of all remaining dData == 7;

      }  // end main()

   }  // end class 

*Repeated Measures Analysis of Variance*
Examining differences between groups on one or more variables / same participants being tested more than once / with more than two groups.

What test and method would be used to examine the difference between male and female users considering the different variable (Pain Reliever, Sedative, Tranquilizer & Stimulant)

Create a graph illustration.

Describe the Graph.

Consider a small economy composed of six people: Nick, Rosa, Tim, Alyssa, Crystal, and Brian. Each person's employment status is described in the following table.

Based on the criteria used by the Bureau of Labor Statistics (BLS), identify each person’s status as employed, unemployed, “not in the labor force” (if not in the civilian labor force but still part of the adult population), or “not in the adult population” if not in the civilian adult population.

Jiminy’s Cricket Farm issued a bond with 15 years to maturity and a semiannual coupon rate of 5 percent 3 years ago. The bond currently sells for 92 percent of its face value. The company’s tax rate is 22 percent. The book value of the debt issue is $35 million. In addition, the company has a second debt issue on the market, a zero coupon bond with 8 years left to maturity; the book value of this issue is $20 million, and the bonds sell for 65 percent of par.

a. What is the company’s total book value of debt? (Enter your answer in dollars, not millions of dollars, e.g. 1,234,567.)

b. What is the company’s total market value of debt? (Enter your answer in dollars, not millions of dollars, e.g. 1,234,567.)

c. What is your best estimate of the aftertax cost of debt? (Do not round intermediate calculations and enter your answer as a percent rounded to 2 decimal places, e.g., 32.16.)

Sabert manufactures the Mosaïc® line of heavyweight plastic cutlery. Colored a distinctive silver, Mosaïc’s® products allow one to “entertain with more style.” Currently, Sabert offers two “combo” assortments: (1) 32-piece (16 forks, 8 knives, 8 spoons); (2) 80-piece (40 forks, 20 knives, 20 spoons). Sabert sells the 32-piece pack for $2.80 and the 80-piece pack for $5.79. It costs Sabert $0.61 to manufacture the 32-piece pack and $1.17 to manufacture the 80-piece pack. H-E-B, a Texas-based supermarket chain, sells both sizes of the Mosaïc® cutlery. H-E-B estimates that in 2012 they will buy 247,600 units of the 32-piece pack and 198,300 units of the 80-piece pack. However, in response to customer feedback, H-E-B has asked Sabert to consider producing a third combo pack exclusively for H-E-B. The proposed combo would be a 56-piece (24 forks, 16 knives, 16 spoons), selling to H-E-B for $4.05 and costing Sabert $0.87 to manufacture. H-E-B has shared some market analysis information with Sabert (to support their request). Sabert marketing analysts have concluded that if they provide the new combo pack they will sell 202,100 units to H-E-B. But they estimate that only 8% of those unit sales will be new sales. Sixty-two percent of the new product’s sales will come from the 80-piece pack and the remaining 30% will come from the 32-piece pack.

(b)  If the 56-piece combo pack is introduced in 2012, what will be the incremental contribution (IC) to the product line?

Matching

Match the ocular term in Column I with the definition in Column II.

Match the auditory term in Column I with the definition in Column II.

You have a set of building-blocks which contains blocks of heights 1, 3 and 4 centimeters. (Other dimensions irrelevant.) You are constructing towers by piling blocks directly on top of one another. (A tower of height 7 cm could be obtained using seven blocks of height 1; one block of height 3 and one block of height 4; 2 blocks of height 3 and one block of height 1; etc.) Let bn be the number of ways to construct a tower of height n cm using blocks from the set. Assume that there is an unlimited supply of blocks of each size. Find a recurrence relation for bn. (You are not required to solve the recurrence relation.)

I am stuck on this question and don't really know where to start. I've seen examples done but they don't give a final result and I'm not sure how to get there.

Consider two interconnected tanks. Tank 1 initial contains 40 L (liters) of water and 160 g of salt, while tank 2 initially contains 20 L of water and 250 g of salt. Water containing 20 g/L of salt is poured into tank1 at a rate of 2 L/min while the mixture flowing into tank 2 contains a salt concentration of 35 g/L of salt and is flowing at the rate of 2.5 L/min. The two connecting tubes have a flow rate of 4 L/min from tank 1 to tank 2; and of 2 L/min from tank 2 back to tank 1. Tank 2 is drained at the rate of 4.5 L/min. You may assume that the solutions in each tank are thoroughly mixed so that the concentration of the mixture leaving any tank along any of the tubes has the same concentration of salt as the tank as a whole. (This is not completely realistic, but as in real physics, we are going to work with the approximate, rather than exact description. The 'real' equations of physics are often too complicated to even write down precisely, much less solve.) How does the water in each tank change over time?