Header Ads Widget

Questions and answer based on Operating system .

  Operating system MCQs:-

  1. What does the value of program counter (PC) indicate? Answer: The value of program counter (PC) indicates the address of the next instruction of the process being executed.

  2. What is a Process Control Block (PCB)? Answer: Each process is represented by a Process Control Block (PCB).

  3. What is the purpose of process scheduling? Answer: The purpose of process scheduling is to allocate the CPU to different processes in a way that maximizes CPU utilization, fairness, throughput, and minimizes turnaround time, waiting time, and response time.

  4. What is Arrival Time in process scheduling? Answer: Arrival Time is the time at which the process arrives in the ready queue.

  5. What is Completion Time in process scheduling? Answer: Completion Time is the time at which process completes its execution.

  6. What is Burst Time in process scheduling? Answer: Burst Time is the time required by a process for CPU execution.

  7. What is Turn Around Time in process scheduling? Answer: Turn Around Time is the time difference between completion time and arrival time. Turn Around Time = Completion Time - Arrival Time.

  8. What is Waiting Time (WT) in process scheduling? Answer: Waiting Time (WT) is the time difference between turn around time and burst time. Waiting Time = Turn Around Time - Burst Time.

  9. What is the objective of process scheduling algorithm? Answer: The objective of process scheduling algorithm is to allocate the CPU to different processes in a way that maximizes CPU utilization, fairness, throughput, and minimizes turnaround time, waiting time, and response time.

  10. What is Round Robin (RR) Scheduling? Answer: Round Robin (RR) Scheduling is a scheduling algorithm in which each process is assigned a fixed time, in cyclic way.

  11. What is Priority Based scheduling (Non Preemptive)? Answer: Priority Based scheduling (Non Preemptive) is a scheduling algorithm in which processes are scheduled according to their priorities, i.e., the highest priority process is scheduled first. If priorities of two processes match, then scheduling is according to the arrival time.

  12. What is Multilevel Queue Scheduling (MLQ)? Answer: Multilevel Queue Scheduling (MLQ) is a scheduling algorithm in which according to the priority of process, processes are placed in different queues. Generally, high priority processes are placed in the top-level queue. Only after completion of processes from the top-level queue, lower level queued processes are scheduled.

  13. What is Multilevel Feedback Queue (MLFQ) Scheduling? Answer: Multilevel Feedback Queue (MLFQ) Scheduling allows the process to move between queues. The idea is to separate processes according to the characteristics of their CPU bursts. If a process uses too much CPU time, it is moved to a lower-priority queue.

  14. Which scheduling algorithm is optimal in terms of average waiting time for a given set of processes? Answer: Shortest Job First (SJF) scheduling algorithm is optimal in terms of average waiting time for a given set of processes.

  15. What is the Response Ratio in HRRN scheduling? Answer: The Response Ratio is (Waiting Time + Burst time) / Burst time in HRRN scheduling.