<h2>
<u>ANSWER</u><u>:</u></h2>
- <u>TRUE</u>
- <u>FALSE</u>
- <u>FALSE</u>
- <u>TRUE</u>
- <u>TRUE</u>
<h2>
<u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u><u>_</u></h2>
<u>CARRY</u><u> </u><u>ON</u><u> LEARNING</u>
<u>CAN</u><u> </u><u>YOU</u><u> BRAINLEST</u><u> ME</u><u> PLEASE</u>
Talk about cyber bullying but also all of the advancement and conviences of technology
Hope that helps
Answer: Stratified sample
Explanation:
For preparing samples of various data of companies and enterprises we need to apply probability distribution to different samples of data. Here in the question we are to apply a representative sample from a list of 200 customers who have complained about errors in their statement. So here we can apply stratified sampling where we can divide the 200 customers into separate groups. These sub groups of the customers are known as stratas. These stratas are selected based on certain characteristics which can be identified among the customers group. Here we can form subgroups based on the type of complain that has been lodged by the customer and selecting 5 customers from four zip codes. Then it would be easy to apply probability distribution to the sub groups to derive information from them.
This process would also enable a more easier and cheaper way of sampling the customer data.
Answer:
C++ code explained below
Explanation:
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int FiboNR(int n)
{
int max=n+1;
int F[max];
F[0]=0;F[1]=1;
for(int i=2;i<=n;i++)
{
F[i]=F[i-1]+F[i-2];
}
return (F[n]);
}
int FiboR(int n)
{
if(n==0||n==1)
return n;
else
return (FiboR(n-1)+FiboR(n-2));
}
int main()
{
long long int i,f;
double t1,t2;
int n[]={1,5,10,15,20,25,30,35,40,45,50,55,60,65,70,75};
cout<<"Fibonacci time analysis ( recursive vs. non-recursive "<<endl;
cout<<"Integer FiboR(seconds) FiboNR(seconds) Fibo-value"<<endl;
for(i=0;i<16;i++)
{
clock_t begin = clock();
f=FiboR(n[i]);
clock_t end = clock();
t1=double(end-begin); // elapsed time in milli secons
begin = clock();
f=FiboNR(n[i]);
end = clock();
t2=double(end-begin);
cout<<n[i]<<" "<<t1*1.0/CLOCKS_PER_SEC <<" "<<t2*1.0/CLOCKS_PER_SEC <<" "<<f<<endl; //elapsed time in seconds
}
return 0;
}
Answer:
* explains the whole paragraph what ever that is * there