complete Tutorial String C++ 19 Sep 2011 | 04:42 am

Arrays of Characters Re-Introduction to Characters In our second lesson, we had a brief introduction to arrays of characters and strings. So far, we have avoided using them whenever we did not have ...

random numbers in file 13 Aug 2011 | 11:52 pm

#include<iostream> #include<conio.h> #include<math.h> #include<fstream> using namespace std; int main() { int ch; ofstream fout; ifstream fin; fout.open(“random.doc”); for(int i=0;i<10;i++)...

bucket creation 13 Aug 2011 | 11:51 pm

//bucket creation. for(ch1=’a',ch1<’z';ch1++) { for(ch=’a',i=0;i<26;i++;ch++) { ar[i][0]=ch1; ar[i][1]=ch; ar[i][2]=’/0′; ofstream fout(arr[i]); while(fin) { fin>>d; if(d>100*j && d<100*(j...

first come first served – fcfs 5 Aug 2011 | 11:49 pm

#include <iostream> #include <conio.h> using namespace std; int main () { int n,i,temp; cout<<”enter the no. of process”; cin>>n; int p[n]; for (i=0;i<n;i++) { cout<<”enter the burst time f...

priority 2 Aug 2011 | 11:47 pm

#include<iostream.h> #include<conio.h> int main() { cout<<”|||||Enter the Details|||||\n”<<endl; int n,i,j,t; cout<<”Enter no of Processes”; cin>>n; int p[n][3]; for(i=0;i<n;i++) { cout<<”E...

shortest job first SJF 24 Jul 2011 | 11:46 pm

// SJF-non_premitive #include<iostream.h> #include<conio.h> int main() { int n,i,j,k; cout<<”Enter no of process\n”; cin>>n; int p[n][2],seq[n],time=0,que[n],wt[n]; wt[0]=0; cout<<”|||||||||...

Round Robinn Operating System 8 Jul 2011 | 11:45 pm

minimum heap sort 4 Jul 2011 | 11:42 pm

#include <iostream> #include <cstdio> //#define heapsize int heapsize=0; using namespace std; void buildheap(int* a ,int length); void heapify(int* a,int i); void heapsort(int * a){ int length...

merge sort 2 Jul 2011 | 11:42 pm

#include <iostream> #include <fstream> using namespace std; void merge(int* a,int p,int q,int r); void merge_sort(int* a,int p,int r) { int q; if(p<r){ q=(p+r)/2; merge_sort(a,p,q); merge_so...

Insertion Sort 10 Jun 2011 | 11:41 pm

#include <iostream> #include <fstream> using namespace std; void insert_sort(int * a){ int i=1,j; int length=0; int key; cout<<”etryh”; while(a[i]!=NULL){ i++; length=length+1; } cout <<”\...