To synthesize 2-methylpentane from acetylene the necessary sequence of reactions is:

A. 1. NaNH2   2. (CH3)2CHCH2Br 3. H2O/H2SO4 4. RCO3H   5. NaOH 6. PBr3    7. H2/Pd-C 8. SOCl2    9. (CH3)3CO-K+  10. H2/Lindlar

B. 1. NaNH2   2. (CH3)2CHCH2Br   3. RCO3H 4. H2/Pd-C 5. H2SO4 /heat 6. LiAlH4  7. DBU  8. NaH/DMSO  

C. 1. NaNH2    2. (CH3)2CHCH2Br 3. Br2   4. NaNH2 (xs) 5. H2/Lindlar 6. H2O/H2SO4  7. BH3  8. H2O2/NaOH  9. H2/Pd-C  

D. 1. NaNH2   2. (CH3)2CHCH2Br 3. H2/Lindlar 4. H2O/H2SO4   5. H2SO4 /heat    6. RCO3H    7. LiAlH4 8. PBr3    9. DBN 10. H2/Pd-C

E. 1. NaNH2   2. (CH3)2CHCH2Br 3. H2/Lindlar 4. H2O/H2SO4 5. PCC   6. NaBH4 7. POCl3 8. RCO3H 9. LiAlH4 10. (CH3)3CO-K 11. H2SO4 /heat 12. H2/Pd-C

Arnold Ziffel has $20 per week to spend on any combination of pineapples and green tea. The price of a pineapple is $4 and the price of a bottle of green tea is $2. The table below shows Arnie's utility values. Complete the table and use the table to answer the questions.

1. Suppose Arnold purchases 4 pineapples and 2 bottles of green tea. Is he consuming the optimal consumption bundle? If so, explain why. If not, what combination should he buy and why?

The Mardova Clinic purchased a new surgical laser for $72,000 on January 1, 2020. The estimated salvage value is $8,000. The laser has a useful life of four years and the clinic expects to use it 8,000 hours. It was used 2,600 hours in year 1; 2,400 hours in year 2; 2,200 hours in year 3; and 2,000 hours in year 4.

Compute the annual depreciation expense, accumulated depreciation, and book value for each of the four years under each of the following four methods and answer the questions in the response template below:

A) Straight-line  

B) Units of Activity  

C) 150% Declining Balance

D) Sum of the Years Digits

A) Straight-line  

1) Year 1 - Depreciation expense $

2) Year 2 - Accumulated depreciation $

3) Year 3 - Book value $

4) Year 4 - Depreciation expense $

B) Units of Activity  

5) Year 1 - Depreciation expense $

6) Year 2 - Accumulated depreciation $

7) Year 3 - Book value $

8) Year 4 - Depreciation expense $

C) 150% Declining Balance

9) Year 1 - Depreciation expense $

10) Year 2 - Accumulated depreciation $

11) Year 3 - Book value $

12) Year 4 - Depreciation expense $

D) Sum of the Years Digits

13) Year 1 - Depreciation expense $

14) Year 2 - Accumulated depreciation $

15) Year 3 - Book value $

16) Year 4 - Depreciation expense $

The Mardova Clinic purchased a new surgical laser for $72,000 on January 1, 2020. The estimated salvage value is $8,000. The laser has a useful life of four years and the clinic expects to use it 8,000 hours. It was used 2,600 hours in year 1; 2,400 hours in year 2; 2,200 hours in year 3; and 2,000 hours in year 4.

Compute the annual depreciation expense, accumulated depreciation, and book value for each of the four years under each of the following four methods and answer the questions in the response template below:

A) Straight-line  

B) Units of Activity  

C) 150% Declining Balance

D) Sum of the Years Digits

A) Straight-line  

1) Year 1 - Depreciation expense $

2) Year 2 - Accumulated depreciation $

3) Year 3 - Book value $

4) Year 4 - Depreciation expense $

B) Units of Activity  

5) Year 1 - Depreciation expense $

6) Year 2 - Accumulated depreciation $

7) Year 3 - Book value $

8) Year 4 - Depreciation expense $

C) 150% Declining Balance

9) Year 1 - Depreciation expense $

10) Year 2 - Accumulated depreciation $

11) Year 3 - Book value $

12) Year 4 - Depreciation expense $

D) Sum of the Years Digits

13) Year 1 - Depreciation expense $

14) Year 2 - Accumulated depreciation $

15) Year 3 - Book value $

16) Year 4 - Depreciation expense $

Maximum

Lili is a greedy girl. She has N box, each box contains a coin. She want to get as many coin values as possible, but she must only choose 2 boxes. However, she is bad at mathematics and asked you to help her determine what is the correct answer.

Format Input:

Input starts with an integer T, describing the number of test cases. Each test case starts with an integer N, the number of boxes that Lili has. The next line will contain N numbers Vi , each of them describe the value of the coin in the i-th box. It is guaranteed that the value will always be between -1000000 and 1000000.

Format Output:

For each test case, output a single line consisting of ”Case #X: Y” where X is the test case number and Y is the maximum value Lili can get by choosing exactly 2 boxes.

Constraints

• 1 ≤ T ≤ 10

• 2 ≤ N ≤ 1, 000, 000

• −1, 000, 000 ≤ Vi ≤ 1, 000, 000

Sample Input (standard input):

3

5

1 2 3 4 5

4

4 4 4 4

3

10 1 2

Sample Output (standard output):

Case #1: 9

Case #2: 8

Case #3: 12

note : use c language, integer must be the same as the constraint, font use void/result code it under int main (){

Calculate the Big-O time complexity. Show work

1. n^2 + 3n + 2

2. (n^2 + n)(n ^2 + π/2 )

3. 1 + 2 + 3 + · · · + n − 1 + n

In this assignment, we will explore some simple expressions and evaluate them. We will use an unconventional approach and severely limit the expressions. The focus will be on operator precedence.

The only operators we support are logical or (|), logical and (&), less than (<), equal to (=), greater than (>), add (+), subtract (-), multiply (*) and divide (/). Each has a precedence level from 1 to 5 where higher precedence operators are evaluated first, from left-to-right. For example, "1 + 2 * 3" is 1+6 = 7. It is NOT 3*3 = 9.

To evaluate an expression like "8 - 2*2 - 3" we first split it into two parts: "8 - 2*2" and "3". We recursively evaluate "8 - 2*2" = 4 and "3" = 3. We subtract to get 4-3 = 1. Note that we look for the operators from right to left so they get evaluated from left to right (as shown in this example).

When we recursively evaluate "8 - 2*2" we split it into "8" = 8 and "2*2" = 4 so it returns 8-4 = 4.

Don't worry about errors like divide-by-zero, overflow, etc. All operators and numbers are exactly one character long. No unary operators like negation (-) or not (!) and no parentheses are allowed.

You are not permitted to make substantive changes to the existing code. You should only modify the two TBD blocks.

Here is some sample output (you are not given the debug statements with ***):

Value of 4 is 4 as expected

Value of 9+8 is 17 as expected

*** Value of 4 * 5 is 20

Value of 3 + 4 * 5 is 23 as expected

*** Value of 9 - 2 is 7

Value of 9 - 2 - 1 is 6 as expected

*** Value of 3=4 is 0

*** Value of 5<6 is 1

*** Value of 7<8 is 1

*** Value of 5<6 & 7<8 is 1

Value of 3=4 | 5<6 & 7<8 is 1 as expected

*** Value of 3 * 6 is 18

Value of 2 + 3 * 6 is 20

Value of 8/4 is 2

Value of 3=4 is 0

Value of BOB + 5 is an Error

Hint #1: chars in C are the same as ints. '0' equals 48, etc.

Hint #2: sc is the starting char, 0 is first. ec is ending char plus 1. Given "1+3" sc=2 ec=3 is just "3".

// gcc -Wall eval.c -o /tmp/eval
// /tmp/eval "2 + 3 * 6" "8/4" "3=4" "BOB + 5"
// prints:    20          2     0     Error

#include <stdio.h>
#include <string.h>

// Not really very good to have a special number for errors
#define ERR 102413

static double orFn(double x, double y) {
  return (x != 0 || y != 0 ? 1 : 0);
}

static double andFn(double x, double y) {
  return (x != 0 && y != 0 ? 1 : 0);
}

static double ltFn(double x, double y) {
  return (x < y ? 1 : 0);
}

static double eqFn(double x, double y) {
  return (x == y ? 1 : 0);
}

static double gtFn(double x, double y) {
  return (x > y ? 1 : 0);
}

static double multFn(double x, double y) {
  return x * y;
}

static double divFn(double x, double y) {
  return x / y;
}

static double addFn(double x, double y) {
  return x + y;
}

static double subFn(double x, double y) {
  return x - y;
}

typedef struct OPER {
  char oper;
  int precedence;
  double (*func) (double x, double y);
} oper_t;

static oper_t operators[] = {
  {'|', 1, orFn},
  {'&', 2, andFn},
  {'<', 3, ltFn},
  {'=', 3, eqFn},
  {'>', 3, gtFn},
  {'+', 4, addFn},
  {'-', 4, subFn},
  {'*', 5, multFn},
  {'/', 5, divFn}
};
static int numOpers = sizeof(operators) / sizeof(oper_t);       // numOpers is 9

// Careful, this is recursive
static double eval(char *expr, int sc, int ec) {
  int level;
  int i;
  int op;
  
  // Trim spaces (don't worry about errors here)
  while(expr[sc] == ' ') sc++;
  while(expr[ec-1] == ' ') ec--;

  // If just one character, must be a number
  if (sc == ec - 1) {
    char ch = expr[sc];
    // TBD -- if ch is '0' to '9', convert it to a number and return it
    return ERR;
  }
  
  // Must be of the form: left oper right
  for (level = 1; level <= 5; level++) {
    for (op = 0; op < numOpers; op++) {
      // TBD -- if the operator[op] has the right precedence AND
      // TBD -- if we can find operator[op].oper in the substring RIGHT to LEFT
      // TBD -- then recursively call eval() with left then right of the operator[op].oper
      // TBD -- and then if left or right returned ERR, return ERR
      // TBD -- otherwise return operators[op].func(left, right)
    }
  }
  return ERR;
}

static void check(char *expr, double expected) {
  double result = eval(expr, 0, strlen(expr));
  if (result == expected) {
    printf("Value of %s is %g as expected\n\n", expr, result);
  } else {
    printf("Value of %s is %g instead of expected %g\n\n", expr, result, expected);
  }
}

int main(int argc, char *argv[]) {
  int i;
  
  // Recommend getting these to work one at a time
  check(" 4 ", 4);
  check("9+8", 17);
  check(" 3 + 4 * 5 ", 23);
  check(" 9 - 2 - 1", 6);
  check("3=4 | 5<6 & 7<8", 1);

  for (i = 1; i < argc; i++) {
    char *expr = argv[i];
    double result = eval(expr, 0, strlen(expr));
    if (result == ERR) {
      printf("Value of %s is an Error\n\n", expr);
    } else {
      printf("Value of %s is %g\n\n", expr, result);
    }
  }
}

Depreciation by Three Methods; Partial Years

Perdue Company purchased equipment on April 1 for $93,420. The equipment was expected to have a useful life of three years, or 7,560 operating hours, and a residual value of $2,700. The equipment was used for 1,400 hours during Year 1, 2,600 hours in Year 2, 2,300 hours in Year 3, and 1,260 hours in Year 4.

Required:

Determine the amount of depreciation expense for the years ended December 31, Year 1, Year 2, Year 3, and Year 4, by (a) the straight-line method, (b) units-of-output method, and (c) the double-declining-balance method.

Note: FOR DECLINING BALANCE ONLY, round the multiplier to four decimal places. Then round the answer for each year to the nearest whole dollar.

a. Straight-line method

b. Units-of-output method

c. Double-declining-balance method

Show that the worst-case and average-case time complexities for the number of assignments of records performed by the Exchange Sort algorithm (Algorithm 1.3) are given by

          W(n) = 3n(n-1)/2 ≈ n²/2 and A(n) = 3n(n-1)/4 ≈ n²/4