//Fifo Techinique of Paging #include #include #include #include int seq,f,p,gd=DETECT,gm,q[20],front=0,rear=0,x=200,y=50,pgflt=0; void draw(int ,int); void insert(int); void replace(int); int doesntexist(int); void draw(); void main() { clrscr(); initgraph(&gd,&gm,"E:\\Turboc\\bgi"); cout<<"\t\t\t\tFIFO\n"; cout<<"--------------------------------------------------------------\n\n"; cout<<"Enter the no. of frames\n:"; cin>>f; cout<<"Enter the no. of Pages\n:"; cin>>p; cout<<"Enter the Sequence of Pages:\n"; for(int i=0;i>seq; if(doesntexist(seq)==1) { pgflt++; q[rear]=seq; rear=(rear+1)%f; } x=x+30; draw(x,y); } void replace(int v) { if(front==rear) cout<<"\n\nEmpty\n\n"; else { q[front]=v; front=(front+1)%f; } } int doesntexist(int v) { for(int i=0;i