Fill color is the answer hope this helps
Answer:
$751
Explanation:
From the question we have the following information;
Gross income = $1000.00
Deductions = $294.00
Now we know that;
Net income = Gross income - Deductions
Therefore;
Net income = $1000.00 - $294.00
Net income = $751
Answer:
Explanation:
We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.
To build a heap, the following algorithm is implemented for any input array.
BUILD-HEAP(A)
heapsize := size(A)
for i := floor(heapsize/2) downto 1
do HEAPIFY(A, i)
end for
Convert the given array of elements into an almost complete binary tree.
Ensure that the tree is a max heap.
Check that every non-leaf node contains a greater or equal value element than its child nodes.
If there exists any node that does not satisfy the ordering property of max heap, swap the elements.
Start checking from a non-leaf node with the highest index (bottom to top and right to left).
Answer:
// here is code in c++ to find the approx value of "e".
#include <bits/stdc++.h>
using namespace std;
// function to find factorial of a number
double fact(int n){
double f =1.0;
// if n=0 then return 1
if(n==0)
return 1;
for(int a=1;a<=n;++a)
f = f *a;
// return the factorial of number
return f;
}
// driver function
int main()
{
// variable
int n;
double sum=0;
cout<<"enter n:";
// read the value of n
cin>>n;
// Calculate the sum of the series
for (int x = 0; x <= n; x++)
{
sum += 1.0/fact(x);
}
// print the approx value of "e"
cout<<"Approx Value of e is: "<<sum<<endl;
return 0;
}
Explanation:
Read the value of "n" from user. Declare and initialize variable "sum" to store the sum of series.Create a function to Calculate the factorial of a given number. Calculate the sum of all the term of the series 1+1/1!+1/2!.....+1/n!.This will be the approx value of "e".
Output:
enter n:12
Approx Value of e is: 2.71828
Answer:
I think its plain text but I might be wrong
