If the density of the universe great than a critical value, then

A 16.4-kg block rests on a horizontal table and is attached to one end of a massless, horizontal spring. By pulling horizontally on the other end of the spring, someone causes the block to accelerate uniformly and reach a speed of 4.50 m/s in 1.55 s. In the process, the spring is stretched by 0.236 m. The block is then pulled at a constant speed of 4.50 m/s, during which time the spring is stretched by only 0.0565 m. Find (a) the spring constant of the spring and (b) the coefficient of kinetic friction between the block and the table.

discuss what a disclaimer is, when is it is issued, and how it would affect the format of a standard three paragraph audit report.

Explain why 1 additional net ATP is produced when the beginning substrate is glycogen compared to glucose. In your answer provide the name of the enzyme responsible for this difference.

What is Sales Tax, its salient features and how it works, do a comparative analysis between Sales Tax and Value Added Tax and render your personal opinion as to which system is better between the two for a developing country

E8-10 (Algo) Computing Depreciation under Alternative Methods LO8-3

Strong Metals Inc. purchased a new stamping machine at the beginning of the year at a cost of $1,900,000. The estimated residual value was $100,000. Assume that the estimated useful life was five years and the estimated productive life of the machine was 300,000 units. Actual annual production was as follows:

Required:

1. Complete a separate depreciation schedule for each of the alternative methods.

a. Straight-line.

b. Units-of-production.

c. Double-declining-balance.

This is the chart to use for each question. Boxes with a dash in it do not have to be filled.

C++ programming

You are to implement a MyString class which is our own limited implementation of the std:: string

Header file and test (main) file are given in below, code for mystring.cpp.

Here is header file

mystring.h

/* MyString class */

#ifndef MyString_H

#define MyString_H

#include <iostream>

using namespace std;

class MyString {

private:

   char* str;

   int len;

public:

   MyString();

   MyString(const char* s);

   MyString(MyString& s);

   ~MyString();

   friend ostream& operator <<(ostream& os, MyString& s); // Prints string

   MyString& operator=(MyString& s); //Copy assignment

   MyString& operator+(MyString& s); // Creates a new string by concantenating input string

};

#endif

Here is main file, the test file

testMyString.cpp

/* Test for MyString class */

#include <iostream>

#include "mystring.h"

using namespace std;

int main()

{

char greeting[] = "Hello World!";

MyString str1(greeting); // Tests constructor

cout << str1 << endl; // Tests << operator. Should print Hello World!

char bye[] = "Goodbye World!";

MyString str2(bye);

cout << str2 << endl; // Should print Goodbye World!

MyString str3{str2}; // Tests copy constructor

cout << str3 << endl; // Should print Hello World!

str3 = str1; // Tests copy assignment operator

cout << str3 << endl; // Should print Goodbye World!

str3 = str1 + str2; // Tests + operator

cout << str3 << endl; // Should print Hello World!Goodbye World!

return 0;

}

A charge of -2.75 nC is placed at the origin of an xy-coordinate system, and a charge of 2.05 nC is placed on the y axis at y = 3.60 cm .

A. If a third charge, of 5.00 nC , is now placed at the point x = 2.65 cm , y = 3.60 cm find the x and y components of the total force exerted on this charge by the other two charges.

B. Find the magnitude of this force.

C. Find the direction of this force.

1) Two vectors, r  and s lie in the x y plane. Their magnitudes are 4.84 and 6.09 units respectively, and their directions are 341^o and 65.0^o respectively, as measured counterclockwise from the positive x axis. What are the values of vectors (a) r . s and (b) | r × s |?

2) For the following three vectors A B C, what is 3⋅C . (3A × B) ?
A =3.00î + 2.00ĵ - 3.00k̂
B =-4.00î + 3.00ĵ + 3.00k̂
C =6.00î - 7.00ĵ

1. What artifacts, espoused values, enacted values and norms, and assumptions demonstrate the culture of Southwest Airlines?

1) 10000 lb/h of a 40.00% NaoH solution is crystallized through a combined evaporator-crystallizer process. The feed enters an evaporator which concentrates it to 50.00% NaOH. The concentrated solution then enters the crystallizer with a built in filter. The crystal product is 95% NaOH crystals with the remaining 5% as adhering mother liquor solution. The mother liquor, containing 45.00% NaOH, is mixed back to the feed before entering the evaporator. Determine the recycle flow rate.

2) Resolve the problem, now considering if the mother liquor is not recycled, but the entire process still generates the same amount of product (crystals) as the original problem. Retain all concentrations given. Determine the amount of feed needed if the recycle stream was removed. Compare the recovery ratio (lb NaOH recovered as crystals/lb NaOH in feed) for the two cases to see the importance of the recycle stream.

STRICT DOWNVOTE IF NOT DONE FULLY, WILL REPORT ALSO IF COPY PASTED OR MODIFIED ANSWER Develop a class, using templates, to provide functionality for a set of recursive functions. The functions specified as recursive must be written recursively (not iterativly). The UML class specifications are provided below. A main will be provided. Additionally, a make file will need to be developed and submitted. ● Recursion Set Class The recursion set template class will implement the template functions. recursionSet -length: int -*mySet: myType -MAX_VALUE = 500000 static const: int -LIMIT = 1000 static const: int +recursionSet() +recursionSet(const recursionSet&) +~recursionSet() +getSetLength() const: int +generateElements(int): void + getElement(int) const: myType +setElement(int, myType): void +readValue(const string) const: int +printSet() const: void +operator == (const recusrionSet&): bool +tak(myType, myType, myType) const: myType +printSeptenary(myType) const: void +squareRoot(myType, myType) const: myType -recSqRoot(myType, myType, myType) const: myType +recursiveSum() const: myType -rSum(int) const: myType +checkParentheses(string) const: bool -recChkPar(string, int, int) const: bool +recursiveInsertionSort(): void -recInsSort(int, int): void -insertInOrder(myType, int, int): voidYou may add additional private functions if needed (but, not for the recursive functions). Note, points will be deducted for especially poor style or inefficient coding. Function Descriptions • The recursionSet() constructor should set the length to 0 and mySet pointer to NULL. • The recusrsionSet(const recursionBucket&) copy constructor should create a new, deep copy from the passed object. • The ~recursionSet() destructor should delete the myType array, set the pointer to NULL, and set the size to 0. • The setElement(int, myValue) function should set an element in the class array at the given index location (over-writing any previous value). The function must include bounds checking. If an illegal index is provided, a error message should be displayed. • The getElement(int) should get and return an element from the passed index. This must include bounds checking. If an illegal index is provided, a error message should be displayed and a 0 returned. • The getSetLength() functions should return the current class array length. • The printSet(int) function should print the formatted class array with the passed number of values per line. Use the following output statement: cout << setw(5) << mySet[i] << " • "; Refer to the sample executions for formatting example. The readValue(string) function should prompt with the passed string and read a number from the user. The function should ensure that the value is 3 1 and £ MAX_VALUE. The function should handle invalid input (via a try/catch block). If an error occurs (out of range or invalid input) an appropriate message should be displayed and the user re- prompted. Example error messages include: cout << "readSetLenth: Sorry, too many " << "errors." << endl; cout << "readSetLenth: Error, value " << cnt << " not between 1 and " << numMax << "." << endl; • Note, three errors is acceptable, but a fourth error should end the function and return 0. The generateList(int) function should dynamically create the array and use the following casting for rand() to fill the array with random values. mySet[i] = static_cast(rand()%LIMIT); • • • The printSeptenary(myType) function should print the passed numeric argument in Septenary (base-7) format. Note, function must be written recursively. The recursiveSum() function will perform a recursive summation of the values in class data set and return the final sum. The function will call the private rSum(int) function (which is recursive). The rSum(int) function accepts the length of the data set and performs a recursive summation. The recursive summation is performed as follows: rSum ( position )= • { array[ 0] array[ position ] + rSum ( position−1) if position = 0 if position > 0 The tak(myType) function should recursively compute the Tak 1 function. The Tak function is defined as follows: tak ( x , y , z) = { z tak ( tak ( x−1, y , z) , tak ( y−1, z , x) , tak ( z −1, x , y ) ) 1 For more information, refer to: http://en.wikipedia.org/wiki/Tak_(function) if y≥ x if y < x• • The squareRoot(myType, myType) function will perform a recursive estimation of the square root of the passed value (first parameter) to the passed tolerance (second parameter). The function will call the private sqRoot(myType,myType,myType) function (which is recursive). The private recSqRoot(myType,myType,myType) function recursively determines an estimated square root. Assuming initially that a = x, the square root estimate can be determined as follows: recSqRoot ( x , a , epsilon) = • • • • • { 2 if ∣ a − x ∣ ≤ epsilon a 2 (a + x) sqRoot x , , epsilon 2 a ( ) if ∣ a 2 − x ∣ > epsilon The recursiveInsertionSort() function should sort the data set array using a recursive insertion sort. The recursiveInsertionSort() function should verify the length is valid and, if so, call the recInsSort() function to perform the recursive sorting (with the first element at 0 and the last element at length-1). The recInsSort(int, int) function should implement the recursive insertion sort. The arguments are the index of the first element and the index of the last element. If the first index is less than that last index, the recursive insertion sort algorithm is follows: ▪ Recursively sort all but the last element (i.e., last-1) ▪ Insert the last element in sorted order from first through last positions To support the insertion of the last element, the insertInOrder() function should be used. The insertInOrder(myType, int, int) function should recursively insert the passed element into the correction position. The arguments are the element, the starting index and the ending index (in that order). The function has 3 operations: ▪ If the element is greater than or equal to the last element in the sorted list (i.e., from first to last). If so, insert the element at the end of the sorted (i.e, mySet[last+1] = element). ▪ If the first is less than the last, insert the last element (i.e., mySet[last]) at the end of the sorted (i.e., mySet[last+1] = mySet[last]) and continue the insertion by recursively calling the insertInOrder() function with the element, first, and last-1 values. ▪ Otherwise, insert the last element (i.e., mySet[last]) at the end of the sorted (i.e., mySet[last+1] = mySet[last]) and set the last value (i.e., mySet[last]) to the passed element. The checkParentheses(string) function should determine if the parentheses in a passed string are correctly balanced. The function should call the private recChkPar(string, int, int) function (which is recursive) The recChkPar(string, int, int) function should determine if the parentheses in a string are correctly balanced. The arguments are the string, an index (initially 0), and a parenthesis level count (initially 0). The index is used to track the current character in the string. The general approach should be as follows: ◦ Identify base case or cases. ◦ Check the current character (i.e., index) for the following use cases: ▪ if str[index] == '(' → what to do then ▪ if str[index] == ')' → what to do then ▪ if str[index] == any other character → what to do then Note, for each case, increment the index and call function recursively.