The answer would be a C class fire extinguisher.
Answer:
3
Explanation:
I've just taken the test and made a 100. 3 is the most logical answer aswell, it has more of an effect than the others.
Answer:
Following are the code block in the Java Programming Language.
//define recursive function
public static long exponentiation(long x, int n) {
//check the integer variable is equal to the 0.
if (x == 0) {
//then, return 1
return 1;
}
//Otherwise, set else
else {
//set long data type variable
long q = exponentiation(x, n/2);
q *= q;
//check if the remainder is 1
if (n % 2 == 1) {
q *= x;
}
//return the variable
return q;
}
}
Explanation:
<u>Following are the description of the code block</u>.
- Firstly, we define the long data type recursive function.
- Then, set the if conditional statement and return the value 1.
- Otherwise, set the long data type variable 'q' that sore the output of the recursive function.
- Set the if conditional statement and check that the remainder is 1 and return the variable 'q'.
I Think The answer is d I hope it helps
Implement the simulation of a biased 6-sided die which takes the values 1,2,3,4,5,6 with probabilities 1/8,1/12,1/8,1/12,1/12,1/
hjlf
Answer:
see explaination
Explanation:
import numpy as np
import matplotlib.pyplot as plt
a = [1, 2, 3, 4, 5, 6]
prob = [1.0/8.0, 1.0/12.0, 1.0/8.0, 1.0/12.0, 1.0/12.0, 1.0/2.0]
smls = 1000000
rolls = list(np.random.choice(a, smls, p=prob))
counts = [rolls.count(i) for i in a]
prob_exper = [float(counts[i])/1000000.0 for i in range(6)]
print("\nProbabilities from experiment : \n\n", prob_exper, end = "\n\n")
plt.hist(rolls)
plt.title("Histogram with counts")
plt.show()
check attachment output and histogram
