Answer:
a) D = 4.88 * 10^(-14) m^2 / s
b) <em>t </em>= 1.1 hr
Solution:
a) Magnesium in Aluminum diffusion:
D = Do * exp(-Qd / RT)
= (1.2 * 10^(-4) m^2 / s) * exp ( - 130,000 / 8.31 * 723.15)
= 4.88 * 10^(-14) m^2 / s
D = 4.88 * 10^(-14) m^2 / s
b) The composition remains same at say the distance Xo:
(Cx - Co) / (Cs - Co) = Constant
Xo^2 / D_{550} * <em>t </em>= Xo^2 / D_{450} * 15
D_{550} * <em>t </em>= D_{450} * 15
(1.2 * 10^(-4) m^2 / s) * exp ( - 130,000 / 8.31 * 723.15) * <em>t</em>
(4.88 * 10^(-14) m^2 / s) * 15
by, solving for <em>t </em>we get:
<em>t </em>= 1.1 hr
So, the time required is 1.1 hr.
Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
Answer:
Language programming Web's programming language
Explanation:
<u>False:</u>
A website about anything political from one end such as the political party or candidate is most likely to give biased information such as
- I will be the best mayor you ever had (Opinion)
- I will never let you down (Opinion)
- I have the best house (Opinion)
This is because those are Opinions not facts which is bias-based information.
<em>Hope this helps!</em>
Hi, A Tech-Savvy here.
Answer:
(C) Lengthen the time period between forced password changes.
