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:
Radius = 14 cm = 0.00014 km
Circumference = 2πr = 2 × 22/7 × 14/100000 = 0.00088 km
As it went thousand times , distance covered = 0.00088 × 1000 = 0.88 km
Program testing is an evaluative process which is also called Unit Testing by the programmers.
Explanation:
Software testing is an important step in the software development process. The procedure analyzes the functionality of it and if it meets the specified requirements or not. This is a four-stage procedure that involves analysis, planning, development, setting the test environment, and finally the execution of the test.
The main stages of testing that will result in an error-free and quality product are-
- Unit testing
- Integration testing
- System testing
- Acceptance testing
Answer:
B. n-1
Explanation:
If there are n vertices then that vertex can be origin of at most n-1 edges.Suppose that you have a graph with 8 vertices you can select a vertex from these 8 vertices now you have 7 other vertices.So the vertex you selected can have at most 7 edges or it can be origin of at most 7 edges.So we conclude that the answer is n-1.
Yes insurance can help you