tow conducting cones (θ = π/10 and θ = π/6) of infinite extent are separated by an infinitesimal gap at r = 0. If V(θ = π/10) = 0 and V(θ = π/6) = 50 V, find V and E between the cones. Solution:

Create your own data. Ensure the data will test all criteria and prove all sorts worked as required. Be sure that all tables and queries have descriptive names. “Query 1” and “Step 1” are examples of poor names.

Step 1

Build a Database named DBMS Course Project. The database should include the following tables:

• First Table – Students
  • ID
  • First Name
  • Last Name
  • Address
  • City
  • State
  • Zip Code
  • Phone Number with area code
• Second Table – GPA
  • ID Current GPA (two decimal positions)
  • Class (numeric field, 1 = Freshman, 2 = Sophomore, etc.)
    • Freshman
    • Sophomore
    • Junior
    • Senior
    • Graduate Student
• Third Table – Scholarships
  • ID
  • Major course of study
  • Academic Scholarship (Use Yes/No data type)
  • Athletic Scholarship (Use Yes/No data type)

Step 2

Extract the First and Last Name, Address, City, State, Zip Code and Phone Number of each Senior on the database. Sort by Last Name, then First Name (1 sort).

Step 3

Extract the First and Last Name, and GPA of each student who qualifies for the Dean’s List. Sort by GPA, then Last Name, then First Name (1 sort). A GPA of 3.25 is required to make the Dean’s List.

PART 2

Build a query of all students on athletic scholarship. Additionally, produce a report with descriptive report and column headings. Be sure there is enough data to prove the selection and sort worked as required. Submit the database in unzipped format as well as submitting screenshots of the query and the report.

Step 1

Extract the First and Last Name, Student ID, Course Major and GPA of all students on athletic scholarship. Sort by Course Major, Last Name, then First Name in a single sort.

Step 2

Produce a report with the data from Step 1 and use good headings.

Suppose that X1,X2,X3,X4 are independent random variables with common mean E(Xi) =μ and variance Var(Xi) =σ2. LetV=X2−X3+X4 and W=X1−2X2+X3+ 4X4.

(a) Find E(V) and E(W).

(b) Find Var(V) and Var(W).

(c) Find Cov(V,W).(

d) Find the correlation coefficientρ(V,W). Are V and W independent?

Suppose that X1,X2,X3,X4 are independent random variables with common mean E(Xi) =μ and variance Var(Xi) =σ2. LetV=X2−X3+X4 and W=X1−2X2+X3+ 4X4.

(a) Find E(V) and E(W).

(b) Find Var(V) and Var(W).

(c) Find Cov(V,W).(

d) Find the correlation coefficientρ(V,W). Are V and W independent?

There is a multiple choice question with 4 choices. Many students got the problem wrong. Out of a class of n=60 only 20 got the problem right (1/3 or p=.3333). Prof. K wants to determine if the
students answered the question correctly more frequently than chance, i.e., the null hypothesis is 1/4 or p=.25).

Does the success/failure criterion hold?

What conditions might invalidate the independence requirement?

i) students copying each other's answers

ii) different sections taking the test on different days

iii) students from different majors taking the test

iv) allowing a cheat sheet

What is the standard error for our sample estimate?

What is the lower bound of the confidence interval for the underlying population parameter at the 95% confidence level using a normal/Z distribution?

What is the upper bound of the confidence interval for the underlying population parameter, at the 95% confidence level using a normal/Z distribution?

Even though the null-hypothesis value (.25) is included in the confidence interval, we can be more precise by doing a hypothesis test. What is the standard error of the null hypothesis value?

What is the p-value of of the null hypothesis? Remember to double the p-value you get out of p-norm because this is a two-tailed test.

Based on this hypothesis test, we should...

i) fail to reject the alternative hypothesis

ii) accept the alternative hypothesis

iii) reject the null hypothesis

iv) accept the null hypothesis

v) fail to reject the null hypothesis

vi) reject the alternative hypothesis

We can think about this in yet another way: the chi-squared test. Let's say that the correct answer was 'c' and as mentioned earlier, the sample proportion is p=.3333. The sample proportion for 'a' is .0666667, for 'b' it is .3 and for 'd' it is .3.

What are the expected counts for each multiple-choice option under the null hypothesis?

What is the observed count of the 'a' option?

What is the observed count of the 'b' option?

What is the observed count of the 'c' option?

What is the observed count of the 'd' option?

What is the chi-squared statistic?

What is the p-value for the X^2 test?

Given these analyses, what is the best explanation we can draw, choosing from among the options below?

i) students guessed the answer at random

ii) 15 students knew the right answer and did not guess at random

iii) the guesses were not at random but there was confusion among some options

6.9 Lab: Singly-Linked Lists

As an entry-level programmer you have to be able to read, understand existing code and update it (add new features). One of this assignment’s goals is to read about 400 lines of code in five files, compile and run the program, understand it, and change it as required.

Download and review the following files (read code and all comments carefully):

• College.h
• College.cpp
• LinkedList.h
• LinkedList.cpp
• main.cpp

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

//colleges.txt

3 SBCC Santa Barbara City College; 18524
97 ZZC ZZ College; 9997
5 PCC Pasadena City College; 17666
7 NVC Napa Valley College; 18920
15 PVC Palo Verde College; 18266
4 DVC Diablo Valley College; 20579
6 FC Foothill College; 19302
12 CS College of the Siskiyous; 21936
99 CPC Cupertino College; 9999
10 CC Cuesta College; 19135
8 OC Ohlone College; 15878
98 ABC AB College; 9998
1 DAC De Anza College; 19302
9 IVC Irvine Valley College; 20577

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

//LinkedList.cpp

#include <iostream>

#include "LinkedList.h"

using namespace std;

//**************************************************

// Constructor

// This function allocates and initializes a sentinel node

// A sentinel (or dummy) node is an extra node added before the first data record.

// This convention simplifies and accelerates some list-manipulation algorithms,

// by making sure that all links can be safely dereferenced and that every list

// (even one that contains no data elements) always has a "first" node.

//**************************************************

LinkedList::LinkedList()

{

head = new Node; // head points to the sentinel node

head->next = NULL;

length = 0;

}

//**************************************************

// The insertNode function inserts a new node in a

// sorted linked list

//**************************************************

void LinkedList::insertNode(College dataIn)

{

Node *newNode; // A new node

Node *pCur; // To traverse the list

Node *pPre; // The previous node

  

// Allocate a new node and store num there.

newNode = new Node;

newNode->college = dataIn;

// Initialize pointers

pPre = head;

pCur = head->next;

// Find location: skip all nodes whose code is less than dataIn's code

while (pCur && newNode->college.getCode() > pCur->college.getCode())

{

pPre = pCur;

pCur = pCur->next;

}

  

// Insert the new node between pPre and pCur

pPre->next = newNode;

newNode->next = pCur;

  

// Update the counter

length++;

}

//**************************************************

// The deleteNode function searches for a node

// in a sorted linked list; if found, the node is

// deleted from the list and from memory.

//**************************************************

bool LinkedList::deleteNode(string target)

{

Node *pCur; // To traverse the list

Node *pPre; // To point to the previous node

bool deleted = false;

  

// Initialize pointers

pPre = head;

pCur = head->next;

// Find node containing the target: Skip all nodes whose gpa is less than the target

while (pCur != NULL && pCur->college.getCode() < target)

{

pPre = pCur;

pCur = pCur->next;

}

  

// If found, delte the node

if (pCur && pCur->college.getCode() == target)

{

pPre->next = pCur->next;

delete pCur;

deleted = true;

length--;

}

return deleted;

}

//**************************************************

// displayList shows the value

// stored in each node of the linked list

// pointed to by head, except the sentinel node

//**************************************************

void LinkedList::displayList() const

{

   Node *pCur; // To move through the list

   // Position pCur: skip the head of the list.

   pCur = head->next;

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

   while (pCur)

   {

   // Display the value in this node.

   pCur->college.hDdisplay();

   // Move to the next node.

   pCur = pCur->next;

}

cout << endl;

}

//**************************************************

// The searchList function looks for a target college

// in the sorted linked list: if found, returns true

// and copies the data in that node to the output parameter

//**************************************************

bool LinkedList::searchList(string target, College &dataOut) const

{

bool found = false; // assume target not found

Node *pCur; // To move through the list

  

/* Write your code here */

  

return found;

}

//**************************************************

// Destructor

// This function deletes every node in the list.

//**************************************************

LinkedList::~LinkedList()

{

Node *pCur; // To traverse the list

Node *pNext; // To hold the address of the next node

  

// Position nodePtr: skip the head of the list

pCur = head->next;

// While pCur is not at the end of the list...

while(pCur != NULL)

{

// Save a pointer to the next node.

pNext = pCur->next;

  

// Delete the current node.

delete pCur;

  

   // Position pCur at the next node.

pCur = pNext;

}

  

delete head; // delete the sentinel node

}

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

//LinkedList.h

#ifndef LINKED_LIST_H

#define LINKED_LIST_H

#include "College.h"

class LinkedList

{

private:

struct Node

{

College college;

Node *next;

};

Node *head;

int length;

public:

LinkedList(); // constructor

~LinkedList(); // destructor

// Linked list operations

int getLength() const {return length;}

void insertNode(College);

bool deleteNode(string);

void displayList() const;

bool searchList(string, College &) const;

};

#endif

Suppose the government mandates that employers provide health insurance that costs $t per unit of labor. Employees value the insurance per unit of labor at $v. How does the insurance mandate affect the equilibrium wage and labor if $v=$0? If $0<$v<$t? If $v=$t?

Suppose the government mandates that employers provide health insurance that costs $t per unit of labor. Employees value the insurance per unit of labor at $v. How does the insurance mandate affect the equilibrium wage and labor if $v=$0? If $0<$v<$t? If $v=$t?

Suppose the government mandates that employers provide health insurance that costs $t per unit of labor. Employees value the insurance per unit of labor at $v. How does the insurance mandate affect the equilibrium wage and labor if $v=$0? If $0<$v<$t? If $v=$t?

In March 2012, students in class were surveyed for favorite juice flavor. They were asked to try all four and chose the one they liked the best. Is one type of juice flavor preferred more?

                              # Best Flavor Votes

grape                   15

orange                 6

apple                    15

lemonade            25

1. decide what would be the appropriate statistical test from the list below

1 variable: Chi Square Goodness of Fit Test

2. write out the main question and then the null and alternative hypotheses, defining symbols and making inference to the population

I just need help with part b