YOU ARE DOWNLOADING DOCUMENT

Please tick the box to continue:

Transcript

G. L. Bajaj Institute of Technology & Management

Plot no. 2, Knowledge Park III, Greater Noida, UP-201308

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

G. L. Bajaj Institute of Technology & ManagementGreater Noida

Uttar Pradesh Technical UniversityLucknow

G.L. Bajaj Institute of Technology & Management

B. TECH.

Computer Science & Engineering Department

(Session: 2013-14) ODD SEMESTER

Batch (2011-15)

THIRD YEAR (V SEMESTER)

OS LAB FILE

Submitted to Submitted ByMr. Laxmi Kant Sagar Brij Bhushan Singh

(1219210901)CONTENTS

S.No.NAME OF THE PROGRAMDateRemark

1.WAP to implement First Come First Serve (FCFS) Scheduling

2.WAP to implement shortest job first (SJF) scheduling

3.WAP to implement Priority based scheduling

4.WAP to implement Dinning Philosophers

5.WAP to implement FIFO page replacement algorithm

6.WAP to implement LRU page replacement algorithm

7.Write a program to implement Round Robin

8.WAP to implement Optimal page replacement algorithm

9.WAP to implement DeadLock Detection

10.WAP to implement WORST FIT algorithm

11.WAP to implement Sleeping Barber Problem

PROGRAM 1

Write a program to implement First Come First Serve (FCFS) Scheduling.

#include

#include

void main()

{

int i,j,n,at,bt,temp,temp1,temp2,awt[50],c,c_loc;

floatawtime,att[50],burst,attime,a_wait;

int mat[50][3];

clrscr();

printf("Enter the no. of processes:");

scanf("%d",&n);

for(i=0;i


Related Documents