## C++ Program of Simpson’s 1/3rd Rule for the Evaluation of Definite Integrals

//Simpson's 1/3rd Rule for Evaluation of Definite Integrals #include<iostream> #include<cmath> using namespace std; double f(double x) { double a=1/(1+x*x); //write the function whose…

## C++ Program for Trapezoidal Rule for the Evaluation of Definite Integrals

//Trapezoidal Method for the evaluation of Definite Integrals #include<iostream> #include<cmath> using namespace std; double f(double x) //write the function whose definite integral is…

## C++ Program for Secant Method to find the roots of an Equation

//Secant Method for finding the roots of an equation #include<iostream> #include<iomanip> #include<cmath> using namespace std; double f(double x); //declare the function for the…

## C++ Program for Newton-Raphson Method to find the roots of an Equation

//Newton-Raphson Method #include<iostream> #include<cmath> #include<iomanip> using namespace std; double f(double x); //declare the function for the given equation double f(double x) //define the…

## C++ Program for Bisection Method to find the roots of an Equation

//bisection method #include<iostream> #include<cmath> #include<iomanip> using namespace std; double f(double x); //declare the function for the given equation double f(double x) //define the…

## C++ Program to generate 100 Prime Nos.

#include<iostream> #include<cmath> using namespace std; int prime(int n); //function for checking if the no. is prime or not int prime(int n) { int…

## C++ Program to sort a list (descending order)

//sort_desc #include <iostream> using namespace std; int main() { int n; //size of list int i,j; //for loops for reading, swapping etc double…

## C++ Program to sort a list of nos. (ascending order)

//sort a list(ascending) #include <iostream> using namespace std; int main() { int i,n,j; double temp; cout<<"Enter the size of the list"<<endl; cin>>n; cout<<"Enter…