1/2 | 15 | 18 | |||||||||||||||||||||
3/13 | |||||||||||||||||||||||
19 | |||||||||||||||||||||||
4 | |||||||||||||||||||||||
5 | |||||||||||||||||||||||
6 | |||||||||||||||||||||||
17 | |||||||||||||||||||||||
7 | |||||||||||||||||||||||
14 | |||||||||||||||||||||||
8 | |||||||||||||||||||||||
9 | 16 | ||||||||||||||||||||||
10 | |||||||||||||||||||||||
11 | |||||||||||||||||||||||
12 | |||||||||||||||||||||||
1. The process of determining the order in which tasks are executed by a computer system.
2. 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.
3. The act of temporarily suspending a process's execution to allow another process to run.
4. The amount of time a process requires to complete its execution without any interruption.
5. The time at which a process enters the system and is ready to be executed by the CPU.
6. The fixed time unit allocated to each process in a Round Robin scheduling algorithm.
7. The sequence in which tasks or processes arrive at the system for execution.
8. The total time taken by a process from arriving in the system to its completion.
9. An instance of a running computer program that includes its current state and execution information.
10. The process of saving and restoring the state of a process when it is interrupted for execution by another process.
11. A scheduling technique where a job is allowed to run if resources become available before its designated start time.
12. A type of scheduling where a task cannot be interrupted and must complete its execution before another task can be executed.
13. A set of rules or guidelines that dictate how a particular task or process should be carried out.
14. A situation where a process is denied CPU time due to the presence of higher priority processes.
15. The sequence in which tasks or processes are actually executed by the system.
16. A type of scheduling where a task can be interrupted and moved out of the CPU before it has completed its execution.
17. The amount of time a process takes to complete its execution.
18. A scheduling algorithm where each process is assigned a fixed time slice to execute before being moved to the back of the ready queue.
19. The total time a process spends waiting in the ready queue before being executed.