Answer:
The answer to this question is given below in the explanation section.
Explanation:
This program is written in C++.
#include <iostream>
using namespace std;
int main()
{
string word;// variable for taking user input
int cond;// to set condition true if user preses the stop and exit from loop
cout<<"Enter word: \n";
cin>>word;
do// start while loop
{
if(word=="stop" || word =="STOP" || word == "Stop")// if user enter word stop, then program exit
{
cond=0;
}
else//otherwise loop continue
{
cout<<" You Entered "+ word +"\n";
cout<<"Enter word: \n";
cin>>word;
cond=1;
}
}
while(cond == 1);// if user don't enter word "stop" loop run continuesly.
cout<<"Program exit";
return 0;
}
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 − )
The best thing to do when an error message appears when it is not supposed to, as in if you are blocked by an administrator and it appears then its supposed to, it is best to contact someone who can investigate whether or not something is happening to your computer. That could be a parent, if they are good with computers, or just tech support at a store, provided they also know computers. Most of the time your computer just makes a mistake so nothing to worry about, but make sure to have it checked just to be sure.
Answer:
This should not be typed in brainly. Brainly is for answering questions
Explanation:
