New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Guess the scheduling algorithm

Crossword Puzzle

Played 1

About this activity

To understand the types scheduling algorithms and where they are used

Created by

India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Guess the scheduling algorithm
 

Crossword Puzzle

Guess the scheduling algorithmOnline version

To understand the types scheduling algorithms and where they are used

by Shravani Patil
1

The process that arrives first in the ready queue is executed first, following a non-preemptive scheduling approach.

2

The process with the shortest execution time is selected next, reducing overall waiting time but potentially causing starvation for longer processes.

3

A preemptive version of SJF where the currently executing process can be interrupted if a new process with a shorter remaining time arrives.

4

Each process is assigned a fixed time slice (quantum) and is executed in a cyclic order, ensuring fair CPU allocation among all processes.

5

Each process is assigned a priority, and the CPU is allocated to the process with the highest priority, either preemptively or non-preemptively.

1
2
4
5
3
Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.