T = 5.34 + 0.78m
T = 5.34 + 0.78 * 5
T = 5.34 + 3.9
T = 9.24
Tina was charged $9.24 at the car wash for 5 minutes.
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;
}
Answer:
c= 18.4
Step-by-step explanation:
Since this is a right triangle, we can use trig functions
cos theta = adj/ hyp
cos theta = a/c
cos 57 = 10/c
Multiply each side by c
c cos 57 =10
Divide each side by cos 57
c = 10/cos 57
c=18.36078459
Rounding to the nearest tenth
c= 18.4
Answer:
5
Step-by-step explanation:
To divide fractions, we multiply the first fraction by the <u>reciprocal </u>of the second fraction. (Seven over one)
Now, we convert the fraction into a mixed fraction.
<em>The quotient of 5/6 and 1/7 is 5 5/6</em>
