****C language****

char lName[][15] = {"Brum","Carroll","Carter","Dodson","Garbus", "Greenwood", "Hilliard", "Lee", "Mann", "Notz", "Pastrana", "Rhon", "Rodriguez", "Wilson", "Zimmerman"};

char fName [][15] = {"Natalie","Cody","Sophia","Dominic","Chandler","Caleb","Sydnee","Peyton","Brianna","Zachery","Kevin","Luke","Juan","Kelci","Adam"};

char middleInitial[15]={'N','L','X','L','O','L','M','B','S','T','J','C','P','D','Z'};

char dob[][11]={"05/27/1935","11/27/1971","10/17/2003","12/08/1990","11/25/1991","10/30/1992","09/22/1993","08/04/1994","07/11/1995","06/18/1996","05/28/1997","04/07/1998","03/12/1999","02/23/2000","01/15/2001"};

How would we make a list ordered by their age, oldest first, Print the patient's full name and then their age.  Left justify the name and right justify the age.

Example:
Johnson, Fred N 80

**Half of the code is provided**

int patientAge[15] = {0};

for(int p = 0; p <15; p++)
{
int year = ((dob[p][6] - '0') * 1000) + ((dob[p][7] - '0') *100) + ((dob[p][8] - '0') * 10) + ((dob[p][9] - '0') * 1);

patientAge[p] = 2019 - year;
printf("%s, %s %c Age: %d\n",lName[p], fName[p], middleInitial[p], patientAge[p]);
}

We want to compute Cyclic Redundancy Check (CRC) for the given the data bits D=110001, generator G=1001, and 3 CRC bits (i.e., r=3),.

Explain the algorithm and implement the CRC computation in a programming language (e.g., C, C++, and Python) with the above setting.

Write 1-2 Pages

A properly formatted memorandum that describes a current problem within Database Admission field and presents a possible solution or solutions to the problem.

How would I obtain a random sample of participants when doing research on video games and aggression?

Thermophilic bacterium can convert glucose (C6H12O6) to ethanol and acetic acid .

1) Calculate the reaction enthalpy ΔrH when 1 mol of glucose is oxidized to ethanol at 80∘C.
C6H12O6(s)→2C2H5OH(l)+2CO2(g)

2) Calculate the reaction enthalpy ΔrH when 1 mol of glucose is oxidized to acetic acid at 80∘C.
2O2(g)+C6H12O6(s)→2CH3COOH(l)+2CO2(g)+2H2O(l)

Assume Highline Company has just paid an annual dividend of $ 0.92. Analysts are predicting an 10.3 % per year growth rate in earnings over the next five years. After​ then, Highline's earnings are expected to grow at the current industry average of 5.3 % per year. If​ Highline's equity cost of capital is 9.1 % per year and its dividend payout ratio remains​ constant, for what price does the​ dividend-discount model predict Highline stock should​ sell?

*** C language ***

Make a  list of all of the different zip codes that the zombies live at and a count of how many
zombies live at that zip code. The list should be sorted based on the zip code with the
smallest zip code printed first. Example:
Zip Code # Zombies

31234 2

//variables

int zip[] = {37643,31234,32785,32643,32785,32643,31234,31234,32643,32643,31234,32785,32785,32643,31234};

char zombie[]={'N','Y','Y','N','Y','Y','Y','N','Y','Y','N','Y','Y','Y','Y'};

Y = zombie N = Not zombie

int zPatient = 0;
int nonZpatient = 0;
for(int pt = 0; pt < (*(&zombie + 1) - zombie); pt++)
{
if(zombie[pt] == 'N')
{
nonZpatient++;
}
else if (zombie[pt] == 'Y')
{
zPatient++;
}
}

Australian corporate bonds can now be issued with the same prospectus as for previous issues, simplifying the process.

As a result, the corporate bonds' yield __________ while the stock of bonds in the financial system ___________.

Read “The Global Cost of Electronic Waste” and discuss the dark side of technology from e-waste to the loss of jobs. Identify and expand on one issue that you found most troubling.

What are the strengths and weaknesses of the REA Model when compared to a commercial system?

Questions 1a and 1b are about the linear search algorithm that was discussed in the lectures.

1a. Write a Java method called stringyLinear that performs linear search on an array of String’s, so it is defined as follows. Your code appears in place of the three dots ‘‘⋅⋅⋅’’. Do not write a class, only a method.

If a String equal to key appears in keys, then stringyLinear must return an index in keys where it appears. If no String equal to key appears in keys, then stringyLinear must return −1. Assume that no element of keys is null, and that key is not null.

1b. Suppose that a linear search method is given an array whose length is n, where n ≥ 1. Show that the algorithm performs O(n) key comparisons in the average case. For full credit, you must do this by finding constants c and n₀.

Nonconstant growth: Tre-Bien, Inc., is a fast-growing technology company. Management projects rapid growth of 30 percent for the next two years, then a growth rate of 17 percent for the following two years. After that, a constant-growth rate of 8 percent is expected. The firm expects to pay its first dividend of $2.45 a year from now. If dividends will grow at the same rate as the firm and the required rate of return on stocks with similar risk is 22 percent, what is the current value of the stock?

Nonconstant growth: Management of ProCor, a biotech firm, forecasted the following growth rates for the next three years: 35 percent, 28 percent, and 22 percent. Management then expects the company to grow at a constant rate of 9 percent forever. The company paid a dividend of $1.75 last week. If the required rate of return is 20 percent, what is the value of this stock?

NO EXCEL PLEASE. If you do use it please explain how getting each answer. Thank you so much

For the following program fragment, (1) give an analysis of the running time T(n) as a function of n and (2) give a big-O bound on the asymptotic running time (tight bounds for full credit).

Sum = 0;

for (i=0; i< n; i++)

   for(j=0; j < i*i; j++)

if(j % i == 0)

for (k=0; k<j; k++)

Sum = Sum + 1;

According to superfund (CERCLA), what is the formal steps to follow in the cleanup process? How much is the current EPA budget for the Superfund program? How the regulations are applied for recouping cleanup costs?

C programming Assignment

1. Read two integers into two variables, A and B. Print them on terminals. Write functions to Swap them (1) using a temporary variable and (2) without using a temporary variable.

2. Read 10 integers into an array. Sort the array. Then print the sorted array.

3. Read 16 integers into an array. Use merge sort algorithm to sort it.

4. Read 16 integers into an array. Sort it using merge sort algorithm. Then read a number to be searched in the array. Then in no more than 4 comparisons, decide if the given number is in the array or not and print the result.