A lightbulb manufacturer wants to estimate the total number of defective bulbs contained in all of the boxes shipped by the company during the past week. Production personnel at this company have recorded the number of defective bulbs found in each of 50 randomly selected boxes shipped during the past week. These data are provided in the file P08_12.xlsx. Calculate a 95% confidence interval for the total number of defective bulbs contained in the 1000 boxes shipped by this company during the past week. (Round your answers to a whole number.)

When someone falls from a tall building, the most effective way to save him is to provide a net at the bottom so that the person slows down himself conveniently without hurting himself, the impulse here is same that would have been without the net but the net provides extra time for the change in momentum. Another example is, in the game of cricket when the ball is hit by the bat the time to change the momentum is expected to be the least by the batsman to get an excellent shot.

Support your claim using equations and provide two scenarios with numbers and calculations.

Round to two decimal places at each calculation. Find the Taxable income for federal income tax withholding = $ Taxable income for social security tax = $ Taxable income for Medicare tax for a,b,c for this question.

1a. An employee works 42 hours (42-40 were overtime hours) during a workweek in December of 2016. He earns $40.50/hour, with his employer paying 1.5 times the regular rate of pay for overtime hours. To date, he has earned $117,900 during the year. He has requested that his employer withhold 7% of gross pay, which is to be contributed to a 403(b) plan.

1b. An employee works 37 regular hours during a workweek in August of 2016. The employee earns a salary of $126,500/year and is exempt from the overtime provisions of the FLSA. To date, he has received no compensation beyond his annual salary. He has requested that his employer withhold 8% of gross pay, which is to be contributed to a 401(k) plan.

1c. An employee works 50 hours (50-40 were overtime hours) during a workweek in December of 2016. He earns $9,500/month, with his employer paying 1.5 times the regular rate of pay for overtime hours. To date, he has earned $109,700 during the year. He has requested that his employer withhold 13% of gross pay to contribute to a403(b)plan.

Text book: Essentials of Biostatistics in Public Health 3 ed. by Lisa Sullivan.

Instructor provided problem: An observational study is conducted to compare experiences of men and women between the ages of 50-59 years following coronary artery bypass surgery. Participants undergo the surgery and are followed until the time of death, until they are lost to follow-up or up to 30 years, whichever comes first. The following table details the experiences of participating men and women. The data below are years of death or years of last contact for men and women. Estimate the Estimate the survival functions for each treatment group using the Kaplan-Meier approach. Test if there is a significant difference in survival between treatment groups using the log rank test and a 5% level of significance.

Consider a small economy composed of six people: Felix, Janet, Larry, Megan, Susan, and Raphael. 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.

What is the formula for the labor force participation rate?

According to this formula, what is the labor force participation rate of this economy of six people?

33.33%

40%

50%

60%

What is the formula for the unemployment rate?

According to this formula, what is the unemployment rate of this economy of six people?

33.33%

40%

50%

60%

PostgreSQL

1. Write a query to join two tables employees and departments to display the department name, first_name and last_name, hire date, and salary for all managers who have more than 15 years of experience.

2. Write a query to join the employees and departments table to find the name of the employee including the name and last name, department ID and department name.

3. Write a SQL query to join three tables of employees, departments, and locations to find the names, including first and last name, job title, department name and ID, of employees working in London.

4. Write a query to concatenate the two tables of employees and yourself to find the employee id, last_name as Employee, and their manager_id and last name as Manager.

5. Write a query to connect to the employee table and to yourself to find the name, including first_name and last_name, and the hiring date for those employees who were hired after employee Jones.

6. Write a query to combine the two employee and department tables to get the department name and the number of employees working in each department.

7. Write a query to find employee ID, title and number of days he worked, who worked in department with ID 90.

8. Write a query to combine the two employee and department tables to display the department ID, department name, and manager name.

This data contains information on 78 seventh-grade students. We want to know how well each of IQ score and self-concept score predicts GPA using least-squares regression. We also want to know which of these explanatory variables predicts GPA better. Give numerical measures that answer these questions. (Round your answers to three decimal places.)
A. (Regressor: IQ) R ²
  

B. (Regressor: Self-Concept) R ²
  

obs     gpa     iq      gender  concept
1       7.94    118     2       38
2       8.292   136     2       62
3       4.643   88      2       26
4       7.47    111     2       58
5       8.882   106     1       60
6       7.585   97      2       54
7       7.65    120     2       56
8       2.412   76      2       23
9       6       113     1       51
10      8.833   101     2       68
11      7.47    119     1       54
12      5.528   118     1       64
13      7.167   100     2       71
14      7.571   100     1       53
15      4.7     112     1       34
16      8.167   122     1       40
17      7.822   113     1       58
18      7.598   101     1       58
19      4       101     2       35
20      6.231   98      1       50
21      7.643   100     2       50
22      1.76    85      2       46
24      6.419   110     1       56
26      9.648   111     2       79
27      10.7    97      1       65
28      10.58   114     2       71
29      9.429   117     2       56
30      8       123     2       84
31      9.585   116     2       72
32      9.571   128     1       57
33      8.998   139     1       39
34      8.333   115     1       74
35      8.175   106     2       72
36      8       114     2       57
37      9.333   88      1       56
38      9.5     115     2       84
39      9.167   125     2       51
40      10.14   131     1       64
41      9.999   117     1       67
43      10.76   131     2       83
44      9.763   108     2       57
45      9.41    130     2       69
46      9.167   124     2       66
47      9.348   118     2       51
48      8.167   110     2       56
50      3.647   104     2       52
51      3.408   80      1       41
52      3.936   92      2       54
53      7.167   110     2       40
54      7.647   113     2       46
55      .53     80      2       33
56      6.173   111     2       71
57      7.295   122     2       72
58      7.295   104     1       61
59      8.938   125     1       70
60      7.882   142     1       62
61      8.353   106     2       54
62      5.062   92      2       51
63      8.175   120     2       54
64      8.235   118     2       59
65      7.588   96      2       57
68      7.647   116     2       50
69      5.237   106     1       50
71      7.825   110     2       58
72      7.333   116     1       68
74      9.167   108     2       70
76      7.996   99      2       49
77      8.714   99      1       87
78      7.833   111     1       40
79      4.885   107     2       57
80      7.998   116     1       76
83      3.82    99      2       43
84      5.936   107     1       46
85      9       132     1       54
86      9.5     116     1       53
87      6.057   111     2       31
88      6.057   91      1       46
89      6.938   103     2       36

An experiment was designed to estimate the mean difference in weight gain for pigs fed ration A as compared with those fed ration B. Eight pairs of pigs were used. The pigs within each pair were litter-mates. The rations were assigned at random to the two animals within each pair. The gains (in pounds) after 45 days are shown in the following table. Assuming weight gain is normal, find the 98% confidence interval estimate for the mean of the differences μd, where d = ration A - ration B. (Give your answers correct to two decimal places.)

Litter 1 2 3 4 5 6 7 8

Ration A 40 51 46 42 55 59 59 56

Ration B 30 47 45 40 46 56 54 48

Lower Limit:

Upper Limit:

A statistics professor gave a 5-point quiz to the 50 students in his class. Scores on the quiz could range from 0 to 5: The following frequency table resulted: (1.5 points)

1. Compute the values that define the following percentiles:

a. 25^th   2     b. 50^th   3     c. 55^th   3    d. 75^th   4e. 80^th   4     f. 99^th    5    

2. What is the interquartile range of the data in #1?

3. Compute the exact percentile ranks that correspond to the following scores:

a. 2        b. 3        c. 4        d. 1   

I have added the MyList.java all the way on the bottom.

Thats all the detail I have for this and what kind of more detail information you need.

Plz Write the program in Java. And Plz post the running program with main and test.Thanks.

Implementing Lists:

Start by carefully reading Listing 24.5: MyLinkedList.java (on page 938 of the 11^th Edition of the text). Note that the listing is incomplete. Your assignment is to implement a revised MyLinkedList class after you have included all the code needed to fill in and complete all the methods that were omitted. Next, write a (main) driver program that initializes a linked list with 10 names (your choice), and then completely tests every one of its methods of ensure that the class meets all its requirements.

Listing 24.5

MyLinkedList.java
1 public class MyLinkedList implements MyList {
2 private Node head, tail;
3 private int size = 0; // Number of elements in the list
4
5 /** Create an empty list */
6 public MyLinkedList() {
7 }
8
9 /** Create a list from an array of objects */
10 public MyLinkedList(E[] objects) {
11 for (int i = 0; i < objects.length; i++)
12 add(objects[i]);
13 }
14
15 /** Return the head element in the list */
16 public E getFirst() {
17 if (size == 0) {
18 return null;
19 }
20 else {
21 return head.element;
22 }
23 }
24
25 /** Return the last element in the list */
26 public E getLast() {
27 if (size == 0) {
28 return null;
29 }
30 else {
31 return tail.element;
32 }
33 }
34
35 /** Add an element to the beginning of the list */
36 public void addFirst(E e) {
37 // Implemented in Section 24.4.3.1, so omitted here
38 }
39
40 /** Add an element to the end of the list */
41 public void addLast(E e) {
42 // Implemented in Section 24.4.3.2, so omitted here
43 }
44
45 @Override /** Add a new element at the specified index
46 * in this list. The index of the head element is 0 */
47 public void add(int index, E e) {
48 // Implemented in Section 24.4.3.3, so omitted here
49 }
50
51 /** Remove the head node and
52 * return the object that is contained in the removed node. */
53 public E removeFirst() {
54 // Implemented in Section 24.4.3.4, so omitted here
55 }
56
57 /** Remove the last node and
58 * return the object that is contained in the removed node. */
59 public E removeLast() {
60 // Implemented in Section 24.4.3.5, so omitted here
61 }
62
63 @Override /** Remove the element at the specified position in this
64 * list. Return the element that was removed from the list. */
65 public E remove(int index) {
66 // Implemented earlier in Section 24.4.3.6, so omitted
67 }
68
69 @Override /** Override toString() to return elements in the list */
70 public String toString() {
71 StringBuilder result = new StringBuilder("[");
72
73 Node current = head;
74 for (int i = 0; i < size; i++) {
75 result.append(current.element);
76 current = current.next;
77 if (current != null) {
78 result.append(", "); // Separate two elements with a comma
79 }
80 else {
81 result.append("]"); // Insert the closing ] in the string
82 }
83 }
84
85 return result.toString();
86 }
87
88 @Override /** Clear the list */
89 public void clear() {
90 size = 0;
91 head = tail = null;
92 }
93
94 @Override /** Return true if this list contains the element e */
95 public boolean contains(Object e) {
96 // Left as an exercise
97 return true;
98 }
99
100 @Override /** Return the element at the specified index */
101 public E get(int index) {
102 // Left as an exercise
103 return null;
104 }
105
106 @Override /** Return the index of the head matching element in
107 * this list. Return −1 if no match. */
108 public int indexOf(Object e) {
109 // Left as an exercise
110 return 0;
111 }
112
113 @Override /** Return the index of the last matching element in
114 * this list. Return −1 if no match. */
115 public int lastIndexOf(E e) {
116 // Left as an exercise
117 return 0;
118 }
119
120 @Override /** Replace the element at the specified position
121 * in this list with the specified element. */
122 public E set(int index, E e) {
123 // Left as an exercise
124 return null;
125 }
126
127 @Override /** Override iterator() defined in Iterable */
128 public java.util.Iterator iterator() {
129 return new LinkedListIterator();
130 }
131
132 private class LinkedListIterator
133 implements java.util.Iterator {
134 private Node current = head; // Current index
135
136 @Override
137 public boolean hasNext() {
138 return (current != null);
139 }
140
141 @Override
142 public E next() {
143 E e = current.element;
144 current = current.next;
145 return e;
146 }
147
148 @Override
149 public void remove() {
150 // Left as an exercise
151 }
152 }
153
154 private static class Node {
155 E element;
156 Node next;
157
158 public Node(E element) {
159 this.element = element;
160 }
161 }
162 }

MyList.java
public interface MyList extends java.lang.Iterable  {
    //Add a new element at the end of this list
    public void add(E e);

    //Add a new element at the specified index in this list
    public void add(int index, E e);

    //Clear the list
    public void clear();

    //Return true if this list contains the element
    public boolean contains(E e);

    //Return the element from this list at the specified index
    public E get(int index);

    //Return the index of the first matching element in this list.
    //Return -1 if no match.
    public int indexOf(E e);

    /** Return true if this list contains no elements */
    public boolean isEmpty();

    /** Return the index of the last matching element in this list
     * Return -1 if no match. */
    public int lastIndexOf(E e);

    /** Remove the first occurrence of the element o from this list.
     * Shift any subsequent elements to the left.
     * Return true if the element is removed.
     */
    public boolean remove(E e);

    /** Remove the element at the specified position in this list
     * Shift any subsequent elements to the left.
     * Return the element that was removed from the list.
     */
    public E remove(int index);

    /** Replace the element at the specified position in this list
     * with the specified element and returns the new set.
     * */
    public Object set(int index, E e);

    /** Return the number of elements in this list */
    public int size();
}