Question

c++ code for multi-level feedback queue with 3 queues with no priority defined for any process. and first queue following fcfs, second and third queue following sjf and round robin. Time quanta calculated by mean and median

Answer 1

The C++ code for a multi-level feedback queue can be implemented using three queues with different scheduling algorithms: FCFS, SJF, and Round Robin. The time quantum for the Round Robin algorithm can be calculated using the mean and median of the processes' burst times.

Step-by-step explanation:

The C++ code for a multi-level feedback queue can be implemented using three queues with different scheduling algorithms. In this case, the first queue follows the First-Come, First-Served (FCFS) algorithm. The second and third queues follow the Shortest Job First (SJF) algorithm and the Round Robin algorithm, respectively. The time quantum for the Round Robin algorithm can be calculated using the mean and median of the processes' burst times.