What is the primary objective of process management in an operating system?
a) To allocate CPU time to processes
b) To ensure efficient memory usage
c) To monitor network traffic
d) To organize files on the disk
Which of the following is the first state in the process life cycle?
a) Running
b) Ready
c) New
d) Terminated
What is the purpose of the CPU scheduler?
a) To allocate memory to processes
b) To decide which process gets to use the CPU next
c) To monitor disk usage
d) To assign priorities to processes
Which scheduling algorithm selects the process that has been waiting the longest?
a) Round Robin
b) First-Come, First-Served (FCFS)
c) Shortest Job Next (SJN)
d) Priority Scheduling
In which state is a process when it is waiting for an event, such as I/O completion?
a) Running
b) Ready
c) Blocked
d) Terminated
What is the main disadvantage of the First-Come, First-Served (FCFS) scheduling algorithm?
a) It leads to high CPU utilization
b) It can result in the “convoy effect,” where short processes are delayed
c) It gives priority to high-priority processes
d) It requires complex data structures
Which CPU scheduling algorithm assigns time slices to each process in the system?
a) Round Robin
b) Shortest Job First
c) Priority Scheduling
d) First-Come, First-Served
What is the key concept of Shortest Job First (SJF) scheduling?
a) Assigning the CPU to the shortest process first
b) Giving priority to processes with the highest priority
c) Giving the CPU to processes in the order they arrive
d) Scheduling processes in a round-robin fashion
Which scheduling algorithm can result in starvation of low-priority processes?
a) Round Robin
b) First-Come, First-Served
c) Priority Scheduling
d) Shortest Job First
Which of the following is an example of a preemptive CPU scheduling algorithm?
a) First-Come, First-Served
b) Round Robin
c) Shortest Job First
d) Priority Scheduling (non-preemptive)
In which of the following cases would you use the priority scheduling algorithm?
a) When all processes have equal priority
b) When certain processes need to be executed before others
c) When processes arrive in a continuous stream
d) When all processes have similar CPU burst times
What is the key advantage of the Round Robin scheduling algorithm?
a) It prevents starvation of low-priority processes
b) It minimizes waiting time for short processes
c) It reduces the need for context switching
d) It prioritizes important processes over others
Which of the following is a disadvantage of the Round Robin scheduling algorithm?
a) It can lead to a high turnaround time for large processes
b) It is inefficient for processes with widely varying burst times
c) It causes starvation of long-running processes
d) It requires high priority for I/O-bound processes
Which term refers to the time a process spends in the ready queue waiting for the CPU?
a) Turnaround time
b) Waiting time
c) CPU burst time
d) Response time
In which scheduling algorithm do you give priority to processes that have been waiting the longest?
a) Shortest Job First
b) First-Come, First-Served
c) Priority Scheduling
d) Round Robin
Which of the following scheduling algorithms minimizes the total waiting time?
a) Round Robin
b) First-Come, First-Served
c) Shortest Job First
d) Priority Scheduling
What does the term “context switch” refer to in process management?
a) The time taken to execute a process
b) The switching of process states from running to ready
c) The process of moving data between memory and disk
d) The saving and restoring of the state of a process when switching between processes
Which of the following is true about the Shortest Job First (SJF) scheduling algorithm?
a) It is non-preemptive
b) It gives the CPU to the longest process first
c) It is optimal in terms of minimizing average waiting time
d) It requires all processes to arrive at the same time
What is the main disadvantage of the Shortest Job First (SJF) scheduling algorithm?
a) It leads to high CPU utilization
b) It requires processes to have known burst times
c) It can cause starvation of long processes
d) It is difficult to implement
Which scheduling algorithm is known for its fairness in allocating CPU time?
a) First-Come, First-Served
b) Round Robin
c) Shortest Job First
d) Priority Scheduling
What does the term “turnaround time” refer to in process scheduling?
a) The total time a process spends in the ready queue
b) The total time from process submission to completion
c) The time spent waiting for the CPU
d) The time spent executing the process
In a multi-level queue scheduling algorithm, how are processes assigned to different queues?
a) Based on priority
b) Based on arrival time
c) Based on CPU burst time
d) Based on memory size
Which of the following is a characteristic of the Priority Scheduling algorithm?
a) It gives priority to the shortest process
b) It can lead to starvation of low-priority processes
c) It runs processes in a round-robin fashion
d) It does not require process priorities to be assigned
What does the term “response time” refer to in process scheduling?
a) The time a process waits for input from the user
b) The time a process waits for the CPU
c) The time from the submission of a request to the first response
d) The total time a process spends executing
Which of the following describes the First-Come, First-Served (FCFS) scheduling algorithm?
a) Processes are executed in the order they arrive in the ready queue
b) The CPU is allocated based on priority
c) The process with the shortest burst time is executed first
d) Each process is given an equal time slice
What is the main advantage of the Round Robin scheduling algorithm?
a) It is optimal in terms of CPU utilization
b) It ensures equal time for each process
c) It minimizes waiting time
d) It eliminates the possibility of starvation
