Questions
A 4-cylinder ammonia compressor with a bore 0.04 m & stroke 0.03 m running 2500. The...

A 4-cylinder ammonia compressor with a bore 0.04 m & stroke 0.03 m running 2500. The system operates in a simple VCC with evaporating & condensing temperatures zero C & 40 C, respectively generating cooling capacity 5 tons.
Determine:
a. Draw the PH diagram indicating all enthalpies & sp. vol.
b. Piston displacement, m3/sec
c. Suction Volume, m3/sec
d. Volumetric efficiency
e. Mass of refrigerant, kg/sec
f. Work of compressor, kW

In: Mechanical Engineering

The chemical formulae of some acids are listed in the first column of the table below,...

The chemical formulae of some acids are listed in the first column of the table below, and in the second column it says whether each acid is strong or weak. Complete the table. List the chemical formula of each species present at concentrations greater than about 10^ -6 mol/L when about a tenth of a mole of the acid os dissolved in a liter of water.

                          * Weak or Strong?           *Species present at 10^ -6 mol/L or greater when dissolved in water.

HBrO3

H2SO3

HClO2

HBr

In: Chemistry

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

In: Computer Science

Johnny’s Lunches is considering purchasing a new, energy-efficient grill. The grill will cost $38,000 and will...

Johnny’s Lunches is considering purchasing a new, energy-efficient grill. The grill will cost $38,000 and will be depreciated according to the 3-year MACRS schedule. It will be sold for scrap metal after 3 years for $9,500. The grill will have no effect on revenues but will save Johnny’s $19,000 in energy expenses per year. The tax rate is 30%. Use the MACRS depreciation schedule.

a. What are the operating cash flows in each year? (Do not round intermediate calculations. Round your answers to 2 decimal places.)

b. What are the total cash flows in each year? (Do not round intermediate calculations. Round your answers to 2 decimal places.)

c. Assuming the discount rate is 12%, calculate the net present value (NPV) of the cash flow stream. Should the grill be purchased? (Do not round intermediate calculations. Round your answer to 2 decimal places.)

In: Finance

“Several versions of the FFQ exist, but they all use a similar technique: Ask people how...

“Several versions of the FFQ exist, but they all use a similar technique: Ask people how often they eat particular foods and what serving size they usually consume. But it’s not always easy to remember everything you ate, even what you ate yesterday. People are prone to underreport what they consume, and they may not fess up to eating certain foods or may miscalculate their serving sizes.”

“When I tried keeping a seven-day food diary, I discovered … it’s surprisingly difficult to capture a record that reflects normal eating patterns when you collect only a few days’ worth of data. It so happened that I was traveling to a conference during my diary week, so I ate packaged snacks and restaurant meals far different from the foods I usually eat from my garden at home. My diary showed that before dinner one day, I’d eaten only a doughnut and two snack packs of potato chips. And what did I have for dinner? I can tell you that it was a delicious Indonesian seafood curry, but I couldn’t possibly begin to list all its ingredients.”

When asked to report their behavior, people may not have access to the information (forget or never knew it) or they may deliberately lie. Fill in the following blanks with either 'no access' or 'lie'

          1) “it’s not always easy to remember everything you ate”

                 A) no access

                 B) lie

           2) “People are prone to underreport what they consume”

                 A) no access

                 B) lie

         3) “they may not fess up to eating certain foods”

                 A) no access

                 B) lie

   4) "may miscalculate their serving sizes."

                 A) no access

                 B) lie

           5) “I can tell you that it was a delicious Indonesian seafood curry, but I couldn’t possibly begin to list all its ingredients.”

                 A) no access

                 B) lie

In: Psychology

Prove the second-order formula for the third derivative f′′′(x) = (f(x−3h)−6f(x−2h)+12f(x−h)−10f(x)+3f(x+h)) / 2h3

Prove the second-order formula for the third derivative

f′′′(x) = (f(x−3h)−6f(x−2h)+12f(x−h)−10f(x)+3f(x+h)) / 2h3

In: Advanced Math

Write a class named Palindrome.java and Write a method isPalindrome that takes an IntQueue as a...

Write a class named Palindrome.java and Write a method isPalindrome that takes an IntQueue as a parameter and that returns whether or not the numbers in the queue represent a palindrome (true if they do, false otherwise). A sequence of numbers is considered a palindrome if it is the same in reverse order. For example, suppose a Queue called q stores this sequence of values:

front [3, 8, 17, 9, 17, 8, 3] back

Then the following call:

isPalindrome(q) should return true because this sequence is the same in reverse order. If the list had instead stored these values:

front [3, 8, 17, 9, 4, 17, 8, 3] back

the call on isPalindrome would instead return false because this sequence is not the same in reverse order (the 9 and 4 in the middle don't match).

The empty queue should be considered a palindrome. You may not make any assumptions about how many elements are in the queue and your method must restore the queue so that it stores the same sequence of values after the call as it did before. The method header is specified as follows:

public static boolean isPalindrome(IntQueue q)


public class IntQueue{
Integer[] arr;
int numOfElements=0;
int front=0;
int rear=-1;

public IntQueue(int cap);

public void enqueue(Integer data);
public Integer dequeue();

public boolean isFull();

public boolean isEmpty();
}

methods document:

public class IntStack{
Integer[] arr;
int index=0;

public IntStack(int cap);

public void push(Integer data);
public Integer pop();
public Integer top();
public boolean isFull();

public boolean isEmpty();

}

are the available methods, and we do not have size() or length() which is how i have done these types of problems before.

In: Computer Science

Construct the confidence interval for the population mean muμ. cequals=0.980.98 , x overbar equals 9.1x=9.1 ,...

Construct the confidence interval for the population mean

muμ.

cequals=0.980.98 ,

x overbar equals 9.1x=9.1 ,

sigmaσequals=0.40.4 ,

and

nequals=4141

A 9898 % confidence interval for muμ is (___,___) (Round to two decimal places as needed.)

In: Math

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

In: Computer Science

What are three ways that HR managers can prevent sexual harassment in the workplace (List and...

What are three ways that HR managers can prevent sexual harassment in the workplace (List and provide an example)

In: Operations Management

What are the steps to be followed in building the Knowledge Management System in hotel.

What are the steps to be followed in building the Knowledge Management System in hotel.

In: Computer Science

y'' − 3y' + 2y =− x sin x STEP BY STEP CAREFULL INSTRUCTION.

y'' − 3y' + 2y =− x sin x

STEP BY STEP CAREFULL INSTRUCTION.

In: Advanced Math

Consider a sorting algorithm that combines merge sort and insertion sort algorithm. We still use divide...

Consider a sorting algorithm that combines merge sort and insertion sort algorithm. We still use divide and conquer like merge sort, however when the number of elements in an array is at most k elements (k is a parameter), we stop dividing the elements as the regular merge sort, instead, we call the insertion sort. Assuming we have defined the following two procedures:

insertion-sort(A[p..q]) which sort the subarray A[p..q]

merge(A[p,q,r]) which merges the sorted subarray A[p..r] and A[r+1..q]

  1. Try to write the pseudo code for this algorithm: given array A[p..q] and a parameter k as mentioned above

merge-insert(A[p..q], k)

  1. For an input array of size n, how many times will the insertion be called by the modified merge? In the worst case, what is the total time for these insertion sort?
  1. What is the running time of merge-insert in the worst case? Justify your answer?

In: Computer Science

Must be written in JAVA Code Write a program that takes a whole number input from...

Must be written in JAVA Code

Write a program that takes a whole number input from a user and determines whether it’s prime. If the number is not prime, display its unique prime factors. Remember that a prime number’s factors are only 1 and the prime number itself. Every number that’s not prime has a unique prime factorization. For example, consider the number 54. The prime factors of 54 are 2, 3, 3 and 3. When the values are multiplied together, the result is 54. For the number 54, the prime factors output should be 2 and 3. Use Sets as part of your solution.

In: Computer Science

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

represent -100 in 16-bit binary format and then convert it to Hexadecimal form.

In: Computer Science