Answer:
table; occur; tally mark
Step-by-step explanation:
You would use a table to keep track of a distribution of data. You would have to wait for such data to occur. You could use tally marks to keep track to the data.
Hope this helps.
Sorry if it's wrong though.
Answer:
16 bicycles and 21 tricycles
Step-by-step explanation:
Both bicycles and tricycles have 1 set of handlebars. Bicycles have 2 wheels while tricycles have 3.
Using this information, set up a system of equations, where b is the number of bicycles and t is the number of tricycles:
b + t = 37
2b + 3t = 95
Solve by elimination by multiplying the top equation by -2:
-2b - 2t = -74
2b + 3t = 95
t = 21
Then, plug in 21 as t into one of the equations:
b + t = 37
b + 21 = 37
b = 16
So, there are 16 bicycles and 21 tricycles
Answer:
Test statistic, 
(to 3 dp)
Step-by-step explanation:
Deviation, d = x -y
Sample mean for the deviation
Standard deviation: 
SD =2.93
Under the null hypothesis, the formula for the test statistics will be given by:
Answer:
Algorithm
Start
Int n // To represent the number of array
Input n
Int countsearch = 0
float search
Float [] numbers // To represent an array of non decreasing number
// Input array elements but first Initialise a counter element
Int count = 0, digit
Do
// Check if element to be inserted is the first element
If(count == 0) Then
Input numbers[count]
Else
lbl: Input digit
If(digit > numbers[count-1]) then
numbers[count] = digit
Else
Output "Number must be greater than the previous number"
Goto lbl
Endif
Endif
count = count + 1
While(count<n)
count = 0
// Input element to count
input search
// Begin searching and counting
Do
if(numbers [count] == search)
countsearch = countsearch+1;
End if
While (count < n)
Output count
Program to illustrate the above
// Written in C++
// Comments are used for explanatory purpose
#include<iostream>
using namespace std;
int main()
{
// Variable declaration
float [] numbers;
int n, count;
float num, searchdigit;
cout<<"Number of array elements: ";
cin>> n;
// Enter array element
for(int I = 0; I<n;I++)
{
if(I == 0)
{
cin>>numbers [0]
}
else
{
lbl: cin>>num;
if(num >= numbers [I])
{
numbers [I] = num;
}
else
{
goto lbl;
}
}
// Search for a particular number
int search;
cin>>searchdigit;
for(int I = 0; I<n; I++)
{
if(numbers[I] == searchdigit
search++
}
}
// Print result
cout<<search;
return 0;
}
I think the answer is d. The slope of AC=Slope of DF.
Hope this helped☺☺
