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;
}
we know there are 180° in π radians, how many degrees then in -3π/10 radians?
![\bf \begin{array}{ccll} degrees&radians\\ \cline{1-2} 180&\pi \\\\ x&-\frac{3\pi }{10} \end{array}\implies \cfrac{180}{x}=\cfrac{\pi }{~~-\frac{3\pi }{10}~~}\implies \cfrac{180}{x}=\cfrac{\frac{\pi}{1} }{~~-\frac{3\pi }{10}~~} \\\\\\ \cfrac{180}{x}=\cfrac{\pi }{1}\cdot \cfrac{10}{-3\pi }\implies \cfrac{180}{x}=-\cfrac{10}{3}\implies 540=-10x\implies \cfrac{540}{-10}=x \\\\[-0.35em] \rule{34em}{0.25pt}\\\\ ~\hfill -54=x~\hfill](https://tex.z-dn.net/?f=%5Cbf%20%5Cbegin%7Barray%7D%7Bccll%7D%20degrees%26radians%5C%5C%20%5Ccline%7B1-2%7D%20180%26%5Cpi%20%5C%5C%5C%5C%20x%26-%5Cfrac%7B3%5Cpi%20%7D%7B10%7D%20%5Cend%7Barray%7D%5Cimplies%20%5Ccfrac%7B180%7D%7Bx%7D%3D%5Ccfrac%7B%5Cpi%20%7D%7B~~-%5Cfrac%7B3%5Cpi%20%7D%7B10%7D~~%7D%5Cimplies%20%5Ccfrac%7B180%7D%7Bx%7D%3D%5Ccfrac%7B%5Cfrac%7B%5Cpi%7D%7B1%7D%20%7D%7B~~-%5Cfrac%7B3%5Cpi%20%7D%7B10%7D~~%7D%20%5C%5C%5C%5C%5C%5C%20%5Ccfrac%7B180%7D%7Bx%7D%3D%5Ccfrac%7B%5Cpi%20%7D%7B1%7D%5Ccdot%20%5Ccfrac%7B10%7D%7B-3%5Cpi%20%7D%5Cimplies%20%5Ccfrac%7B180%7D%7Bx%7D%3D-%5Ccfrac%7B10%7D%7B3%7D%5Cimplies%20540%3D-10x%5Cimplies%20%5Ccfrac%7B540%7D%7B-10%7D%3Dx%20%5C%5C%5C%5C%5B-0.35em%5D%20%5Crule%7B34em%7D%7B0.25pt%7D%5C%5C%5C%5C%20~%5Chfill%20-54%3Dx~%5Chfill)
Answer:
91
Step-by-step explanation:
Answer:
n≅376
So sample size is 376.
Step-by-step explanation:
The formula we are going to use is:
where:
n is the sample size
p is the probability of favor
q is the probability of not in favor
E is the Margin of error
z is the distribution
α=1-0.98=0.02
α/2=0.01
From cumulative standard Normal Distribution
p is taken 0.5 for least biased estimate, q=1-p=0.5
n≅376
So sample size is 376
It will take five hours and twenty five minutes
