Posts

Gauss Jecobi program

#include<iostream> using namespace std; int main() {     int n,i,j,it=0;     cin>>n;     float mat[n][n+1],x[50]={0},y[50],sum=0;     for(i=0;i<n;i++)     {         for(j=0;j<n+1;j++)         {             cin>>mat[i][j];         }     }     do{     for(i=0;i<n;i++)     {        for(j=0;j<n;j++)         {             if(i==j)             {                 continue;             }   ...
Post a Comment
Read more

bairstow method code

#include<iostream> #include<cstdlib> #include<math.h> using namespace std; int main() {     int n,i,N1,e;           float p,q,r,pr,qr,ps,qs,D,jam1,jam2,s,k;     cin>>N1>>n>>p>>q>>e;     float a[n],b[n-1],dpb[n-1],dqb[n-1];     for(i=0;i<=n;i++)         {             cin>>a[i];     }     while(N1--){             b[n-2]=a[n];             b[n-3]=a[n-1]-p*b[n-2];             for(i=2;i<=n-2;i++)             {                 b[n-(i...
Post a Comment
Read more

Optimal page replacement algorithm in c++

#include<bits/stdc++.h> using namespace std; int main() {     int f,p,j=0,x,pf=0,h=0,m,i,index,u,e=0,w,g;     int arr[1000]={0};     vector<int>o;     std::vector<int>::iterator it;     cout<<"Enter no of pages"<<endl;     cin>>p;     cout<<"Enter the reference string"<<endl;     for(i=0;i<p;i++)     {         cin>>x;         o.push_back(x);     }     cout<<"Enter no of frames"<<endl;     cin>>f;     vector<int>a(f,-1);     while(j<p)     {         m=0,e=0,g=0;         if(j<=f-1)     {        ...
Post a Comment
Read more