Answer:
Explanation:
The python code to generate this is quite simple to run.
i hope you understand everything written here, you can as well try out other problems to understand better.
First to begin, we import the package;
Code:
import pandas as pd
import matplotlib.pyplot as plt
name = input('Enter name of the file: ')
op = input('Enter name of output file: ')
df = pd.read_csv(name)
df['Date'] = pd.to_datetime(df["Date"].apply(str))
plt.plot(df['Date'],df['Absent']/(df['Present']+df['Absent']+df['Released']),label="% Absent")
plt.legend(loc="upper right")
plt.xticks(rotation=20)
plt.savefig(op)
plt.show()
This should generate the data(plot) as seen in the uploaded screenshot.
thanks i hope this helps!!!
Answer: True
Explanation: Ceramics have the property that when the band gap present between the atoms are larger than the light energy then the tend to become opaque because the light scattering is caused . They also show the property of being translucent when there are chances of the light to get a path through the surface of ceramic so they get the light at some parts e.g.porcelain .Therefore the statement given is true that ceramics can be optically opaque or semi-transparent(translucent).
Answer:
Answer for the question :
"the two boxcars A and B have a weight of 20 000 Ib and 30 000 Ib, respectively. If they coast freely down the incline when the brakes are applied to all the wheels of car A causing it to skid, determine the force in the coupling C between the two cars. The coefficient of kinetic friction between the wheels of A and the tracks is μk=0.5. The wheels of car B are free to roll. Neglect their mass in calculation."
is explained in the attachment.
Explanation:
Hi! Hope you're having a great day!
Answer:
a) 244,140,625 different ways
b) 390,625 different ways
Explanation:
a) If there are 5 ways to place a chip on each location, and there are 12 locations overall, we have:
5^12 ways of placing them
This would mean a total of 244,140,625 different ways
b) If five chips are of the same type, we can first find how many ways we can place chips on the remaining 7 locations:
5^7 = 78,125
Next we can multiply this by the number of ways the next 5 chips could be the same:
78,125 * 5 = 390,625 different ways
