WorksheetsUnderstanding OS Scheduling
Total questions: 10
Worksheet time: 5mins
What is the primary purpose of scheduling in an operating system?
To ensure all processes run simultaneously.
To manage the execution of processes and allocate CPU time efficiently.
To store data permanently in memory.
To increase the speed of hardware components.
Name two types of scheduling algorithms.
First-Come, First-Served (FCFS) and Round Robin (RR)
Weighted Round Robin (WRR) and Shortest Remaining Time First (SRTF)
Multi-Level Queue (MLQ) and Fair Share (FS)
Shortest Job First (SJF) and Priority Scheduling (PS)
What is the difference between preemptive and non-preemptive scheduling?
Preemptive scheduling is used for batch processing; non-preemptive scheduling is for real-time systems.
Preemptive scheduling allows processes to run indefinitely; non-preemptive scheduling interrupts them.
Preemptive scheduling interrupts processes; non-preemptive scheduling does not.
Preemptive scheduling is less efficient; non-preemptive scheduling is more efficient.
Explain the concept of context switching in scheduling.
Context switching is the method of increasing CPU speed by running multiple threads simultaneously.
Context switching refers to the process of merging multiple processes into a single thread for efficiency.
Context switching is the process of saving and restoring the state of a process or thread to allow multiple processes to share the CPU.
Context switching is the technique of allocating more memory to a single process to enhance performance.
What is a time quantum in the context of round-robin scheduling?
A time quantum is the maximum number of processes that can be scheduled at once.
A time quantum is the variable time period that changes with each process execution.
A time quantum is the fixed time interval allocated to each process in round-robin scheduling.
A time quantum is the total time a process can run before being terminated.
How does priority scheduling work?
Priority scheduling is based on the arrival time of processes.
Priority scheduling assigns CPU time equally to all processes.
Priority scheduling uses a round-robin approach for process allocation.
Priority scheduling allocates CPU to processes based on their priority levels.
What are the advantages of using multilevel queue scheduling?
Advantages include improved responsiveness for high-priority tasks, better resource allocation, reduced wait times, and the ability to handle diverse process types effectively.
Increased complexity in scheduling algorithms
Limited flexibility in process management
Higher overhead for low-priority tasks
Define the term 'throughput' in relation to scheduling.
Throughput refers to the maximum capacity of a system in scheduling.
Throughput is the total time taken to complete a task in scheduling.
Throughput is the number of tasks completed in a given time period in scheduling.
Throughput is the average duration of tasks scheduled over time.
What is the role of the ready queue in process scheduling?
The ready queue holds processes that are currently running on the CPU.
The ready queue prioritizes processes based on their memory usage.
The ready queue stores completed processes for future execution.
The ready queue manages processes waiting for CPU time in process scheduling.
How can starvation occur in scheduling algorithms?
Starvation is when all processes are given equal time slices in a scheduling algorithm.
Starvation happens when all processes are executed in a round-robin manner without priority.
Starvation occurs when processes are terminated before completion due to resource limits.
Starvation occurs when lower-priority processes are indefinitely delayed due to higher-priority processes continuously executing.
