System Programming & Operating System Lab I

 TYBCS SEM I SYS-PRO :- 

👉 Assignment 1

👉 Assignment 2

👉 Assignment 3

👉 Assignment 4

👉 Assignment 5

TYBCS SEM II SYS-PRO :- 

👉 Assignment 1

👉 Assignment 2

Write the program to simulate FCFS CPU-scheduling. The arrival time and first CPU-burstfor different n number of processes should be input to the algorithm. Assume the fixed IO waiting time (2 units). The next CPU-burst should be generated randomly. The output should give Gantt chart, turnaround time and waiting time for each process. Also find the average waiting time and turnaround time.

Write the program to simulate Non-preemptive Shortest Job First (SJF) -scheduling. The
arrival time and first CPU-burst for different n number of processes should be input to
the algorithm. Assume the fixed IO waiting time (2 units). The next CPU-burst should be
generated randomly. The output should give Gantt chart, turnaround time and waiting

time for each process. Also find the average waiting time and turnaround time.

Write the program to simulate Preemptive Shortest Job First (SJF) -scheduling. The
arrival time and first CPU-burst for different n number of processes should be input to
the algorithm. Assume the fixed IO waiting time (2 units). The next CPU-burst should be
generated randomly. The output should give Gantt chart, turnaround time and waiting

time for each process. Also find the average waiting time and turnaround time. 

 

👉 Assignment 3

👉 Assignment 4

    FIFO

    LRU

    MFU

    LFU

👉 Assignment 5

    i. Write a program to simulate Linked file allocation method. Assume disk with n number of blocks. Give value of n as input. Write menu driver program with menu options as mentioned above and implement each option.

ii. Write a program to simulate Indexed file allocation method. Assume disk with n number of blocks. Give value of n as input. Write menu driver program with menu options as mentioned above and implement each option.