The mayor of New York City would like to build a new facility for public drug treatment. The members of the committee in charge of the project have developed four factors of importance based on their primary concern (and given a weight of 5). The First factor is the capacity to accept a large number of patients; second, The annual lease; third, the confidentiality for patients; and the fourth the accessibility for healthcare workers.

Using the factor-rating method, which site will be preferred?

The preferred site:

Paste Corporation has established new plant for the production of new product called “Diazinon”. There are two different manufacturing methods available to produce Diazinon. Either by using a process or an order base method. The assembling technique won't influence the quality or deals of the item. The evaluated manufacturing expenses of the two strategies are as per the following:

                                                                              Process base       Order base

Variable manufacturing cost per unit..................... Rs14.00         Rs.17.60

Fixed manufacturing cost per year ......................Rs. 2,440,000 Rs. 1,320,000

The organization's statistical surveying office has suggested an initial selling cost of Rs.35 per unit for     Diazinon. The yearly fixed selling and admin costs of the Diazinon are Rs.500, 000. The variable selling and regulatory costs are Rs. 2 per unit.

Required:

1. CM ratio and variable expenses ratio. If Paste Corporation uses the:

1. Process base manufacturing method.

2. Order base manufacturing method.

   II.      Break-even point in units and amount by formula method. If Paste Corporation uses the:

                        1. Process base manufacturing method.

                        2. Order base manufacturing method.

3. Margin of safety. Assuming 250,000 units are actual sales for.

1. Process base manufacturing method.

2. Order base manufacturing method.

4. Degree or operating leverage at actual sales level for.

1. Process base manufacturing method.

2. Order base manufacturing method.

Margarite's Enterprises is considering a new project. The project will require $325,000 for new fixed assets, S160,000 for additional inventory and $ 35,000 for additional accounts receivable. Short term debt is expected to increase by $ 100,000 and long- term debt is expected to increase by $ 300,000. The project has a 5- year life. The fixed assets will be depreciated straight-line io a zero book value over the life of the project . At the end of the project , the fixed assets can be sold for 25% of their original cost. The net working capital returns to its original level at the end of the project . The project is expected to generate annual sales of $ 554,000 and costs of $ 430,000 . The tax rate is 35 % and the required rate of return is 15%.

A- What is the amount of the after-tax cash flow from the sale of the fixed assets at the end of this project?

B- What is the cash flow recovery from net working capital at the end of this project?

C- What is the annual OCF?

can you explain without excel specially C

XYZ corp. is considering investing in a new machine. The new machine cost will $10,000 installed. Depreciation expense will be $1000 per year for the next five years. At the end of the fifth year XYZ expects to sell the machine for $6000. XYZ will also sell its old equipment today that has a book value of $3000 for $3000. In five years, the old machine will be fully depreciated and have a salvage value of zero. Additionally, XYZ Corp expects that the new machine will increase its EBIT by $2000 in each of the next five years. Assuming that XYZ’s tax rate is 21% and the new machines WACC is 15%, what is the projects NPV. Round your final answer to two decimals.

NOTE: Answer is not $13,651.94 as someone else put that

XYZ corp. is considering investing in a new machine. The new machine cost will $10,000 installed. Depreciation expense will be $1000 per year for the next five years. At the end of the fifth year XYZ expects to sell the machine for $6000. XYZ will also sell its old equipment today that has a book value of $3000 for $3000. In five years, the old machine will be fully depreciated and have a salvage value of zero. Additionally, XYZ Corp expects that the new machine will increase its EBIT by $2000 in each of the next five years. Assuming that XYZ’s tax rate is 21% and the new machines WACC is 15%, what is the projects NPV. Round your final answer to two decimals.

Assign a new alphabet whenever it sees a new number in those expressions ( Use increment operator(++) so, lets say if x = "a", then x++ would be "b" and so on for as many numbers are there in expressions)

Assignment:Consider the input file “p4in.txt”has the following contents (in java language)
(Assuming that all expressions are correct): so using the valueStack ,uses ArrayStack and operatorStack

Specifications:

1) You must implement ArrayStack.java and modify Positfix.java so that valueStack uses ArrayStack and operatorStack uses LinkedStack.

2) Do this program step by step.

3) It may be easier to use String to split the expression to obtain the array of values.

4) Build your symbol table using single-letter variable name that starts from ‘a’.

Here is the inputfile (p4in.txt)
2 + 3
(2+ 3) * 4
2 * 3 / (4 -5)
2 / 3 + (4 -5)
2 / 3 + c -d
2 ^ 3 ^ 4
(2 ^ 3) ^ 4
2 * (3 / 4 + 5)
(2 + 3) / (4 -5)
2 / (3 -4) * 5
2 - (3 / (4 - 5) * 6 + 0) ^ 1
(2 - 3 * 4) / (5 * 6 ^ 0) * 1 + 8

I need to produce the output file named “p4out.txt” similar to the following:

Here is the output sample p4out.txt
Symbol Table
Variable     Value
a              2
b              3
c              4
d              5
e              6
f              0
g              1
h              8

Input                           Infix    Postfix   Result
2 + 3                           a+b       ab+       5
(2+ 3) * 4                      (a+b)*c   ab+c*    20
2 * 3 / (4 -5)                 all value Omitted downhere
2 / 3 + (4 -5)
2 / 3 + c -d
2 ^ 3 ^ 4
(2 ^ 3) ^ 4
2 * (3 / 4 + 5)
(2 + 3) / (4 -5)
2 / (3 -4) * 5
2 - (3 / (4 - 5) * 6 + 0) ^ 1
(2 - 3 * 4) / (5 * 6 ^ 0) * 1 + 8

Required programs:

ArrayStack.java:

import java.util.Arrays;
import java.util.EmptyStackException;
/**
    A class of stacks whose entries are stored in an array.
    @author Frank M. Carrano
    @author Timothy M. Henry
    @version 4.0
*/
public final class ArrayStack<T> implements StackInterface<T>
{
        private T[] stack;    // Array of stack entries
        private int topIndex; // Index of top entry
   private boolean initialized = false;
        private static final int DEFAULT_CAPACITY = 50;
        private static final int MAX_CAPACITY = 10000;
        
        public ArrayStack()
        {
      this(DEFAULT_CAPACITY);
        } // end default constructor
        
        public ArrayStack(int initialCapacity)
        {
      checkCapacity(initialCapacity);
      
      // The cast is safe because the new array contains null entries
      @SuppressWarnings("unchecked")
      T[] tempStack = (T[])new Object[initialCapacity];
      stack = tempStack;
                topIndex = -1;
      initialized = true;
        } // end constructor

        public void push(T newEntry)
        {
                checkInitialization();
                ensureCapacity();
                stack[topIndex + 1] = newEntry;
                topIndex++;
        } // end push

        public T peek()
        {
                checkInitialization();
                if (isEmpty())
                        throw new EmptyStackException();
                else
         return stack[topIndex];
        } // end peek

        public T pop()
        {
                checkInitialization();
                if (isEmpty())
                        throw new EmptyStackException();
                else
                {
                        T top = stack[topIndex];
                        stack[topIndex] = null;
                        topIndex--; 
         return top;
                } // end if
   } // end pop

   public boolean isEmpty()
        {
                return topIndex < 0;
        } // end isEmpty
        
        public void clear()
        {
                checkInitialization();
      
      // Remove references to the objects in the stack,
      // but do not deallocate the array
                while (topIndex > -1)
      {
                        stack[topIndex] = null;
         topIndex--;
      } // end while
      //        Assertion: topIndex is -1       
        } // end clear
   
   // Throws an exception if this object is not initialized.
   private void checkInitialization()
   {
      if (!initialized)
         throw new SecurityException ("ArrayStack object is not initialized properly.");
   } // end checkInitialization
   
   // Throws an exception if the client requests a capacity that is too large.
   private void checkCapacity(int capacity)
   {
      if (capacity > MAX_CAPACITY)
         throw new IllegalStateException("Attempt to create a stack " +
                                         "whose capacity exceeds " +
                                         "allowed maximum.");
   } // end checkCapacity
    
   // Doubles the size of the array stack if it is full
   // Precondition: checkInitialization has been called.
        private void ensureCapacity()
        {
           if (topIndex >= stack.length - 1) // If array is full, double its size
      {
         int newLength = 2 * stack.length;
         checkCapacity(newLength);
         stack = Arrays.copyOf(stack, newLength);
      } // end if
        } // end ensureCapacity
} // end ArrayStack

LinkedStack.java:

import java.util.EmptyStackException;
/**
   A class of stacks whose entries are stored in a chain of nodes.
   
   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.0
*/
public final class LinkedStack<T> implements StackInterface<T>
{
        private Node topNode; // References the first node in the chain
        
        public LinkedStack()
        {
                topNode = null;
        } // end default constructor
        
        public void push(T newEntry)
        {
      topNode = new Node(newEntry, topNode);
//              Node newNode = new Node(newEntry, topNode);
//              topNode = newNode;
        } // end push

        public T peek()
        {
                if (isEmpty())
                        throw new EmptyStackException();
                else
         return topNode.getData();
        } // end peek

        public T pop()
        {
           T top = peek();  // Might throw EmptyStackException
           assert (topNode != null);
      topNode = topNode.getNextNode(); 

           return top;
        } // end pop

/*
// Question 1, Chapter 6: Does not call peek 
        public T pop()
        {
      if (isEmpty())
         throw new EmptyStackException();
      else
                {
         assert (topNode != null);
                        top = topNode.getData();
                        topNode = topNode.getNextNode();
                } // end if
                
                return top;
        } // end pop
*/              

        public boolean isEmpty()
        {
                return topNode == null;
        } // end isEmpty
        
        public void clear()
        {
                topNode = null;  // Causes deallocation of nodes in the chain
        } // end clear

        private class Node
        {
      private T    data; // Entry in stack
      private Node next; // Link to next node

      private Node(T dataPortion)
      {
         this(dataPortion, null);
      } // end constructor

      private Node(T dataPortion, Node linkPortion)
      {
         data = dataPortion;
         next = linkPortion;    
      } // end constructor

      private T getData()
      {
         return data;
      } // end getData

      private void setData(T newData)
      {
         data = newData;
      } // end setData

      private Node getNextNode()
      {
         return next;
      } // end getNextNode

      private void setNextNode(Node nextNode)
      {
         next = nextNode;
      } // end setNextNode
        } // end Node
} // end LinkedStack

Postfix.java:

/**
   A class that represents a postfix expression.
   Based on pseudocode in Segments 5.16 and 5.18.

   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.0
*/
public class Postfix
{
   /** Creates a postfix expression that represents a given infix expression.
       Segment 5.16.
       @param infix  A string that is a valid infix expression.
       @return  A string that is the postfix expression equivalent to infix. */
   public static String convertToPostfix(String infix)
   {
      StackInterface<Character> operatorStack = new LinkedStack<Character>();
      StringBuilder postfix = new StringBuilder();
      int characterCount = infix.length();
      char topOperator;

      for (int index = 0; index < characterCount; index++)
      {
         boolean done = false;
         char nextCharacter = infix.charAt(index);

         if (isVariable(nextCharacter))
            postfix = postfix.append(nextCharacter);
         else
         {
            switch (nextCharacter)
            {
               case '^':
                  operatorStack.push(nextCharacter);
                  break;

               case '+': case '-': case '*': case '/':
                  while (!done && !operatorStack.isEmpty())
                  {
                     topOperator = operatorStack.peek();

                     if (getPrecedence(nextCharacter) <= getPrecedence(topOperator))
                     {
                        postfix = postfix.append(topOperator);
                        operatorStack.pop();
                     }
                     else
                        done = true;
                  } // end while

                  operatorStack.push(nextCharacter);
                  break;

               case '(':
                  operatorStack.push(nextCharacter);
               break;

               case ')': // Stack is not empty if infix expression is valid
                  topOperator = operatorStack.pop();
                  while (topOperator != '(')
                  {
                     postfix = postfix.append(topOperator);
                     topOperator = operatorStack.pop();
                  } // end while
                  break;

               default: break; // Ignore unexpected characters
            } // end switch
         } // end if
      } // end for

      while (!operatorStack.isEmpty())
      {
         topOperator = operatorStack.pop();
         postfix = postfix.append(topOperator);
      } // end while

      return postfix.toString();
   } // end convertToPostfix

   // Indicates the precedence of a given operator.
   // Precondition: operator is a character that is (, ), +, -, *, /, or ^.
   // Returns an integer that indicates the precedence of operator:
   //         0 if ( or ), 1 if + or -, 2 if * or /, 3 if ^,
   //         -1 if anything else. */
   private static int getPrecedence(char operator)
   {
      switch (operator)
      {
         case '(': case ')': return 0;
         case '+': case '-': return 1;
         case '*': case '/': return 2;
         case '^':           return 3;
      } // end switch

      return -1;
   } // end getPrecedence

   private static boolean isVariable(char character)
   {
      return Character.isLetter(character);
   } // end isVariable

   /** Evaluates a postfix expression.
       Segment 5.18
       @param postfix  a string that is a valid postfix expression.
       @return  the value of the postfix expression. */
   public static double evaluatePostfix(String postfix)
   {
      StackInterface<Double> valueStack = new LinkedStack<Double>();
      int characterCount = postfix.length();

      for (int index = 0; index < characterCount; index++)
      {
         char nextCharacter = postfix.charAt(index);

         switch(nextCharacter)
         {
            case 'a': case 'b': case 'c': case 'd': case 'e':
               valueStack.push(valueOf(nextCharacter));
               break;

            case '+': case '-': case '*': case '/': case '^':
               Double operandTwo = valueStack.pop();
               Double operandOne = valueStack.pop();
               Double result = compute(operandOne, operandTwo, nextCharacter);
               valueStack.push(result);
               break;

            default: break; // Ignore unexpected characters
         } // end switch
      } // end for

      return (valueStack.peek()).doubleValue();
   } // end evaluatePostfix

   private static double valueOf(char variable)
   {
      switch (variable)
      {
         case 'a': return 2.5;
         case 'b': return 3.0;
         case 'c': return 4.0;
         case 'd': return 12.0;
         case 'e': return 16.5;
      } // end switch

      return 0; // Unexpected character
   } // end valueOf

   private static Double compute(Double operandOne, Double operandTwo, char operator)
   {
      double result;

      switch (operator)
      {
         case '+':
            result = operandOne.doubleValue() + operandTwo.doubleValue();
            break;

         case '-':
            result = operandOne.doubleValue() - operandTwo.doubleValue();
            break;

         case '*':
            result = operandOne.doubleValue() * operandTwo.doubleValue();
             break;

         case '/':
            result = operandOne.doubleValue() / operandTwo.doubleValue();
            break;

         case '^':
            result = Math.pow(operandOne.doubleValue(), operandTwo.doubleValue());
            break;

         default:    // Unexpected character
            result = 0;
            break;
      } // end switch

      return result;
   } // end compute
} // end Postfix

StackInterface.java:

/**
   An interface for the ADT stack.
   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.0
*/
public interface StackInterface<T>
{
   /** Adds a new entry to the top of this stack.
       @param newEntry  An object to be added to the stack. */
   public void push(T newEntry);
  
   /** Removes and returns this stack's top entry.
       @return  The object at the top of the stack. 
       @throws  EmptyStackException if the stack is empty before the operation. */
   public T pop();
  
   /** Retrieves this stack's top entry.
       @return  The object at the top of the stack.
       @throws  EmptyStackException if the stack is empty. */
   public T peek();
  
   /** Detects whether this stack is empty.
       @return  True if the stack is empty. */
   public boolean isEmpty();
  
   /** Removes all entries from this stack. */
   public void clear();
} // end StackInterface

Driver.java:

/**
   A driver that demonstrates the class Postfix.
   
   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.1
*/
public class Driver
{
        public static void main(String[] args) 
        {
                System.out.println("Testing postfix expressions with\n" +
                                   "a = 2, b = 3, c = 4, d = 5, e = 6\n\n");

                testPostfix("a+b");
                testPostfix("(a + b) * c");
                testPostfix("a * b / (c - d)");
                testPostfix("a / b + (c - d)");
                testPostfix("a / b + c - d");
                testPostfix("a^b^c");
                testPostfix("(a^b)^c");
                testPostfix("a*(b/c+d)");

                System.out.println("Testing Question 6, Chapter 5:\n");
                testPostfix("(a+b)/(c-d)");         // Question 6a, Chapter 5
                testPostfix("a/(b-c)*d");           // Question 6b
                testPostfix("a-(b/(c-d)*e+f)^g");   // Question 6c
                testPostfix("(a-b*c)/(d*e^f*g+h)"); // Question 6d

                System.out.println("Testing Question 7, Chapter 5:\n");
                System.out.println("Q7a: ae+bd-/ : "   + Postfix.evaluatePostfix("ae+bd-/") + "\n");
                System.out.println("Q7b: abc*d*- : "   + Postfix.evaluatePostfix("abc*d*-") + "\n");
                System.out.println("Q7c: abc-/d* : "   + Postfix.evaluatePostfix("abc-/d*") + "\n");
                System.out.println("Q7d: ebca^*+d- : " + Postfix.evaluatePostfix("ebca^*+d-") + "\n");
                System.out.println("\n\nDone.");
        }  // end main
        
        public static void testPostfix(String infixExpression)
        {
                System.out.println("Infix:   " + infixExpression);
                String postfixExpression =  Postfix.convertToPostfix(infixExpression);
                System.out.println("Postfix: " + postfixExpression);
                System.out.println("\n");
        } // end testPostfix 
}  // end Driver

/*
 Testing postfix expressions with
 a = 2, b = 3, c = 4, d = 5, e = 6
 
 
 Infix:   a+b
 Postfix: ab+
 
 
 Infix:   (a + b) * c
 Postfix: ab+c*
 
 
 Infix:   a * b / (c - d)
 Postfix: ab*cd-/
 
 
 Infix:   a / b + (c - d)
 Postfix: ab/cd-+
 
 
 Infix:   a / b + c - d
 Postfix: ab/c+d-
 
 
 Infix:   a^b^c
 Postfix: abc^^
 
 
 Infix:   (a^b)^c
 Postfix: ab^c^
 
 
 Infix:   a*(b/c+d)
 Postfix: abc/d+*
 
 
 Testing Question 6, Chapter 5:
 
 Infix:   (a+b)/(c-d)
 Postfix: ab+cd-/
 
 
 Infix:   a/(b-c)*d
 Postfix: abc-/d*
 
 
 Infix:   a-(b/(c-d)*e+f)^g
 Postfix: abcd-/e*f+g^-
 
 
 Infix:   (a-b*c)/(d*e^f*g+h)
 Postfix: abc*-def^*g*h+/
 
 
 Testing Question 7, Chapter 5:
 
 Q7a: ae+bd-/ : -4.0
 
 Q7b: abc*d*- : -58.0
 
 Q7c: abc-/d* : -10.0
 
 Q7d: ebca^*+d- : 49.0
 
 
 
 Done.
 */

1) We are creating a new card game with a new deck. Unlike the normal deck that has 13 ranks (Ace through King) and 4 Suits (hearts, diamonds, spades, and clubs), our deck will be made up of the following.

Each card will have:
i) One rank from 1 to 16.
ii) One of 5 different suits.

Hence, there are 80 cards in the deck with 16 ranks for each of the 5 different suits, and none of the cards will be face cards! So, a card rank 11 would just have an 11 on it. Hence, there is no discussion of "royal" anything since there won't be any cards that are "royalty" like King or Queen, and no face cards!

The game is played by dealing each player 5 cards from the deck. Our goal is to determine which hands would beat other hands using probability. Obviously the hands that are harder to get (i.e. are more rare) should beat hands that are easier to get. a) How many different ways are there to get any 5 card hand?
The number of ways of getting any 5 card hand is
DO NOT USE ANY COMMAS

b)How many different ways are there to get exactly 1 pair (i.e. 2 cards with the same rank)?
The number of ways of getting exactly 1 pair is
DO NOT USE ANY COMMAS

What is the probability of being dealt exactly 1 pair?
Round your answer to 7 decimal places.


c) How many different ways are there to get exactly 2 pair (i.e. 2 different sets of 2 cards with the same rank)?
The number of ways of getting exactly 2 pair is
DO NOT USE ANY COMMAS

What is the probability of being dealt exactly 2 pair?
Round your answer to 7 decimal places.


d) How many different ways are there to get exactly 3 of a kind (i.e. 3 cards with the same rank)?
The number of ways of getting exactly 3 of a kind is
DO NOT USE ANY COMMAS

What is the probability of being dealt exactly 3 of a kind?
Round your answer to 7 decimal places.


e) How many different ways are there to get exactly 4 of a kind (i.e. 4 cards with the same rank)?
The number of ways of getting exactly 4 of a kind is
DO NOT USE ANY COMMAS

What is the probability of being dealt exactly 4 of a kind?
Round your answer to 7 decimal places.


f) How many different ways are there to get exactly 5 of a kind (i.e. 5 cards with the same rank)?
The number of ways of getting exactly 5 of a kind is
DO NOT USE ANY COMMAS

Your firm is considering a project to produce new whatchamacallits. The project will require new equipment at a cost of $150,000. Shipping and installation will be $25,000 and initial training required before the project starts will cost $20,000. The equipment will be depreciated on a straight- line basis to a book value of $15,000 over the project’s three year life. At the end of the project, the equipment will be sold for $10,000.

Initially, the project requires an increase in inventory of $5,000, an increase in Accounts Payable of $3,000, and an increase in Accounts Receivable of $8,000. Changes in working capital will be recouped at the end of the project.

The whatchamacallits will be sold for $10 each. The project would require variable costs of 20% of sales, annual fixed costs of $21,000, and annual recertification training at a cost of $5,000.

The tax rate is 35% and the cost of capital is 12%. Assuming that the operating cash flows will be constant over the project’s life, calculate the financial break-even level of annual sales.

The Dunder Muffin Company is considering purchasing a new commercial oven that costs $350,000. This new oven will produce cash inflows of $115,000 at the end of Years 1 through 10. In addition to the cash inflows, at the end of Year 5 there will be a net cash outflow of $200,00. The company has a weighted average cost of capital of 12.5 percent. What is the MIRR of the investment? Would you make the investment? Why or Why not? Note that we discounted the project's negative cash flows back to the present using the project's required rate of return and then computed the MIRR from the modified cash flows. The MIRR of the investment with a discount rate of 12.5% is.