1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
WARRIOR [948]
3 years ago
11

The data below represents the yearly earnings (in $1000s of dollars) that high school and college (BS) graduates earn at a small

firm. Determine if there is any difference in pay for the two groups: Be sure to include a complete analysis (i.e., all assumptions checked and full understanding of effects garnered) and a clear summary with all needed statistical details included.

Computers and Technology
1 answer:
Taya2010 [7]3 years ago
3 0

Answer:

library(moments)

library(readxl)

Exam1Q1 <- read_excel("Exam1Q1.xlsx")

View(Exam1Q1)

## Warning in system2("/usr/bin/otool", c("-L", shQuote(DSO)), stdout = TRUE):

## running command ''/usr/bin/otool' -L '/Library/Frameworks/R.framework/

## Resources/modules/R_de.so'' had status 1

plot(density(Exam1Q1$Highschool))

gostino.test(Exam1Q1$Highschool)

##  

##  D'Agostino skewness test

##  

## data:  Exam1Q1$Highschool

## skew = -0.24041, z = -0.69269, p-value = 0.4885

## alternative hypothesis: data have a skewness

agostino.test(Exam1Q1$BS)

##  

##  D'Agostino skewness test

##  

## data:  Exam1Q1$BS

## skew = 0.53467, z = 1.49330, p-value = 0.1354

## alternative hypothesis: data have a skewness

anscombe.test(Exam1Q1$Highschool)

##  

##  Anscombe-Glynn kurtosis test

##  

## data:  Exam1Q1$Highschool

## kurt = 2.56950, z = -0.29677, p-value = 0.7666

## alternative hypothesis: kurtosis is not equal to 3

anscombe.test(Exam1Q1$BS)

##  

##  Anscombe-Glynn kurtosis test

##  

## data:  Exam1Q1$BS

## kurt = 3.6449, z = 1.2599, p-value = 0.2077

## alternative hypothesis: kurtosis is not equal to 3

t.test(Exam1Q1$Highschool,Exam1Q1$BS, var.equal = T)

##  

##  Two Sample t-test

##  

## data:  Exam1Q1$Highschool and Exam1Q1$BS

## t = 0.16929, df = 76, p-value = 0.866

## alternative hypothesis: true difference in means is not equal to 0

## 95 percent confidence interval:

##  -1.131669  1.341926

## sample estimates:

## mean of x mean of y  

##  39.51282  39.40769

Explanation:

Summary:

The data set include two dependent variables which states High School annual earnings and BS annual earnings in the same small firm. Firstly, I used density plot function to view the distribution of two sets of variables. Secondly, I tested the skewness and kurtosis.Skewness of High School is -0.24041 which is left tail. Skewness of BS is 0.53476 which is right tail.Kurtosis of High School is 2.5695 which lower than 3 is platykurtic. Kurtosis of BS is 3.6449 which larger than 3 is leptokurtic. Thirdly, the sample population is 39 for each and has unknow standard deviation, so that I’m going to use t-test to perform the comparing analysis. The result shows p-value which equal to 0.866 is larger than significant value(alpha = 0.05). To the concludsion, there is no difference between yearly earnings of High School and of BS at a small firm.

You might be interested in
Modify the NumberedList class we implementd during the lecture by adding a member function: void NumberedList::insertPosition(in
satela [25.4K]

Answer:

Check the explanation

Explanation:

#include<iostream>

using namespace std;

class LinkedList

{

private:

   // Declare a structure for the list.

   struct ListNode

   {

   int value;        // The value in this node.

   struct ListNode *next;// To point to the next node.

   };

   ListNode *head;        // List head pointer.

public:

   // Constructor.

   LinkedList()

       { head = NULL; }

   

   // Destructor

   ~LinkedList();

   

   // Linked list operations.

   void appendNode( int );

   void insertNode( int );

   void insertNodeAt(int,int);

    void deleteNode( int );

   void Reverse();

   void deleteAt(int);

   int Search(int);

   void display() const;

};

// appendNode appends a node containing the      

// value passed into num, to the end of the list.  

void LinkedList::appendNode( int num )

{

  ListNode *newNode; // To point to a new node.

  ListNode *nodePtr; // To move through the list.

  // Allocate a new node and store num there.

  newNode = new ListNode;

  newNode->value = num;

  newNode->next = NULL;

  // If there are no nodes in the list.

  // make newNode the first node.

  if ( !head )

     head = newNode;

  else // Otherwise, insert newNode at end.

  {

     // Initialize nodePtr to head of list.

     nodePtr = head;

     // Find the last node in the list.

     while ( nodePtr->next )

        nodePtr = nodePtr->next;

     // Insert newNode as the last node.

     nodePtr->next = newNode;

  }    //    end else-if

  display();  

}    //    end function appendNode

// displayList shows the value stored in each              

// node of the linked list pointed to by head.      

                       

void LinkedList::display() const

{

   ListNode *nodePtr; // To move through the list

   if ( !head )

   {

       cout << "\n\tThe list is empty.";

       return;

   }

   // Position nodePtr at the head of the list.

   nodePtr = head;

   cout << "\n\n\tThe elements in the list are:\n\t";

   // While nodePtr points to a node, traverse the list.

 

    while (nodePtr)

   {

       // Display the value in this node.

       cout << nodePtr->value << " -> ";

       // Move to the next node.

       nodePtr = nodePtr->next;

   }    //    end while.

   cout << "Null";

}    //    end function displayList.

// Reverse function re-arranges node in the list.

void LinkedList::Reverse()

{

   ListNode *nodePtr;

   ListNode *next;

   ListNode *result=NULL;

   if ( !head )

   {

       cout << "\n\tThe list is empty.";

       return;

   }

   // Position nodePtr at the head of the list.

   nodePtr = head;

   while (nodePtr!=NULL)

   {

       next=nodePtr->next;

       nodePtr->next=result;

       result=nodePtr;

       nodePtr=next;

   }

   head=result;

display();

}

// The insertNode function inserts a node with num copied to its value member.                

void LinkedList::insertNode( int num )

{

   ListNode *newNode;             // A new node.

   ListNode *nodePtr;             // To traverse the list.

   ListNode *previousNode = NULL; // The previous node.

   // Allocate a new node and store num there.

   newNode = new ListNode;

   newNode->value = num;

   newNode->next = NULL;

 

   // If there are no nodes in the list make newNode the first node.

   if ( !head )

       head = newNode;

   else // Otherwise, insert newNode.

   {

       // Position nodePtr at the head of list.

       nodePtr = head;

       //    Initialize previousNode to NULL.

       previousNode = NULL;

       //    Skip all nodes whose value is less than num.

       while ( nodePtr != NULL && nodePtr->value < num )

       {

           previousNode = nodePtr;

           nodePtr = nodePtr->next;

       }

       //If the new node is to be the 1st in the list,

       //    insert it before all other nodes.

       if ( previousNode == NULL )

       {

           head = newNode;

           newNode->next = nodePtr;

       }

       else // Otherwise insert after the previous node.

       {

           previousNode->next = newNode;

           newNode->next = nodePtr;

       }

   }    //    end else-if

     

display();  

}    //    end function insertNode.

// The insertNode function inserts a node at pos  

//with num copied to its value member.          

void LinkedList::insertNodeAt( int num ,int pos)

{

   ListNode *newNode;             // A new node.

   ListNode *nodePtr;             // To traverse the list.

   ListNode *previousNode = NULL; // The previous node.

   int i=0;

   // Allocate a new node and store num there.

   newNode = new ListNode;

   newNode->value = num;

   newNode->next = NULL;

   // Position nodePtr at the head of list.

       nodePtr = head;

   if(pos==0)//to inserted at first.

   {  

       newNode->next=head;

       head=newNode;

   }

   else

   {

   while(nodePtr != NULL && i<pos) //loop to reach position.

       {  

           previousNode=nodePtr;

           nodePtr=nodePtr->next;

           i++;

       }

       if(nodePtr==NULL)//position not found.

           cout<<"Invalid Position :"<<endl;

       else//inserts node.

       {

           newNode->next=nodePtr;

           previousNode->next=newNode;

       }

   }

   display();

}

//    The deleteNode function searches for a node with num as its value.  

//The node, if found, is deleted from the list and from memory.

void LinkedList::deleteNode( int num )

{

   ListNode *nodePtr;       // To traverse the list.

   ListNode *previousNode;//To point to the previous node.

   // If the list is empty, do nothing.

   if ( !head )

   {

       cout << "\n\tFailed to delete as list is empty.";  

       return;

   }

   // Determine if the first node is the one.

   if ( head->value == num )

   {

       nodePtr = head->next;

       delete head;

       head = nodePtr;

   }

   else

   {

       // Initialize nodePtr to head of list.

       nodePtr = head;

       // Skip all nodes whose value member is not equal to num.

       while (nodePtr != NULL && nodePtr->value != num)

       {

           previousNode = nodePtr;

           nodePtr = nodePtr->next;

       }

3 0
3 years ago
Your friends know that you understand a lot about computers, both the technical details of how they operate as well as informati
erma4kov [3.2K]

Answer:

The answer is A.

Explanation:

Regarding the information given in the question, we are asked to evaluate the options given which i believe have answers as follows;

B is true. Public-domain means that there are no individuals who hold a copyright over the subject which enables people to copy and distribute, the software in this case, freely.

C is true. Shareware is a term that is used for applications which have a certain trial period for users to decide whether the application meets their needs and demands and then they have to pay the required amount to keep using the software to its full potential. Most often it is the case that if the user does not agree to a payment, the features they are allowed to use are very limited and render the software almost useless until the payment is completed.

D is true. "Copyright" is by definition is approved by the authorities and gives its creater the right to use, sell and change the creative product as they please. It works the same way for software products as well so the statement in option D is true.

A is wrong. Although they are freeware, this softwares still may have copyrights and even if they do not, they are very basic or even incomplete programs to satisfy the minimal needs of its users.

I hope this answer helps.

7 0
3 years ago
T/F The two primary sections of the CPU are the arithmetic/logic unit and the control unit
sashaice [31]
True because cpu are the arithmetic/logic units and the control unit
4 0
3 years ago
A good algorithm should have which three components?
laila [671]

Answer:

a good algorithm must be able to accept a set of defined input. Output: a good algorithm should be able to produce results as output, preferably solutions. Finiteness: the algorithm should have a stop after a certain number of instructions. Generality: the algorithm must apply to a set of defined inputs.Explanation:

7 0
3 years ago
What type of computer/device do you have i need it for a survey and it due today soooooooooooooo
Xelga [282]

Answer:

ooh I have a I phone computer

5 0
3 years ago
Other questions:
  • What is the primary criticism against a national identification system based on biometric data?
    13·1 answer
  • 2. a. Write pseudocode for a divide-and-conquer algorithm for finding valuesof both the largest and smallest elements in an arra
    11·1 answer
  • Binary code what does this mean I was sick so I don't under stand
    7·2 answers
  • In which situation will file compression be required to complete the task
    15·1 answer
  • 4. Write an appropriate comment for describ-
    11·1 answer
  • Advantages of heading attributes
    5·1 answer
  • The methods in a subclass can use all of the data fields and methods that belong to its parent, with one exception: ____ members
    11·1 answer
  • The signature area in a cover letter includes the sender's first and last name, followed by his/her job title (if applicable). *
    13·1 answer
  • Which is an example of an operating system? (5 points)
    5·1 answer
  • The first time that a particular visitor loads a web site page is called a(n) _____.
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!