In: Math
Check in each case whether the given function can serve as the probability distribution of an appropriate random variable. (a) f(x) = (2 x)/4 for x = 0, 1, 2; (b) f(x) = x - 2/9 for x = 1, 2, 3, 4, 5, 6; (c) f(x) = x^2 - 6x + 9/10 for x = 1, 2, 3, 4, 5; (d) f(x) = x^2 - 6x + 8/5 for x = 1, 2, 3, 4, 5.
In: Math
The following table represents a plan for a project:
| PREDECESSOR JOB(S) |
TIMES (DAYS) | |||
| JOB NO. | a | m | b | |
| 1 | – | 2 | 4 | 6 |
| 2 | 1 | 3 | 3 | 15 |
| 3 | 1 | 3 | 4 | 11 |
| 4 | 1 | 1 | 2 | 9 |
| 5 | 2 | 2 | 6 | 7 |
| 6 | 3 | 3 | 7 | 8 |
| 7 | 4 | 4 | 6 | 8 |
| 8 | 5,6 | 2 | 3 | 4 |
| 9 | 8 | 1 | 4 | 7 |
| 10 | 7 | 3 | 4 | 5 |
| 11 | 9,10 | 5 | 6 | 7 |
b. Indicate the critical path.
| 1-2-5-8-9-11 | |
| 1-4-7-10-11 | |
| 1-2-5-8 | |
| 1-3-6-8-9-11 |
c. What is the expected completion time for the project? (Round your answer to 2 decimal places.)
Expected completion time days
d. You can accomplish any one of the following at an additional cost of $2,500 and if you will save $1,700 for each day that the earliest completion time is reduced, which action, if any, would you choose?
1. Reduce job 2 by three days.
| No | |
| Yes |
2. Reduce job 6 by two days.
| Yes | |
| No |
3. Reduce job 10 by two days.
| Yes | |
| No |
e. What is the probability that the project will take more than 29 days to complete? (Round your answer to 2 decimal places.)
Probability
In: Statistics and Probability
Q1. Let {Xn|n ≥ 0} is a Markov chain with state space S = {0, 1, 2, 3} and transition probability matrix (pij ). Let τi = min{n ≥ 1 : Xn = i}, i = 0, 1, 2, 3. Define Bij = {Xτj = i}. Is Bij ∈ σ(X0, · · · , Xτj ) ? Q2. Let {Xn|n ≥ 0} is a Markov chain with state space S = {0, 1, 2, 3}, X0 = 0, and transition probability matrix (pij ) given by 2 3 1 3 0 0 1 3 2 3 0 0 0 1 4 1 4 1 2 0 0 1 2 1 2 Let Bij as in Q1. Compute P(Xτ0+2 = 2|B00).
Q4. Let {Xn|n ≥ 0} is a Markov chain with state space S = {0, 1, 2} and transition probability matrix (pij ) given by 2 3 1 3 0 1 3 2 3 0 0 1 4 3 4 Let τ2 = inf{n ≥ 1 : Xn = 2} Find P{τ2 < ∞|X0 = 2}. Q5. Let {Xn|n ≥ 0} is a Markov chain with state space S = {0, 1, 2, 3}, and transition probability matrix (pij ) given by 2 3 1 3 0 0 1 3 2 3 0 0 0 1 4 1 4 1 2 0 0 1 2 1 2 Determine all recurrent states. 1
In: Statistics and Probability
1) Rank the following titrations in order of increasing pH at the halfway point to equivalence (1 = lowest pH and 5 = highest pH).
1 2 3 4 5 200.0 mL of 0.100 M
H2NNH2 (Kb = 3.0 x
10-6) by 0.100 M HCl
1 2 3 4 5 100.0 mL of 0.100 M
HC3H5O2 (Ka = 1.3 x
10-5) by 0.100 M NaOH
1 2 3 4 5 100.0 mL of 0.100 M HF (Ka = 7.2 x
10-4) by 0.100 M NaOH
1 2 3 4 5 200.0 mL of 0.100 M
(C2H5)2NH (Kb = 1.3 x
10-3) by 0.100 M HCl
1 2 3 4 5 100.0 mL of 0.100 M HI by 0.100 M NaOH
2) Rank the following titrations in order of increasing pH at the equivalence point of the titration (1 = lowest pH and 5 = highest pH).
1 2 3 4 5 100.0 mL of 0.100 M
HC3H5O2 (Ka = 1.3 x
10-5) by 0.100 M NaOH
1 2 3 4 5 200.0 mL of 0.100 M
(C2H5)2NH (Kb = 1.3 x
10-3) by 0.100 M HCl
1 2 3 4 5 200.0 mL of 0.100 M
H2NNH2 (Kb = 3.0 x
10-6) by 0.100 M HCl
1 2 3 4 5 100.0 mL of 0.100 M HF (Ka = 7.2 x
10-4) by 0.100 M NaOH
1 2 3 4 5 100.0 mL of 0.100 M KOH by 0.100 M HCl
In: Chemistry
Write a class named Rat (to simulate rational or fraction number) such that it works as in the main below.
int main()
{
Rat a(3, 4), b(1, 2);
a.print(); // output: 3/4
b.print(); // output: 1/2
Rat c = a.add(b);
c.print(); // output: 5/4
// Hint: 3/4 + 1/2 = 6/8 + 4/8 = 10/8 = 5/4
Rat d = a.multiply(b);
d.print(); // output: 3/8
// Hint: 3/4 x 1/2 = 3/8
return 0;
}
In: Computer Science
provide a C code (only C please) that gives the output below:
************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials. *
* 4. Displaying polynomials *
* 5. Clearing polynomials. *
* 6. Quit. *
***********************************
Select the option (1 through 6): 7
You should not be in this class!
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: 0
Right Poly Pointer: 0
Resulting Poly Pointer: 0
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 1
/* Performing the required task(s) and your code must ALSO print
1. Description/explanation of the method or approach that you
use to create 2 polynomials; and
2. The listing of all functions involved in the
process.
*/
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x2 + 3/4x + 5/12
Right Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x4 – 3/7x2 + 4/9x + 2/11
Resulting Poly Pointer: 0
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 2
/* Performing the required task(s) and your code must ALSO print
1. Description/explanation of the method or approach that you
use to add 2 polynomials; and
2. The listing of all functions involved in the
process.
*/
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x2 + 3/4x + 5/12
Right Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x4 – 3/7x2 + 4/9x + 2/11
Resulting Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x4 – 3/7x2 + 43/36x + 79/132
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 3
/* Performing the required task(s) and your code must ALSO print
1. Description/explanation of the method or approach that you
use to multiply 2 polynomials; and
2. The listing of all functions involved in the
process.
*/
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x2 + 3/4x + 5/12
Right Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x4 – 3/7x2 + 4/9x + 2/11
Resulting Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING Poly 1/1x6 + 3/4x5 – 1/84x4 + 31/252x3 + 871/924x2 + 191/594x + 5/66
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 5
/* Releasing selected polynomial(s)
For example, clearing and releasing left polynomial
*/
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: 0
Right Poly Pointer: SOME NONE ZERO ADDRESS and DISPLAYING
Poly
1/1x4 – 3/7x2 + 4/9x + 2/11
Resulting Poly Pointer: 0
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 5
/* Releasing selected polynomial(s)
For example, clearing and releasing right polynomial
*/
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 4
Left Poly Pointer: 0
Right Poly Pointer: 0
Resulting Poly Pointer: 0
*************************************
* Menu HW #4
*
* POLYNOMIAL OPERATIONS *
* 1. Creating polynomials *
* 2. Adding polynomials *
* 3. Multiplying polynomials *
* 4. Displaying polynomials. *
* 5. Clearing polynomials *
* 6. Quit *
***********************************
Select the option (1 through 6): 6
Polynomials -- Having Fun!
In: Computer Science
Quantum numbers arise naturally from the mathematics used to describe the possible states of an electron in an atom. The four quantum numbers, the principal quantum number (n),(n), the angular momentum quantum number (?),(?), the magnetic quantum number (m?),(m?), and the spin quantum number (ms)(ms) have strict rules which govern the possible values.
Identify all allowable combinations of quantum numbers for an electron.
1. n=3, ?=-2, m? = -2, ms = +1/2
2. n=3, ?=2, m? = -2, ms = -1/2
3. n=5, ?=4, m? = -1, ms = -1/2
4. n=2, ?=0, m? = 0, ms =1
5. n=1, ?=1, m? = -1, ma = -1/2
6. n=4, ?=3 m? = 4, ms = -1/2
In: Chemistry
Deadlock Avoidance using Banker’s Algorithm
Q2: Use the following information and complete the Table, also write down the safe sequence if exist?
Three Resources (R1=4, R2=9, R3=11)
|
Processes |
Allocated Resources R1 R2 R3 |
Maximum Required Resources R1 R2 R3 |
Currently Available Resources R1 R2 R3 |
Remaining Need R1 R2 R3 |
Safe Sequence |
|
P1 |
1 4 2 |
2 4 6 |
|||
|
P2 |
2 1 1 |
3 2 8 |
|||
|
P3 |
0 0 1 |
1 2 3 |
|||
|
P4 |
0 0 0 |
4 4 2 |
|||
|
P5 |
0 0 1 |
1 3 1 |
In: Computer Science
| Price (in K) | Sqft | Age | Features | CornerCODE | Corner_Label |
| 310.0 | 2650 | 13 | 7 | 0 | NO |
| 313.0 | 2600 | 9 | 4 | 0 | NO |
| 320.0 | 2664 | 6 | 5 | 0 | NO |
| 320.0 | 2921 | 3 | 6 | 0 | NO |
| 304.9 | 2580 | 4 | 4 | 0 | NO |
| 295.0 | 2580 | 4 | 4 | 0 | NO |
| 285.0 | 2774 | 2 | 4 | 0 | NO |
| 261.0 | 1920 | 1 | 5 | 0 | NO |
| 250.0 | 2150 | 2 | 4 | 0 | NO |
| 249.9 | 1710 | 1 | 3 | 0 | NO |
| 242.5 | 1837 | 4 | 5 | 0 | NO |
| 232.0 | 1880 | 8 | 6 | 0 | NO |
| 230.0 | 2150 | 15 | 3 | 0 | NO |
| 228.5 | 1894 | 14 | 5 | 0 | NO |
| 222.0 | 1928 | 18 | 8 | 0 | NO |
| 223.0 | 1830 | 16 | 3 | 0 | NO |
| 220.5 | 1767 | 16 | 4 | 0 | NO |
| 216.0 | 1630 | 15 | 3 | 1 | YES |
| 218.9 | 1680 | 17 | 4 | 1 | YES |
| 204.5 | 1725 | 13 | 3 | 0 | NO |
| 204.5 | 1500 | 15 | 4 | 0 | NO |
| 202.5 | 1430 | 10 | 3 | 0 | NO |
| 202.5 | 1360 | 12 | 4 | 0 | NO |
| 195.0 | 1400 | 16 | 2 | 1 | YES |
| 201.0 | 1573 | 17 | 6 | 0 | NO |
| 191.0 | 1385 | 22 | 2 | 0 | NO |
| 274.5 | 2931 | 28 | 3 | 1 | YES |
| 260.3 | 2200 | 28 | 4 | 0 | NO |
| 230.0 | 2277 | 30 | 4 | 0 | NO |
| 235.0 | 2000 | 37 | 3 | 0 | NO |
| 207.0 | 1478 | 53 | 3 | 1 | YES |
| 207.0 | 1713 | 30 | 4 | 1 | YES |
| 197.2 | 1326 | 25 | 4 | 0 | NO |
| 197.5 | 1050 | 22 | 2 | 1 | YES |
| 194.9 | 1464 | 34 | 2 | 0 | NO |
| 190.0 | 1190 | 41 | 1 | 0 | NO |
| 192.6 | 1156 | 37 | 1 | 0 | NO |
| 194.0 | 1746 | 30 | 2 | 0 | NO |
| 192.0 | 1280 | 28 | 1 | 0 | NO |
| 175.0 | 1215 | 43 | 3 | 0 | NO |
| 177.0 | 1121 | 46 | 4 | 0 | NO |
| 177.0 | 1050 | 48 | 1 | 0 | NO |
| 179.9 | 1733 | 43 | 6 | 0 | NO |
| 178.1 | 1299 | 40 | 6 | 0 | NO |
| 177.5 | 1140 | 36 | 3 | 1 | YES |
| 172.0 | 1181 | 37 | 4 | 0 | NO |
| 320.0 | 2848 | 4 | 6 | 0 | NO |
| 264.9 | 2440 | 11 | 5 | 0 | NO |
| 240.0 | 2253 | 23 | 4 | 0 | NO |
| 234.9 | 2743 | 25 | 5 | 1 | YES |
| 230.0 | 2180 | 17 | 4 | 1 | YES |
| 228.9 | 1706 | 14 | 4 | 0 | NO |
| 225.0 | 1948 | 10 | 4 | 0 | NO |
| 217.5 | 1710 | 16 | 4 | 0 | NO |
| 215.0 | 1657 | 15 | 4 | 0 | NO |
| 213.0 | 2200 | 26 | 4 | 0 | NO |
| 210.0 | 1680 | 13 | 4 | 0 | NO |
| 209.9 | 1900 | 34 | 3 | 0 | NO |
| 200.5 | 1565 | 19 | 3 | 0 | NO |
| 198.4 | 1543 | 20 | 3 | 0 | NO |
| 192.5 | 1173 | 6 | 4 | 0 | NO |
| 193.9 | 1549 | 5 | 4 | 0 | NO |
| 190.5 | 1900 | 3 | 3 | 0 | NO |
| 188.5 | 1560 | 8 | 5 | 1 | YES |
| 186.0 | 1365 | 10 | 2 | 0 | NO |
| 185.5 | 1258 | 7 | 4 | 1 | YES |
| 184.9 | 1314 | 5 | 2 | 0 | NO |
| 180.0 | 1338 | 2 | 3 | 1 | YES |
| 180.9 | 997 | 4 | 4 | 0 | NO |
| 180.5 | 1275 | 8 | 5 | 0 | NO |
| 180.0 | 1030 | 4 | 1 | 0 | NO |
| 178.0 | 1027 | 5 | 3 | 0 | NO |
| 177.9 | 1007 | 19 | 6 | 0 | NO |
| 176.0 | 1083 | 22 | 4 | 0 | NO |
| 182.3 | 1320 | 18 | 5 | 0 | NO |
| 174.0 | 1348 | 15 | 2 | 0 | NO |
| 172.0 | 1350 | 12 | 2 | 0 | NO |
| 166.9 | 837 | 13 | 2 | 0 | NO |
| 234.5 | 3750 | 10 | 4 | 1 | YES |
| 202.5 | 1500 | 7 | 3 | 1 | YES |
| 198.9 | 1428 | 40 | 2 | 0 | NO |
| 187.0 | 1375 | 28 | 1 | 0 | NO |
| 183.0 | 1080 | 20 | 3 | 0 | NO |
| 182.0 | 900 | 23 | 3 | 0 | NO |
| 175.0 | 1505 | 16 | 2 | 1 | YES |
| 167.0 | 1480 | 19 | 4 | 0 | NO |
| 159.0 | 1142 | 10 | 0 | 0 | NO |
| 212.0 | 1464 | 7 | 2 | 0 | NO |
| 315.0 | 2116 | 25 | 3 | 0 | NO |
| 177.5 | 1280 | 14 | 3 | 0 | NO |
| 171.0 | 1159 | 23 | 0 | 0 | NO |
| 165.0 | 1198 | 10 | 4 | 0 | NO |
| 163.0 | 1051 | 15 | 2 | 0 | NO |
| 289.4 | 2250 | 40 | 6 | 0 | NO |
| 263.0 | 2563 | 17 | 2 | 0 | NO |
| 174.9 | 1400 | 45 | 1 | 1 | YES |
| 238.0 | 1850 | 5 | 5 | 1 | YES |
| 221.0 | 1720 | 5 | 4 | 0 | NO |
| 215.9 | 1740 | 4 | 3 | 0 | NO |
| 217.9 | 1700 | 6 | 4 | 0 | NO |
| 210.0 | 1620 | 6 | 4 | 0 | NO |
| 209.5 | 1630 | 6 | 4 | 0 | NO |
| 210.0 | 1920 | 8 | 4 | 0 | NO |
| 207.0 | 1606 | 5 | 4 | 0 | NO |
| 205.0 | 1535 | 7 | 5 | 1 | YES |
| 208.0 | 1540 | 6 | 2 | 1 | YES |
| 202.5 | 1739 | 13 | 3 | 0 | NO |
| 200.0 | 1715 | 8 | 3 | 0 | NO |
| 199.0 | 1305 | 5 | 3 | 0 | NO |
| 197.0 | 1415 | 7 | 4 | 0 | NO |
| 199.5 | 1580 | 9 | 3 | 0 | NO |
| 192.4 | 1236 | 3 | 4 | 0 | NO |
| 192.2 | 1229 | 6 | 3 | 0 | NO |
| 192.0 | 1273 | 4 | 4 | 0 | NO |
| 191.9 | 1165 | 7 | 4 | 0 | NO |
| 181.6 | 1200 | 7 | 4 | 1 | YES |
| 178.9 | 970 | 4 | 4 | 1 | YES |
1.) Make a multiple regression model using these potential numerical predictor variables and, at most, one categorical dummy variable.
2.)Write the sample multiple regression equation for the “final best” model you have developed.
3.) Look at the set of residual plots, cut and paste them into the report, and briefly comment on the appropriateness of your fitted model.
In: Statistics and Probability