# Tag Archives: cpu-scheduling

## Operating Systems | CPU Scheduling | Question 7August 21, 2017

The most optimal scheduling algorithm is : (A) First come first serve (FCFS) (B) Shortest Job First (SJF) (C) Round Robin (RR) (D) None of… Read More »

## Program for Priority Scheduling | Set 1May 17, 2017

Priority scheduling is a non-preemptive algorithm and one of the most common scheduling algorithms in batch systems. Each process is assigned a priority. Process with… Read More »

## Program for Banker’s Algorithm | Set 1 (Safety Algorithm)April 7, 2017

Prerequisite: Banker’s Algorithm The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum… Read More »

## Program for FCFS Scheduling | Set 2 (Processes with different arrival times)March 9, 2017

We have already discussed FCFS Scheduling of processes with same arrival time. In this post, scenario when processes have different arrival times are discussed. Given… Read More »

## Program for Round Robin scheduling | Set 1February 28, 2017

Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way. It is simple, easy to… Read More »

## Program for Shortest Job First (or SJF) scheduling | Set 1 (Non- preemptive)February 24, 2017

Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next.… Read More »

## Program for FCFS Scheduling | Set 1February 22, 2017

Given n processes with their burst times, the task is to find average waiting time and average turn around time using FCFS scheduling algorithm. First… Read More »

## Operating Systems | CPU Scheduling | Question 6June 15, 2015

Which of the following is FALSE about SJF (Shortest Job First Scheduling)? S1: It causes minimum average waiting time S2: It can cause starvation (A)… Read More »

## Operating Systems | CPU Scheduling | Question 5March 19, 2013

If the quantum time of round robin algorithm is very large, then it is equivalent to: (A) First in first out (B) Shortest Job Next… Read More »

## Operating Systems | CPU Scheduling | Question 4

Which of the following process scheduling algorithm may lead to starvation (A) FIFO (B) Round Robin (C) Shortest Job Next (D) None of the above… Read More »

## Operating Systems | CPU Scheduling | Question 3February 2, 2013

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches… Read More »

## Operating Systems | CPU Scheduling | Question 2

Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20%… Read More »

## Operating Systems | CPU Scheduling | Question 1

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero.… Read More »