Questions
Complex Variable Evaluate the following integrals: a) int_c (z^2/((z-3i)^2)) dz; c=lzl=5 b) int_c (1/((z^3)(z-4))) dz ;...

Complex Variable Evaluate the following integrals:

a) int_c (z^2/((z-3i)^2)) dz; c=lzl=5

b) int_c (1/((z^3)(z-4))) dz ; c= lzl =1

c) int_c (2(z^2)-z+1)/(((z-1)^2)(z+1)) dz ; c= lzl=3

(Details Please)

In: Advanced Math

Once you have the dataset, please use knowledge gained in other business and/or economics classes to...

Once you have the dataset, please use knowledge gained in other business and/or economics classes to realize what topic and theory the data could relate and a research question that it could allow you to answer. More specifically, please put together an analysis by making sure your project report includes the following:

  1. Brief statement of the research topic and problem. As you get the dataset from me, you would need to use some imagination what research problem that data could be related to. Nevertheless, please state very briefly (i.e. in one paragraph) what theory (research literature or textbooks related to business or economics) says about the research problem – e.g. is there some dilemma or controversy that your research will help to clarify.
  2. Clearly worded research question that limits the research problem to researchable task. (This is a short sentence that ends with the question mark and it is suggested that you draw from theory (research literature / textbook knowledge) in one of the business studies field to word it!)
  3. Please identify the type of data that you are working with – on what type of measurement scale(s) where the selected variables measured by the original data collectors. (As you work with the dataset given by me, use your educated guess).
  4. Describe the data with the tools of descriptive statistics, using both numerical as well as graphical methods. In addition to reporting and commenting on the values central tendency and diagrams, please also justify the choice of method (e.g. why a particular kind of measure of central tendency was selected and the chosen graphic is appropriate to use in this context).
  5. Justify the selection of the specific data analysis method of inferential statistics. Recommendation – use the decision tree (introduced in Ch. 9ff) to make the selection and justification of it. You should look up also the assumptions and comment how your data meets them but I will not penalize you if it does not meet all the criteria. Nevertheless, please make sure that you include the basic information about distribution of the variables – are they more or less normally distributed (use both numerical as well as graphical methods). It is required that you restrict the choice of data analysis method(s) to the ones introduced in the class. (In addition to the fact that we covered only the most basic / frequently used methods in class, also the spreadsheet program (Excel) which the textbook is based on and that I presented during the course, has limited set of methods available).
  6. Formulate the null and research (alternative) hypothesis – similarly to point 2 it is recommended that you word them on the basis of research literature / textbook knowledge in one of the business studies field that you know);
  7. Determine the test criteria:

7.1. Specify the level of significance (Type I error associated with the null hypothesis),

7.2. Determine the test statistic (the appropriate statistical test as mentioned under point 5 above),

7.3. Determine the critical values (and region(s) if applicable),

  1. Calculate the value of the test statistic (obtained value).
  2. Make a decision about the null and research hypothesis by comparing the obtained value to the critical value and interpret the results of the data. You can pay attention also to the p-values.
  3. Sum up you research report by relating the statistical test result(s) to the research question and theory that you set to test.
Severity of company's finacial problems Type of intervention Financial Stress Score
1 Intervention #1 6
1 Intervention #1 6
1 Intervention #1 7
1 Intervention #1 7
1 Intervention #1 7
1 Intervention #1 6
1 Intervention #1 5
1 Intervention #1 6
1 Intervention #1 7
1 Intervention #1 8
1 Intervention #1 7
1 Intervention #1 6
1 Intervention #1 5
1 Intervention #1 6
1 Intervention #1 7
1 Intervention #1 8
1 Intervention #1 9
1 Intervention #1 8
1 Intervention #1 7
1 Intervention #1 7
2 Intervention #1 7
2 Intervention #1 8
2 Intervention #1 8
2 Intervention #1 9
2 Intervention #1 8
2 Intervention #1 7
2 Intervention #1 6
2 Intervention #1 6
2 Intervention #1 6
2 Intervention #1 7
2 Intervention #1 7
2 Intervention #1 6
2 Intervention #1 7
2 Intervention #1 8
2 Intervention #1 8
2 Intervention #1 8
2 Intervention #1 9
2 Intervention #1 0
2 Intervention #1 9
2 Intervention #1 8
1 Intervention #2 6
1 Intervention #2 5
1 Intervention #2 4
1 Intervention #2 5
1 Intervention #2 4
1 Intervention #2 3
1 Intervention #2 3
1 Intervention #2 3
1 Intervention #2 4
1 Intervention #2 5
1 Intervention #2 5
1 Intervention #2 5
1 Intervention #2 6
1 Intervention #2 6
1 Intervention #2 7
1 Intervention #2 6
1 Intervention #2 5
1 Intervention #2 7
1 Intervention #2 6
1 Intervention #2 8
2 Intervention #2 7
2 Intervention #2 5
2 Intervention #2 4
2 Intervention #2 3
2 Intervention #2 4
2 Intervention #2 5
2 Intervention #2 4
2 Intervention #2 4
2 Intervention #2 3
2 Intervention #2 3
2 Intervention #2 4
2 Intervention #2 5
2 Intervention #2 6
2 Intervention #2 7
2 Intervention #2 7
2 Intervention #2 6
2 Intervention #2 5
2 Intervention #2 4
2 Intervention #2 4
2 Intervention #2 5
1 Placebo 2
1 Placebo 1
1 Placebo 3
1 Placebo 4
1 Placebo 5
1 Placebo 4
1 Placebo 3
1 Placebo 3
1 Placebo 3
1 Placebo 4
1 Placebo 5
1 Placebo 3
1 Placebo 1
1 Placebo 2
1 Placebo 4
1 Placebo 3
1 Placebo 5
1 Placebo 4
1 Placebo 2
1 Placebo 3
2 Placebo 4
2 Placebo 5
2 Placebo 6
2 Placebo 5
2 Placebo 4
2 Placebo 4
2 Placebo 6
2 Placebo 5
2 Placebo 4
2 Placebo 2
2 Placebo 1
2 Placebo 3
2 Placebo 2
2 Placebo 2
2 Placebo 3
2 Placebo 4
2 Placebo 3
2 Placebo 2
2 Placebo 2
2 Placebo 1

In: Statistics and Probability

Using the naïve method (most recent value) as the forecast for the next year, what are...

Using the naïve method (most recent value) as the forecast for the next year, what are the following measures of forecast accuracy

1) Mean absolute error

2) Mean squared error

3) Mean absolute percentage error

4) What is the forecast for year 11?

Consider the data below:

Year

Value

1

234

2

287

3

255

4

310

5

298

6

250

7

456

8

412

9

525

10

436


Options

  • A. 1) 72.44     2) 8263.11     3) 18.86%     4) 436
  • B. 1) 72.44     2) 8263.11     3) 34.45%     4) 586
  • C. 1) 81.67      2) 4592.51     3) 18.86%     4) 436
  • D. 1) 72.44      2) 8263.11   3) 18.86%     4) 785

In: Statistics and Probability

. A firm faces following production function: ?? = ?? 1 2?? 1 2. Suppose the...

. A firm faces following production function: ?? = ?? 1 2?? 1 2. Suppose the rental rate of capital r=40 and wage rate for labor w=10. (25) a) For a given level of output, what should be the optimal ratio of capital to labor in order to minimize cost? b) What is the minimum cost of producing 200 units? At minimum cost for producing 200 units, how much capital and labor are needed? c) What is the minimum cost of producing 300 units? At minimum cost for producing 300 units, how much capital and labor are needed? d) Graphically show the long run-expansion path. e) Does this production function exhibit increasing, decreasing, or constant returns to scale?

In: Economics

Let A =   [  0 2 0 1 0 2 0 1 0 ]  . (a)...

Let A =   [  0 2 0

1 0 2

0 1 0 ]  .

(a) Find the eigenvalues of A and bases of the corresponding eigenspaces.

(b) Which of the eigenspaces is a line through the origin? Write down two vectors parallel to this line.

(c) Find a plane W ⊂ R 3 such that for any w ∈ W one has Aw ∈ W , or explain why such a plain does not exist.

(d) Write down explicitly a diagonalizing matrix S, and a diagonal matrix Λ such that S −1AS = Λ; A = SΛS −1 . or explain why A is not diagonalizable.

In: Advanced Math

1-: ?(?) = ln (3 − √2? + 1)   ? ′(0) =? 2-Passing through the point...

1-: ?(?) = ln (3 − √2? + 1)   ? ′(0) =?

2-Passing through the point x = 1 and ? = 2?
Perpendicular to the straight line tangent to 3 + 5? - 2 parabola
what is the equation of the normal?

In: Math

Calculate L−1[6s−2(s+1)(5s2+3s+2)]

Calculate
L−1[6s−2(s+1)(5s2+3s+2)]

In: Math

Solve the system X' = (2 3 2 1)X + (t 1)

Solve the system X' = (2 3 2 1)X + (t 1)

In: Advanced Math

Let ?1 and ?2 be independent normal random variables with ?1~ ?(µ, ? 2 ) and...

Let ?1 and ?2 be independent normal random variables with ?1~ ?(µ, ? 2 ) and ?2~ ?(µ, ? 2 ). Let ?1 = ?1 and ?2 = 2?2 − ?1.

a) Find ??1,?2 (?1,?2).

b) What are the means, variances, and correlation coefficient for ?1 and ?2?

c) Find ?2(?2).

In: Statistics and Probability

1- Function 1: to delete a node in the head of the list. 2- Function 2:...




1- Function 1: to delete a node in the head of the list.
2- Function 2: to delete a node in the end of the list.
3- Function 3: to delete a node in the middle of the list. Ask the user the value of the node to delete.
4- Test the three functions in the main() and display the new list after each delete.

#include <iostream>
using namespace std;
struct node {
int num;
node * nextptr;
}*head,*curnode;
node *newnode;
void addlist (int n);
void displayList(node *head);
void FindElement(int n);

void add_head();
void add_end ();
void add_before();
int main()
{
head = NULL;
curnode = NULL;
int n;
​cout <<"single Linked List : Add elements in a single linked list :"<< endl;
​cout<<"-----------------------------------------------------------"<< endl;​ ​
cout<<" Input the number of nodes : ";
cin>> n;
addlist ( n);
displayList(head);
FindElement(n);
add_head();
displayList(head);
add_end();
displayList(head);
add_before();
displayList(head);
return 0;
}
void addlist (int n)
{
int num, i;
if(n >= 1)
{// create the head then the other nodes
head = new node;
cout <<" Enter data for node 1 : ";
cin>> num;
head->num = num;
head->nextptr = NULL;
curnode = head;
for(i=2; i<=n; i++)
{ newnode = new node;
cout<<" Enter data for node "<< i << " :" ;
cin >>num;
newnode->num = num;
newnode->nextptr = NULL;​// next address of new node set as NULL
curnode->nextptr = newnode;​// previous node is linking with new node
curnode = newnode; ​​// previous node is advanced
} ​
}
}
  
void displayList(node *head)
{
node *cur;
int n = 1;
if(head == NULL)
{
cout<<" No data found in the List yet."<<endl;
}
else
{
cur = head;
cout<<"Data entered in the list are :" <<endl;
do {
cout<<" Data :" << n << " : " << cur->num <<endl;
cur = cur->nextptr;
n++;
}while(cur!= NULL);
}
}

void FindElement(int n)
{
node *curnode= NULL;
​int ctr=1;
​int FindElem;
​curnode=head;
​cout<<" Input the element you want to find : "<< endl;
cin>>FindElem;
​
​while(curnode!=NULL)
​{
​​if(curnode->num==FindElem)
​​​break;
​​else
​​​ctr++;
​​​curnode=curnode->nextptr;
​​​if (ctr==n+1)
​​​break;
​}
​if(ctr<=n)
​​cout<< " Element found at node "<< ctr<< endl;
​else
​​cout<<" This element does not exist in linked list."<< endl;
}

void add_head()
{
​int num, i;
newnode = new node;//start creation of the new node
cout <<" Enter data for node to add in the head : ";
cin>> num;
newnode->num = num;
newnode->nextptr = NULL; //End creation of the new node
​if(head == NULL) head=newnode;// if emplty list the new node will be the head
else{ ​newnode->nextptr= head;
​​head = newnode;
}
}

void add_end ()
{
​int num, i;
newnode = new node;//start creation of the new node
cout <<" Enter data for node to add in the End : ";
cin>> num;
newnode->num = num;
newnode->nextptr = NULL;//end creation of the new node
​if(head == NULL) head=newnode;// if emplty list the new node will be the head
else { // go to the end of the list
​​curnode=head;​
​​while(curnode->nextptr!=NULL)
{
curnode= curnode->nextptr;​
}
​​curnode-> nextptr= newnode;
}
}

void add_before()
{int num,m, find=0;
node *prevnode;
​newnode = new node;//start creation of the new node
cout <<" Enter data for node to add : ";
cin>> num;
newnode->num = num;
newnode->nextptr = NULL;//end creation of the new node
cout << "enter the number to add before it: ";
cin>> m;
if (head->num==m)// if we will add before head
{newnode->nextptr= head;
head=newnode;
}
else
{
curnode= head;
​while(curnode!=NULL)
​{​​if(curnode->num==m)
​​​{find=1;
​​​break;
​​​}
​​else
​​​{prevnode=curnode;
​​​curnode=curnode->nextptr;
​​​}
​}
​if(find==0)​cout<< " Element not found "<< endl;
​else
​{prevnode->nextptr=newnode;
​newnode->nextptr=curnode;
​}
​}​
}

In: Computer Science