Answer: 4500 grams
Step-by-step explanation: 1 kilogram is 1,000 grams, so 4 kilograms is 4,000 grams, and half a kilogram is 500 grams. So, 4000 + 500 = 4,500
Answer:
Income tax refers to money the company owes based on its earnings. Sales tax refers to money the company collects from customers and sends to the state tax collector. Payroll taxes refer to money the company owes based on the wages it pays its employees.
Step-by-step explanation:
Answer: 13.722 km ; or, write as: 13 13/18 km .
___________________________________________________
Explanation:
___________________________________________________
Area = Length * width ;
___________________________________________________
or, write as: A = L * w ;
________________________
Given: A = 247 km² ;
L = 18 km ;
w = "y" ;
________________________
Find: "y"
______________________________
A = L * w ;
______________________________
Plug in our values:
______________________________
247 km² = 18 km * "y" ; solve for "y" (in units of "km") ;
_____________________________
18 y = 247 ;
___________________________________________________________
Divide each side of the equation by "18"; to isolate "y" on one side of the equation; and to solve for "y" :
___________________________________________________________
18 y / 18 = 247 / 18 ;
_____________________________________________
to get:
_____________________________________________
y = 13.7222222222222222...... km ; round to: 13.722 km
or; y = 13 13/18 km .
_______________________________________________
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;
}
