Twenty-seven high-school seniors decided to take part in an investigation of the special “exam preparation” books that purportedly help one get ready for college entrance examinations. The group divided itself into three groups on a purely random basis. Two of the groups used the books, each group selecting a different book. The third group did not use the books. Listed below are the obtained entrance exam scores. Perform the ANOVA using the 5% level of significance and interpret your results.
BOOK I: 532 455 440 620 560 522 517 520 510
BOOK II: 540 570 520 620 660 605 602 590
NO BOOK: 380 470 441 487 420 390 450 510 430 560
In: Statistics and Probability
Twenty-seven high-school seniors decided to take part in an investigation of the special “exam preparation” books that purportedly help one get ready for college entrance examinations. The group divided itself into three groups on a purely random basis. Two of the groups used the books, each group selecting a different book. The third group did not use the books. Listed below are the obtained entrance exam scores. Perform the ANOVA using the 5% level of significance and interpret your results.
BOOK I: 532 455 440 620 560 522 517 520 510
BOOK II: 540 570 520 620 660 605 602 590
NO BOOK: 380 470 441 487 420 390 450 510 430 560
In: Statistics and Probability
15. Which of the following divides quantitative measurements into classes and graphs the frequency, relative frequency, or percentage frequency for each class?
Multiple Choice
histogram
dot plot
stem-and-leaf display
scatter plot
16. The number of items rejected daily by a manufacturer because
of defects for the last 30 days are:
20, 21, 8, 17, 22, 19, 18, 19, 14, 17, 11, 6, 21, 25, 4, 19, 9, 12,
16, 16, 10, 28, 24, 6, 21, 20, 25, 5, 17, 8
How many classes should be used in constructing a histogram?
Multiple Choice
6
5
7
4
18. When developing a frequency distribution, the class (group) intervals must be ________.
Multiple Choice
large
small
integer
nonoverlapping
equal
19. Which of the following graphical tools is not used to study the shapes of distributions?
Multiple Choice
stem-and-leaf display
scatter plot
histogram
dot plot
21. Which one of the following graphical tools is used with quantitative data?
Multiple Choice
bar chart
histogram
pie chart
Pareto chart
22. An example of manipulating a graphical display to distort reality is ________.
Multiple Choice
starting the axes at zero
making the bars in a histogram equal widths
stretching the axes
adding an unbiased caption
23. A ________ shows the relationship between two variables.
Multiple Choice
stem-and-leaf
bar chart
histogram
scatter plot
pie chart
25. As a general rule, when creating a stem-and-leaf display, there should be ______ stem values.
Multiple Choice
between 3 and 10
between 1 and 100
no fewer than 20
between 5 and 20
In: Statistics and Probability
1. Load the regression data in the le called wagedata.csv and
answer the following questions:
(a) Create an interaction between Ability and PhD
(b) Run a regression with the interaction a constant Ability and
PhD. Write down you estimators
and the t-statistics
(c) Compute the di erence-in-di erence estimate and write down you
answer.
(d) Test if the di erence is signi cant by showing relevant steps,
and write down the conclusion to
the test.
2. Which of these photos shows evidence of
heteroskedasticity?
0 20 40 60 80 100 120
0 100 200 300 400 500 600
x1
y1
−6 −4 −2 0 2 4 6
−10 0 10 20 30
x
y
−6 −4 −2 0 2 4 6
−10 −5 0 5 10
x
y
−6 −4 −2 0 2 4 6
−10 −5 0 5 10 15
x
y
3. Load the dataset called ec122a.csv and decide the appropriate
regression to run. Write down what
transformations, corrections, etc... you make and why.
Data
| Wage;"Ability";"Phd" | |||
| 30 | 2148858244105;-10 | 0874543747999;1 | |
| 21 | 2139481124597;-0 | 590192820738451;1 | |
| 0 | 804274100356348;18 | 2611120427467;1 | |
| 21 | 2841837231414;-1 | 56022339054444;1 | |
| 19 | 9701441966751;-0 | 270217314022561;1 | |
| -19 | 3505986647068;15 | 2847691646256;1 | |
| -37 | 5318232168738;26 | 0961104031439;1 | |
| -27 | 5104548523827;7 | 5761567533525;1 | |
| 1 | 12580739232134;-1 | 18594902993318;1 | |
| 8 | 46653345914067;0 | 0785472499891622;1 | |
| -4 | 3851186614386;12 | 1320105514616;1 | |
| 3 | 50685341593623;7 | 34914917101494;1 | |
| -13 | 9237294518445;18 | 4776393201793;1 | |
| 8 | 19952131952363;3 | 24253596299393;1 | |
| 2 | 061035907599;-0 | 483248819158479;1 | |
| 7 | 77793037392366;5 | 98655277801752;1 | |
| -6 | 30291122168363;19 | 5012071181202;1 | |
| 9 | 8638921608847;17 | 2307860456577;1 | |
| -1 | 60927411206267;0 | 627619361224518;1 | |
| 18 | 2636750628683;9 | 55865292554422;1 | |
| -19 | 85280408247;32 | 3061680317419;1 | |
| -38 | 3633350768018;27 | 9436433893924;1 | |
| -40 | 7205010397063;31 | 6850695595438;1 | |
| -56 | 2602894197782;35 | 0681431228772;1 | |
| -32 | 9991761971437;27 | 6280924263471;1 | |
| 9 | 7479459402353;7 | 57174198307181;0 | |
| 3 | 92900982953838;0 | 861977409866384;0 | |
| 50 | 248108939599;33 | 5000136378381;0 | |
| 30 | 7461400746423;25 | 8930976678625;0 | |
| 49 | 9814106320709;46 | 0773964388559;0 | |
| 37 | 9566059786407;22 | 4655728587151;0 | |
| 68 | 6497575622049;49 | 1421665303397;0 | |
| 61 | 0701238471535;32 | 6494107219151;0 | |
| 55 | 7189943229771;34 | 2491817925178;0 | |
| 51 | 109332042575;48 | 4620545148998;0 | |
| 56 | 0861713803033;56 | 2611865964331;0 | |
| 40 | 516170174837;29 | 6930159318191;0 | |
| 44 | 0586166449751;35 | 2492085855466;0 | |
| 59 | 6616305513546;45 | 3875176058839;0 | |
| 30 | 4331767384442;38 | 1275770320187;0 | |
| 54 | 8625391374503;41 | 2616692882961;0 | |
| 23 | 5581065455008;42 | 2396991920984;0 | |
| 51 | 6104307198847;49 | 4530276941521;0 | |
| 68 | 8499222925911;57 | 375001650011;0 | |
| 34 | 9282337106992;33 | 7966475747671;0 | |
| 59 | 6531629794339;32 | 9891986645948;0 | |
| 48 | 8530160146515;42 | 5814753560819;0 | |
| 41 | 8592579309319;38 | 2969055544136;0 | |
| 68 | 7653893378851;59 | 1407240737376;0 | |
| 57 | 2611898080186;55 | 2997953033722;0 | |
| 71 | 4317975269271;59 | 8575740860399;0 | |
| 84 | 3041078190792;56 | 9187686247403;0 | |
| 86 | 8127563905414;57 | 8447954875125;0 | |
| 53 | 8947609338275;42 | 9180372026626;0 | |
| 75 | 451187082937;66 | 4714537888208;0 | |
| 71 | 8524802636783;66 | 5647387578261;0 | |
| 72 | 7015631893814;63 | 9321052241629;0 | |
| 68 | 5345645066989;46 | 9435171993065;0 | |
| 57 | 4027012602536;40 | 8696600009591;0 | |
| 94 | 3208057977659;70 | 4812637532467;0 | |
| 73 | 3865424233984;56 | 9041537923933;0 | |
| 88 | 8183392221799;70 | 0278010012836;0 | |
| 73 | 3087112512961;56 | 9953148483697;0 | |
| 86 | 3886013131513;60 | 5180523355662;0 | |
| 67 | 2021941169906;51 | 0590708916793;0 | |
| 118 | 375388309556;94 | 4572602759228;0 | |
| 60 | 6789396907979;61 | 1500381246522;0 | |
| 98 | 719626489431;77 | 9170774341119;0 | |
| 71 | 443350318515;66 | 314958140777;0 | |
| 64 | 6034850016771;58 | 4809681916044;0 | |
| 73 | 1618976038289;65 | 1237350851343;0 | |
| 60 | 4746000022732;63 | 0423330904353;0 | |
| 120 | 289733522426;93 | 5416148319245;0 | |
| 107 | 032173927375;79 | 1334457282595;0 | |
| 91 | 8986502218894;74 | 6191805319747;0 | |
| 80 | 7706797354782;69 | 0717782611234;0 | |
| 94 | 9972106243549;76 | 4438198039696;0 | |
| 69 | 4704718368837;66 | 2502018108482;0 | |
| 100 | 848924827906;80 | 8871627341593;0 | |
| 126 | 836422964446;84 | 3088129083253;0 | |
| 123 | 570430325546;96 | 9617142388936;0 | |
| 64 | 9631783153722;69 | 8731666565007;0 | |
| 94 | 8537176555163;83 | 4972763448062;0 | |
| 130 | 547827259813;91 | 5406501517776;0 | |
| 93 | 4716274384042;79 | 6440870678146;0 | |
| 103 | 69870631698;79 | 8560598931133;0 | |
| 90 | 4185801410255;76 | 4545817393735;0 | |
| 87 | 0684258802465;84 | 5415174865785;0 | |
| 145 | 840161057534;111 | 032359346546;0 | |
| 123 | 719439438811;98 | 0032391174047;0 | |
| 117 | 321770358635;90 | 845864156288;0 | |
| 124 | 037150698884;105 | 148580858475;0 | |
| 114 | 982603027777;94 | 3143209557192;0 | |
| 139 | 514587413482;113 | 254090704761;0 | |
| 109 | 802729838307;91 | 8569567410886;0 | |
| 111 | 534270833463;94 | 1269472639582;0 | |
| 99 | 5545891547564;78 | 9229661614192;0 | |
| 95 | 841141946642;85 | 3461049648653;0 | |
| 113 | 258297584026;96 | 8252063828309;0 | |
| 124 | 340999773273;99 | 8886185674963;0 | |
In: Statistics and Probability
|
Year |
n |
y |
x |
|
1971 |
1 |
40 |
6 |
|
1972 |
2 |
44 |
10 |
|
1973 |
3 |
46 |
12 |
|
1974 |
4 |
48 |
14 |
|
1975 |
5 |
52 |
16 |
|
1976 |
6 |
58 |
18 |
|
1977 |
7 |
60 |
22 |
|
1978 |
8 |
68 |
24 |
|
1979 |
9 |
74 |
26 |
|
1980 |
10 |
80 |
32 |
In: Economics
Consider the following two scenarios
Original Scenario:
T = 80 hours
Wage = $20
Payroll tax = 20%
Under this original scenario, the worker maximizes their utility by
choosing to leisure 30 hours a week (i.e. work 50 hours).
The government then proposes a new plan where everyone is given
$300 each week as a supplement to their income. However, to pay for
this $300 cash grant they increase the payroll tax to 50%.
Thus...
Negative Income Tax Scenario:
T = 80 hours
Wage = $20
Payroll tax = 50%
Cash Grant = $300
(a) Graph the workers two scenarios on ONE graph. You will need to solve for and include the following values in your graph:
Cmax under the original scenario AND the negative income tax scenario
The true slope of the budget line in both the original AND negative income tax scenarios.
In BOTH scenarios: The value of C if the worker leisures for 30 hours
Finally, since you are TOLD that the optimal C-L bundle under the original scenario occurs at leisure =
30 hours, correctly draw the indifference curve at that point.
In: Economics
student_id=100
set.seed(student_id)
Group1=round(rnorm(15,mean=10,sd=4),2)
Group2= round(rnorm(12,mean=7,sd=4),2)
For this question you are not allowed to use the lm() command in R or the equivalent of lm() in python or other software. If you want to use a software, only use it as a calculator. So if you are using R, you may only use mean(), sum(), qt() and of course +,-,*,/. (Similar restrictions for Python, excel or others).
Consider all the 27 numbers printed under Group1 and Group2 as your y values, and the two group indicators as a categorical variable x ( indicating Group1 vs Group2).
(a) Fit a least square regression line and calculate the intercept and the slope.
(b) At 5% level of significance, test that the true slope parameter is zero.
(c) Match your answer from part (b) to your answers from Question 2. Describe briefly any similarity that you see.
In: Statistics and Probability
In: Nursing
Hooper Printing Inc. has bonds outstanding with 9 years left to maturity. The bonds have an 8% annual coupon rate and were issued 1 year ago at their par value of $1,000. However, due to changes in interest rates, the bond's market price has fallen to $910.40. The capital gains yield last year was - 8.96%.
In: Finance
3- Use FirstLastList: Write method public void
join(FirstLastList SecondList) such that given two
linked lists, join them together to give one. So if the lists lst1=
[1,3,7,4] and lst2=[2,4,5,8,6], the result of lst1.join(lst2) is
lst1=[1,3,7,4,2,4,5,8,6] and lst2=[].
4- Use FirstLastList: Write method public void
swap(). It swaps the first and last elements of a
FirstLastList. So if lst1= [1,3,7,4], lst1.swap() = [4,3,7,1].
Display or throw an exception if the list contains less than two
elements.
public class FirstLastList
{
private Link first; // ref to first link
private Link last; // ref to last link
//
-------------------------------------------------------------
public FirstLastList() // constructor
{
first = null; // no links 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
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
last = newLink; // newLink <-- last
}
//
-------------------------------------------------------------
public long deleteFirst() // delete first link
{ // (assumes non-empty list)
long temp = first.dData;
if(first.next == null) // if only one item
last = null; // null <-- last
first = first.next; // first --> old next
return temp;
}
//
-------------------------------------------------------------
public void displayList()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning
while(current != null) // until end of list,
{
current.displayLink(); // print data
current = current.next; // move to next link
}
System.out.println("");
}
public void join(FirstLastList otherList) {
Link current = otherList.first; // start at beginning
while (current != null) { // until end of list,
this.insertLast(current.dData);
current = current.next; // move to next link
}
otherList.first = null;
}
public void swap() throws Exception {
int count = 0;
Link current = first; // start at beginning
while (current != null) { // until end of list,
count++;
current = current.next; // move to next link
}
if (count < 2) {
throw new Exception("There is not enough element in the
list.");
} else
{
long firstData = first.dData;
long lastData = last.dData;
first.dData = lastData;
last.dData = firstData;
}
}
}
class Link
{
public long dData; // data item
public Link next; // next link in list
public Link(long d) // constructor
{ dData = d; }
public void displayLink() // display this link
{ System.out.print(dData + " "); }
} // end class Link
public class FirstLastAppTest
{
public static void main(String[] args)
{
FirstLastList lst1 = new FirstLastList(); // Start a new
FirstLastList called lst1
lst1.insertLast(1); // Add links with data to the last
position
lst1.insertLast(3);
lst1.insertLast(7);
lst1.insertLast(4);
System.out.print("\nlst1: "); // print the description for the
list
lst1.displayList(); // print the contents of the list
FirstLastList lst2 = new FirstLastList(); // Start a new FirstLastList called lst2
lst2.insertLast(2); // Add links with data to the last
position
lst2.insertLast(4);
lst2.insertLast(5);
lst2.insertLast(8);
lst2.insertLast(6);
System.out.print("\nlst2: "); // print the description for the
list
lst2.displayList(); // print the contents of the list
System.out.print("\nlst1.join(lst2): "); // print the
action to take place: lst1.join(lst2)
lst1.join(lst2); // call the join method for lst1 to add lst2
System.out.print("\nlst1: "); // print the description for the
list
lst1.displayList(); // print the contents of the list lst1; post
join()
System.out.print("lst2: "); // print the description for the
list
lst2.displayList(); // print the contents of the list lst2; post
join()
System.out.print("\nlst1.swap(): "); // print the action
to take place: lst1.swap()
lst1.swap(); // call the swap method for lst1
System.out.print("\nlst1: "); // print the description for the
list
lst1.displayList(); // print the contents of the list lst1; post
swap()
} // end main()
} // end class
I can't get FirstLastAppTest to work with my code. I can't post my FirstLastApp as I have limited space for 1 question.
PLEASE DO NOT MODIFY FirstLastAppTest!!! Its just for testing the code.
In: Computer Science