OUTPUTS

RoundRobinFinal.c OUTPUT

Enter the number of process : 4
Enter the Process no., Arrival time and Burst time of :-
Process : 1 2 2
Process : 2 5 6
Process : 3 0 4
Process : 4 4 7
Enter the time quantum : 3
GANTT CHART
0  P3  3  P1  5  P3  6  P4  9  P2  12  P4  15  P2  18  P4  19
Process no.     Burst time      Turnaround time Waiting time
P3              4               6               2
P1              2               3               1
P4              7               15              8
P2              6               13              7
Average Turnaround time = 9.250000
Average Waiting time = 4.500000

Disk SCAN with Previous position

Forward

Enter the current head position : 43
Enter the previous position : 30
Enter the number of request : 5
Enter the request : 60 77 40 20 35
The sequence is : 43 -> 60 -> 77 -> 199 -> 40 -> 35 -> 20
Total head movement = 335

Backward

Enter the current head position : 43
Enter the previous position : 50
Enter the number of request : 5
Enter the request : 60 77 40 20 35
The sequence is : 43 -> 40 -> 35 -> 20 -> 0 -> 60 -> 77
Total head movement = 120

Disk C-SCAN with Previous position

Forward

Enter the current head position : 53
Enter the previous position : 40
Enter the number of request : 8
Enter the request : 98 183 37 122 14 124 65 67
The sequence is : 53 -> 65-> 67-> 98-> 122-> 124-> 183 -> 199 -> 0-> 14-> 37
Total head movement = 382

Backward

Enter the current head position : 53
Enter the previous position : 60
Enter the number of request : 8
Enter the request : 98 183 37 122 14 124 65 67
The sequence is : 53 -> 37 -> 14 -> 0 -> 199 -> 183 -> 124 -> 122 -> 98 -> 67 -> 65
Total head movement = 571

Bankers Algorithm

Safe sequence

Enter the number of processes : 5 
Enter the number of resources : 3
Enter the allocation matrix for each process :
P0 : 0 1 0
P1 : 2 0 0
P2 : 3 0 2
P3 : 2 1 1
P4 : 0 0 2
Enter the maximum matrix for each process :
P0 : 7 5 3
P1 : 3 2 2
P2 : 9 0 2 
P3 : 2 2 2
P4 : 4 3 3
Enter the available resources : 3 3 2
Following is system is safe and the SAFE Sequence is :
P1 -> P3 -> P4 -> P0 ->  P2

Unsafe

Enter the number of processes : 5
Enter the number of resources : 3
Enter the allocation matrix for each process :
P0 : 0 1 0
P1 : 2 0 0
P2 : 3 0 2
P3 : 2 1 1
P4 : 0 0 2
Enter the maximum matrix for each process :
P0 : 7 5 3
P1 : 3 4 2
P2 : 9 0 2
P3 : 2 5 3
P4 : 4 3 3
Enter the available resources : 3 3 2
The following system is not safe

Semaphore

1 : Producer
2 : Consumer
3 : Exit
Enter the choice : 1
Producer produces the item : 1
Enter the choice : 1
Producer produces the item : 2
Enter the choice : 1
Buffer is full
Enter the choice : 2
Consumer consumes the item : 2
Enter the choice : 2
Consumer consumes the item : 1
Enter the choice : 2
Buffer is empty
Enter the choice : 3

First fit

Enter the no. of memory block and processes : 3 4
Enter the block size :- 
1 : 	200
2 : 	150
3 : 	80
Enter the process size :- 
1 : 	140
2 : 	50
3 : 	70
4 : 	130
Process No.	Process Size	Block no.
1		140		1
2		50		1
3		70		2
4		130		Not Allocated

Best_Fit

Enter the number of memory blocks and processes: 3 4
Enter the block sizes:
1 : 200
2 : 150
3 : 80
Enter the process sizes:
1 : 140
2 : 50
3 : 70
4 : 130
Process No.	Process Size	Block no.
1		140		2
2		50		3
3		70		1
4		130		1

Worst_Fit

Enter the number of memory blocks and processes: 3 4
Enter the block sizes:
1 : 200
2 : 150
3 : 80
Enter the process sizes:
1 : 140
2 : 50
3 : 70
4 : 130
Process No.	Process Size	Block no.
1		140		1
2		50		2
3		70		2
4		130		Not Allocated

FIFO Paging

Enter the number of reference string : 7
Enter the no. of frames : 3
Enter the reference string : 1 3 0 3 5 6 3
1 : 1  -  -  
3 : 1  3  -  
0 : 1  3  0  
3 : -  -  -  
5 : 5  3  0  
6 : 5  6  0  
3 : 5  6  3  
Page fault = 6