1. The demand curve for a good is given by the equation P = 200 - 1/4 Q and the supply curve is given by the equation P = 50 + 1/2 Q, where P represents the price of the good (measured in dollars per unit) and Q represents the quantity of the good (measured in units per week).

If the government imposes a sales tax of $9 per unit on this good. Find the new formula for the demand curve, the change in equilibrium quantity, the post-tax price received by suppliers, and the post-tax price paid by buyers. Illustrate graphically as well.

Q1. Jamie wants to forecast the number of students who will enroll in operations management next semester in order to determine how many sections to schedule. He has accumulated the following enrollment data for the past six semesters:

a (2 pts). Compute a three-semester moving average forecast for semesters 4 through 7 (Model a) (Use two decimals).

This question need to be solved using java coading :-

I. Input

   All input data are from a file "in.dat". The file contains a
sequence of infix form expressions, one per line. The character '$' 
is an end mark. For example, the following file has four infix form 
expressions:

   1 + 2 * 3 ^ ! ( 4 == 5 ) $
   3 * ( 6 - 4 * 5 + 1) + 2 ^ 2 ^ 3 $
   77 > ( 2 - 1 ) + 80 / 4 $
   ! ( 2 + 3 * 4 >= 10 % 6 ) && 20 != 30 || 45 / 5 == 3 * 3 $

Each expression is a sequence of tokens (i.e., constant integers,
operators, and end mark) separated by spaces. There is no variable.


II. Output

   Output data and related information are sent to the screen.
Your program should do the following for each expression:

   (1) printing the expression before it is manipulated;
   (2) showing the converted postfix form expression;
   (3) showing the expression tree;
   (4) printing the fully parenthesized infix form expression;
   (5) reporting the value of the expression.


III. Operators

   The following operators are considered. They are listed in the
decreasing order of precedence.

   Token            Operator            Associativity

    !               logical not         right-to-left
    ^               exponentiation      right-to-left
    *  /  %         multiplicative      left-to-right
    +  -            additive            left-to-right
    <  <=  >  >=    relational          left-to-right
    ==  !=          equality            left-to-right
    &&              logical and         left-to-right
    ||              logical or          left-to-right


IV. Other Requirements

   Since a large amount of information are to be displayed on the
screen, it is mandatory for your program to provide users a prompting
message such as

          Press <Enter> to continue ...

after each expression is processed, so that users have the chance to
check the output of your program carefully.


V. Algorithm: Infix_to_postfix conversion

  Input:  An infix form expression E = t1 t2 t3 ... $,
          which is a sequence of tokens.
  Output: The postfix form expression of E.

  Algorithm: 
  {
    do {
      get the next token t;
      case (t) {
         operand: place t onto the output;
                  break;
        operator: while (stack s is not empty
                    && stacktop(s) is not a left parenthesis)
                    && precedence(stacktop(s)) >= precedence(t)
                       // assuming left-to-right associativity, 
                       // not for the exponentiation operator ^, 
                       // which has right-to-left associativity 
                  {
                        pop(x,s);
                        place x onto the output;
                  }
                  push(t,s);
                  break;
               (: push(t,s);
                  break;
               ): while (stacktop(s) is not a left parenthesis) {
                      pop(x,s);
                      place x onto the output;
                  }
                  pop(x,s);
                  break;
        end mark: while (stack s is not empty) {
                      pop(x,s);
                      place x onto the output;
                  }
                  place the end mark onto the output;
                  break;
      }
    } while (t is not the end mark);
  }

This below is "in.dat file"

12 * 23 <= ( ( ( 3456 ) ) +    ( 6789 ) ) $ 1
4 ^ 3 - ( 2 + 4 * 15 ) - ( 90 / 3 != 30 ) $ 2
! ( 222 < 111 ) + 2 * 3 ^ ( 29 - 3 * 9 ) > 18 && 1234 == 1234 $ 1
( 2 * ( 62 % 5 ) ) ^ ( ( 4 - 2 ) ) - 2 ^ 2 ^ 2 $ 0
( ( 9 / ( 5 - 2 ) + 2 ) * ( 2 ^ 2 * 2 ) - 79 ) || ! ( 65432 > 54321 ) $ 1
( ( 9999 >= 8888 ) + 2 ) * ( 4 / ( 999 - 997 ) ) - 2 ^ ( 5 - 3 ) $ 2

This question need to be solved using java coading :-

I. Input

   All input data are from a file "in.dat". The file contains a
sequence of infix form expressions, one per line. The character '$' 
is an end mark. For example, the following file has four infix form 
expressions:

   1 + 2 * 3 ^ ! ( 4 == 5 ) $
   3 * ( 6 - 4 * 5 + 1) + 2 ^ 2 ^ 3 $
   77 > ( 2 - 1 ) + 80 / 4 $
   ! ( 2 + 3 * 4 >= 10 % 6 ) && 20 != 30 || 45 / 5 == 3 * 3 $

Each expression is a sequence of tokens (i.e., constant integers,
operators, and end mark) separated by spaces. There is no variable.


II. Output

   Output data and related information are sent to the screen.
Your program should do the following for each expression:

   (1) printing the expression before it is manipulated;
   (2) showing the converted postfix form expression;
   (3) showing the expression tree;
   (4) printing the fully parenthesized infix form expression;
   (5) reporting the value of the expression.


III. Operators

   The following operators are considered. They are listed in the
decreasing order of precedence.

   Token            Operator            Associativity

    !               logical not         right-to-left
    ^               exponentiation      right-to-left
    *  /  %         multiplicative      left-to-right
    +  -            additive            left-to-right
    <  <=  >  >=    relational          left-to-right
    ==  !=          equality            left-to-right
    &&              logical and         left-to-right
    ||              logical or          left-to-right


IV. Other Requirements

   Since a large amount of information are to be displayed on the
screen, it is mandatory for your program to provide users a prompting
message such as

          Press <Enter> to continue ...

after each expression is processed, so that users have the chance to
check the output of your program carefully.


V. Algorithm: Infix_to_postfix conversion

  Input:  An infix form expression E = t1 t2 t3 ... $,
          which is a sequence of tokens.
  Output: The postfix form expression of E.

  Algorithm: 
  {
    do {
      get the next token t;
      case (t) {
         operand: place t onto the output;
                  break;
        operator: while (stack s is not empty
                    && stacktop(s) is not a left parenthesis)
                    && precedence(stacktop(s)) >= precedence(t)
                       // assuming left-to-right associativity, 
                       // not for the exponentiation operator ^, 
                       // which has right-to-left associativity 
                  {
                        pop(x,s);
                        place x onto the output;
                  }
                  push(t,s);
                  break;
               (: push(t,s);
                  break;
               ): while (stacktop(s) is not a left parenthesis) {
                      pop(x,s);
                      place x onto the output;
                  }
                  pop(x,s);
                  break;
        end mark: while (stack s is not empty) {
                      pop(x,s);
                      place x onto the output;
                  }
                  place the end mark onto the output;
                  break;
      }
    } while (t is not the end mark);
  }

This below is "in.dat file"

12 * 23 <= ( ( ( 3456 ) ) +    ( 6789 ) ) $ 1
4 ^ 3 - ( 2 + 4 * 15 ) - ( 90 / 3 != 30 ) $ 2
! ( 222 < 111 ) + 2 * 3 ^ ( 29 - 3 * 9 ) > 18 && 1234 == 1234 $ 1
( 2 * ( 62 % 5 ) ) ^ ( ( 4 - 2 ) ) - 2 ^ 2 ^ 2 $ 0
( ( 9 / ( 5 - 2 ) + 2 ) * ( 2 ^ 2 * 2 ) - 79 ) || ! ( 65432 > 54321 ) $ 1
( ( 9999 >= 8888 ) + 2 ) * ( 4 / ( 999 - 997 ) ) - 2 ^ ( 5 - 3 ) $ 2

Sketch the graph of the function ?(?)= (2x²-5x+2)/(x+1)², given the derivatives:

? ′(?) = (9?−9)/(?+1)³ and ? ′′(?) = (36?−18)/(?+1)⁴

Your sketch should consider the following:
● x- and y-intercepts, if any.
● Horizontal and vertical asymptotes, if any. (Show the computation of any relevant

limit.)
● Intervals over which ?(?) is increasing/decreasing.
● Intervals over which ?(?) is concave up/down.
● Relative (local) maximum/minimum points and points of inflection, if any. Identify

these clearly on the sketch.

(a) . Use generating function to solve hn= 8hn-1 -16hn-2 , h0=-2 , h1=1

(b). Find orthogonal basis for null space of , [ 2 1 2 3 : 3 2 3 6 ]

Solve both of them or do not solve

1. Find absolute max and min of     f(x,y)= x^2- xy + y^2 +1 on the closed triangular plate in the first quadrant x=0, y=4, y=x

2. Given position of a particle by π (t)= Cos2ti + 3 sin2ti,         Find the particle velocity and acceleration at t=0

1)In a tow dimensional plane draw a graph of y=3x-1 and y=2x^2.

2)Find the roots of the equation 2x^2 -3x+1=0

3)If function f(x)=2x^2-3x+1, what the value of x where f(x) reaches its minimum?

1. For the stem-and-leaf plot below,

A) 10, 21, 27, 34, 49a) Find the five-number summary (Circle the correct answer)

      B) 10, 21.5, 28, 35, 49

      C) 10, 21, 27, 35, 49

      D) 10, 21.5, 28, 36, 49                        

b) Find the interquartile range (IQR) (Circle the correct answer)

       A) 13 B) 13.5 C) 14 D) 14.5

c) What are the smallest and largest values that would not be considered an outlier? (Circle the correct answer)

       A) 15 and 90 B) 10 and 49 C) 16 and 49 D) There are no outliers

WACC = 8% Period Project 1 Project 2 0 -$175 -$43 1 $75 $30 2 $75 $90 3 $150 4 5 6 Based on the information in the table, what is the replacement chain NPV for Project 1?