Loop cards are a great game that can be played individually or as a class. They are perfect for review key vocabulary or questions at the end of a topic or when revising for an exam.
Instructions
Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
Now start joining each question on the right hand side of the card to the matching answer on the next card.
Carry on until all the cards loop together and you have competed the game!
Hint: Make sure that you set your paper to portrait to print 4 cards per sheet of A4 paper.
A scheduling algorithm where each process is assigned a fixed time unit or quantum to execute before moving on to the next process in a circular manner.
Non-Preemptive
A type of scheduling where a task cannot be interrupted and must complete its execution before another task can be executed.
Task
A unit of work or activity that needs to be executed by a computer system.
Scheduling
The process of determining the order in which tasks are executed by a computer system.
Benchmarking
The process of comparing the performance of a processor against standard reference points or other processors.
Turnaround Time
The total time taken by a process from arriving in the system to its completion.
Backfilling
A scheduling technique where a job is allowed to run if resources become available before its designated start time.
Data Hazard
A type of pipeline hazard where a later instruction depends on the result of an earlier instruction that has not yet completed.
Starvation
A situation where a process is denied CPU time due to the presence of higher priority processes.
Scheduling Algorithm
A method used to determine the order in which processes are executed by the CPU based on certain criteria such as priority, fairness, and efficiency.