Instructions

 Write down the program in correct way with proper alignment and spacing
 Write Aim, Algorithm, Program and Output for the question have given to you
 If program doesn’t successfully execute, write down only sample output for the program
 Save your program with your SETNO_ROLLNO.c or java, Ex: 3_R161666.c
 You must upload the program after completion of the exam

 Set-1

In Round Robin process scheduling algorithm, the efficiency of the system depends on
the time quantam. Is the statement true or false ? Write a program to implement the
Round algorithm with variable time quantum like 2,4,6 time units and analyse the
performance of the system by seeing the values of waiting times and turn around
times.

Input : number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)
and time quantum

Output : gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) of each process response time (rs_ti) and schedule length, and maintain
queue to represents the next process gets scheduled and also find out the
throughput??
 Set-2

Write a program to implement Non-preemptive Highest Response Ratio Next (HRRN)

process scheduling algorithm? i.e., the selection of process is depends on Highest
𝑤𝑎𝑖𝑡𝑖𝑛𝑔 𝑡𝑖𝑚𝑒+𝑏𝑢𝑟𝑠𝑡 𝑡𝑖𝑚𝑒
response ratio of that process. 𝐻𝑅𝑅 = 𝑏𝑢𝑟𝑠𝑡 𝑡𝑖𝑚𝑒

Input : number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output : gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-3

Write a program to implement Longest Remaining Time First (LRTF) process

scheduling algorithm?

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-4

Write a program to implement Shortest Remaining time first (SRTF) process

scheduling algorithm ?

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-5

Write a program to implement the Shortest Job First(SJF) process scheduling

algorithm??

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-6

Write a program to implement the Non-preemptive Longest Job First (LJF) process
scheduling algorithm ??

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-7

Consider a hypothetical process scheduling policy of an operating system which gives

Non-preemptive priority process scheduling algorithm?? If the input of process
priority always takes descending order i.e., higher number takes as higher priority
and lower number takes as lower priority.

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??
 Set-8

Consider a hypothetical process scheduling policy of an operating system which gives

preemptive priority process scheduling algorithm?? If the input of process priority
always takes ascending order i.e., lower number takes as higher priority and higher
number takes as lower priority.

Input: number of processes(n), process ids (pi), arrival times(a_ti), burst times(b_ti)

Output: gang chart, completion times (c_ti), waiting times (w_ti) and turn around
times(ta_ti) and response time of each process and schedule length and also find out
the throughput??