Answer:
Explanation:
The minimum depth occurs for the path that always takes the smaller portion of the
split, i.e., the nodes that takes α proportion of work from the parent node. The first
node in the path(after the root) gets α proportion of the work(the size of data
processed by this node is αn), the second one get (2)
so on. The recursion bottoms
out when the size of data becomes 1. Assume the recursion ends at level h, we have
(ℎ) = 1
h = log 1/ = lg(1/)/ lg = − lg / lg
Maximum depth m is similar with minimum depth
(1 − )() = 1
m = log1− 1/ = lg(1/)/ lg(1 − ) = − lg / lg(1 − )
Answer:Have a good dayyyyy
Explanation: can i be brainliest pls pls
Answer: True
Explanation: I would know i have gotten dosed plenty of times on video games
Answer:
For a Know Simple query, a Fully Meets rating can be given if the result does not display the answer, but it is at the very top of the landing page.
B) False
Explanation:
- A know simple query is special form of a know query. The query which are intended to know something like what is the length of pitch of a cricket ground?
- A know simple query is such a know query that can be described in very little amount of words.
- A know simple query would only get the fully meet ratings if the result shown has the result in a special result block or it is shown upfront. You don't need to open a link to get the answer in such scenario.
