Answer:
39.9
Step-by-step explanation:
A good trick to remember is SOH CAH TOA.
Sine = Opposite / Hypotenuse
Cosine = Adjacent / Hypotenuse
Tangent = Opposite / Adjacent
Here, we're given an angle and the opposite side, and we want to find the adjacent side. So we need to use tangent.
tan 31° = 24 / x
x = 24 / tan 31°
x ≈ 39.9
The probability of 5 movie downloads would be about 1 to 2 percent
Answer:
C. But be careful. It depends if you have been told what I was having trouble with.
Step-by-step explanation:
The question is a little unclear. If the actual interest is constant for all situations, the answer is C. The more times you compound, the more interest you will accumulate. Banks don't do it that way. It they compound every three months, then they cut the interest rate by a quarter.
So the interest would look like (1 + 0.022/4)*principle. Whoever made the question has to make clear what is going on. My guess is the intended answer is C.
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;
}
Every line on the graph is 1/2 unit.
When y = 0, x would be -0.25 and 1.25
When y = 2, x would be -0.5 and 1.5
