The body removes antibacterial drugs at a rate in proportion to the amount present. Your task is to:

• Express this as a differential equation.
• Assume the initial dosage is 450 milligrams. 7 hours later, 50 milligrams remain inside the body. Determine the decay constant.
• Proceed given the facts in the previous statement. How long after the drug was administered would 200 milligrams be found in the body?

The blood glucose concentration is controlled by the liver. It removes glucose from the blood stream and stores it when the blood glucose concentration gets too high and it releases glucose to the blood stream when its concentration gets too low. Unlike HK II, it needs to be able to respond to a range of glucose concentrations. As a result, hexokinase activity in liver has a different concentration dependence profile compared to HK II in muscle—HK IV is NOT a Michaelis-Menten enzyme.

1. Given its role, how would you expect the rate vs. [glucose] plot to look for hexokinase in liver? Sketch it below. (Consider another protein that we discussed that has to respond to a range of different ligand concentrations) "

1. Using the tweezers Sam carefully removes the leaves from the alcohol and dips them in the rinse water. He blots the leaves gently of a piece of paper towel and places them in a different area of light on the plate. Using the tweezers gently spreads the leaves back into their normal shapes. He uses a syringe to flood the leaves with iodine. After two minutes what are the colors of the leaves?

• • Tubular Secretion
    • Removes ____________ and ___________ ___________ from blood
• _________________ urethral sphincter: Smooth muscle; involuntary
• _________________ urethral sphincter: Skeletal muscle; voluntary
• Urinary _____________________: Lack of voluntary control over urination
• Urinary ________________: Failure to expel urine from the bladder to a normal degree
• Healthy urine typically contains _____________ ______________ when properly collected
• How do Kidneys help regulate blood pH?
  • __________________: Increases reabsorption of sodium by the distal convoluted tubules and collecting ducts, resulting in more water following sodium as it moves from filtrate to blood
    • Released in response to ________________ ________________ monitored by juxtaglomerular apparatus
  • ______________ _________________: Increases permeability to water of collecting ducts, resulting in more water moving from filtrate to blood

Management discovers that a supervisor at one of their restaurant locations removes excess cash and resets sales totals throughout the day on the point of sale (POS) system. At closing the supervisor deposits cash equal to the recorded sales on the POS system and keeps the rest. The supervisor forwards the close-of-day POS reports from the POS system along with a copy of the bank deposit slip to the company’s revenue accounting department. The revenue accounting department records the sales and the cash for the location in the general ledger and verifies the deposit slip to the bank statement. Any differences between sales and deposits are recorded in an over/short account and, if necessary, followed up with the location supervisor. The customer food order checks are serially numbered, and it is the supervisor’s responsibility to see that they are accounted for at the end of each day. Customer checks and the transaction journal tapes from the POS system are kept by the supervisor for one week at the location and then destroyed.

1. What control procedures in the above case allowed the fraud to occur?

2. What audit procedures would have detected the fraud?

3.) The function remove of the class arrayListType removes only the first occurrence of an element. Add the function removeAll as an abstract function to the class arrayListType, which would remove all occurrences of a given element. Also, write the definition of the function removeAll in the class unorderedArrayListType and write a program to test this function.
4.) Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function.
5.) Add the function max as an abstract function to the class arrayListType to return the largest element of the list. Also, write the definition of the function max in the class unorderedArrayListType and write a program to test this function.

#include <iostream>
#include <cassert>
#include "arrayListType.h"

using namespace std;

bool arrayListType::isEmpty() const
{
return (length == 0);
} //end isEmpty

bool arrayListType::isFull() const
{
return (length == maxSize);
} //end isFull

int arrayListType::listSize() const
{
return length;
} //end listSize

int arrayListType::maxListSize() const
{
return maxSize;
} //end maxListSize

void arrayListType::print() const
{
for (int i = 0; i < length; i++)
cout << list[i] << " ";
cout << endl;
} //end print

bool arrayListType::isItemAtEqual(int location, int item) const
{
if (location < 0 || location >= length)
{
cout << "The location of the item to be removed "
<< "is out of range." << endl;

return false;
}
else
return (list[location] == item);
} //end isItemAtEqual

void arrayListType::removeAt(int location)
{
if (location < 0 || location >= length)
cout << "The location of the item to be removed "
<< "is out of range." << endl;
else
{
for (int i = location; i < length - 1; i++)
list[i] = list[i + 1];

length--;
}
} //end removeAt

void arrayListType::retrieveAt(int location, int& retItem) const
{
if (location < 0 || location >= length)
cout << "The location of the item to be retrieved is "
<< "out of range" << endl;
else
retItem = list[location];
} //end retrieveAt

// Part 1 - retrieve at as a value return function with assert
int arrayListType::retrieveAt(int location) const
{
assert(0 < location && location < length);
return list[location];
}

void arrayListType::clearList()
{
length = 0;
} //end clearList

arrayListType::arrayListType(int size)
{
if (size <= 0)
{
cout << "The array size must be positive. Creating "
<< "an array of the size 100." << endl;

maxSize = 100;
}
else
maxSize = size;

length = 0;

list = new int[maxSize];
} //end constructor

//Add the function removeAll as an abstract function
//which would remove all occurrences of a given element

arrayListType::~arrayListType()
{
delete[] list;
} //end destructor

arrayListType::arrayListType(const arrayListType& otherList)
{
maxSize = otherList.maxSize;
length = otherList.length;

list = new int[maxSize];    //create the array

for (int j = 0; j < length; j++) //copy otherList
list[j] = otherList.list[j];

#include <iostream>
#include "unorderedArrayListType.h"

using namespace std;

void unorderedArrayListType::insertAt(int location,
int insertItem)
{
if (location < 0 || location >= maxSize)
cout << "The position of the item to be inserted "
<< "is out of range." << endl;
else if (length >= maxSize) //list is full
cout << "Cannot insert in a full list" << endl;
else
{
for (int i = length; i > location; i--)
list[i] = list[i - 1];   //move the elements down

list[location] = insertItem; //insert the item at
//the specified position

length++;   //increment the length
}
} //end insertAt

void unorderedArrayListType::insertEnd(int insertItem)
{
if (length >= maxSize) //the list is full
cout << "Cannot insert in a full list." << endl;
else
{
list[length] = insertItem; //insert the item at the end
length++; //increment the length
}
} //end insertEnd

int unorderedArrayListType::seqSearch(int searchItem) const
{
int loc;
bool found = false;

loc = 0;

while (loc < length && !found)
if (list[loc] == searchItem)
found = true;
else
loc++;

if (found)
return loc;
else
return -1;
} //end seqSearch

void unorderedArrayListType::remove(int removeItem)
{
int loc;

if (length == 0)
cout << "Cannot delete from an empty list." << endl;
else
cout << "put the search and code here - use removeAt"
<< " in ArrayListType" << endl;
} //end remove

//Finish implementing max and return the largest number
//int unorderedArrayListType::max() const
//{
// if (length == 0)
// {
// cout << "The list is empty. "
// << "Cannot return the smallest element." << endl;
// exit(0);
// }
//
// int largest = list[0];

//} //end max

void unorderedArrayListType::replaceAt(int location, int repItem)
{
if (location < 0 || location >= length)
cout << "The location of the item to be "
<< "replaced is out of range." << endl;
else
list[location] = repItem;
} //end replaceAt

//
// Implement in class remove all occurences of a certain value
//void unorderedArrayListType::removeAll(int removeItem)
//{
// int loc;
//
// if (length == 0)
// cout << "Cannot delete from an empty list." << endl;
// else
// {
// loc = 0;
//

// }
//} ////end removeAll

//int unorderedArrayListType::min() const
//{
// if (length == 0)
// {
// cout << "The list is empty. "
// << "Cannot return the smallest element." << endl;
// exit(0);
// }
//
//
//
//} //end min

unorderedArrayListType::unorderedArrayListType(int size)
: arrayListType(size)
{
} //end constructor

C#

Write a console application that takes the following passage and removes every instance of the word "not" using StringBuilder and prints the result out to the console:

I do not like them
In a house.
I do not like them
With a mouse.
I do not like them
Here or there.
I do not like them
Anywhere.
I do not like green eggs and ham.
I do not like them, Sam-I-am.

Ensure that the resulting output reads normally, in other words, it must maintain the same line breaks and not include double-spaces where there should only be a single space. The output should be identical to this:

I do like them
In a house.
I do like them
With a mouse.
I do like them
Here or there.
I do like them
Anywhere.
I do like green eggs and ham.
I do like them, Sam-I-am.

The number of airplane landings at a small airport follows a Poisson distribution with a mean rate of 3 landings every hour.

4.1 (6%)

Compute the probability that 3 airplanes arrive in a given hour?

4.2 (7%)

What is the probability that 8 airplanes arrive in three hours?

4.3 (7%)

What is the probability that more than 3 airplanes arrive in a period of two hours?

In the old days, there was a probability of 80% of success in any attempt to make a telephone call. (This often depended on the importance of the person making the call, or the operator’s curiosity.) In six attempted calls, (a) Construct a probability distribution for X = the number of successful calls in six attempts. (b) Find the probability that at least two calls will be made successfully. (c) Find the mean and standard deviation of the distribution.

A loan officer in a bank estimates that the probability of default by an applicant is 0.025. Last month the bank approved 40 loan applications. Using Poisson distribution, find:
i) The probability that 3 loans will be defaulted.
ii) The probability that at least 3 loans will be defaulted.
iii) Find the mean and standard deviation of number of loan defaults.
iv) Comment on the relationship between the Poisson and Binomial distribution.