PLEASE HELP, THANK YOU
1 answer:
You might be interested in
Answer:
Take any algorithm if that algorithm solves this problem it can be represented as a ternary decision tree. Therefore each question has at most three answers.
There are ten possible verdicts, the height of such kind of tree should satisfy
ℎ >= ⌈log3(10)⌉ = 3
Hence no such algorithm can ask less than three questions in the worst case.
---
b)
Each and every internal node represents a question asking whether m belongs to one of three possible subset of {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} or not
For example 0123|456|789 represented the questionDoes “m: belongs to {0, 1, 2, 3}, to {4, 5, 6}, or to {7, 8, 9}?"
Verdicts are placed in brackets "[ ]"
Explanation:
decision tree is attached below
Answer:
8.24μm
Explanation:
The theory of brittle fracture was used to solve this problem.
And if you follow through with the attachment made a the subject of the formula
Such that,
a = 2x(69x10⁹)x0.3/pi(40x10⁶)²
= 4.14x10¹⁰/5.024x10¹⁵
= 8.24x10^-06
= 8.24μm
This is the the maximum length of the surface flaw
