Dear Aspirants,
Welcome to the Professional Knowledge Section in Affairscloud.com. Here we are providing sample questions in Operating System. It will be useful for the IBPS SO IT officer and SBI Assistant Manager(System). We have also included some important questions that are repeatedly asked in previous exams.
- Which of the following is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue?
A. Earliest deadline first (EDF)
B. First-Come First-Serve Scheduling(FCFS)
C. Round Robin Scheduling(RRS)
D. Multilevel Queue Scheduling(MQS)
E. None of theseA. Earliest deadline first (EDF)
Explanation:
Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue. - Which of the following is the module that gives control of the CPU to the process selected by the scheduler?
A. Device Driver
B. Scheduler
C. Dispatcher
D. All of these
E. None of theseC. Dispatcher
Explanation:
The dispatcher is the module that gives control of the CPU to the process selected by the scheduler. - Number of processes completed per unit time is termed as _____
A. Waiting time
B. Response time
C. Turnaround time
D. Throughput
E. None of theseD. Throughput
Explanation:
Number of processes that complete their execution per time unit. - The time taken in an interactive program from the issuance of a command to the commence of a response to that command is known as?
A. Waiting time
B. Response time
C. Turnaround time
D. Throughput
E. None of theseB. Response time
Explanation:
Response time is the interval between submission of a request. - Which of the following is time required for a particular process to complete, from submission time to completion.?
A. Waiting time
B. Response time
C. Turnaround time
D. Throughput
E. None of theseC. Turnaround time
Explanation:
Turnaround time is the time difference between completion time and arrival time. - Which of the following is the time difference between turn around time and burst time?
A. Waiting time
B. Response time
C. Arrival Time
D. Throughput
E. None of theseA. Waiting time
Explanation:
An amount of time a process has been waiting in the ready queue. - Which of the following is a time required by a process for CPU execution?
A. Waiting time
B. Response time
C. Arrival Time
D. Throughput
E. Burst timeE. Burst time
Explanation:
Burst time is a time required to complete execution of particular task or process. - Which of the following is similar to FCFS scheduling?
A. Earliest deadline first (EDF)
B. Multilevel Feedback Queue Scheduling(MQS)
C. Round Robin Scheduling(RRS)
D. Multilevel Queue Scheduling(MQS)
E. None of theseC. Round Robin Scheduling(RRS)
Explanation:
Round robin scheduling is similar to FCFS scheduling, except that CPU bursts are assigned with limits called time quantum. - Which of the following is an example of dynamic priority scheduling algorithms?
A. Earliest deadline first scheduling
B. Least slack time scheduling
C. Round Robin Scheduling(RRS)
D. Both (A) and (B)
E. Both (B) and (C)D. Both (A) and (B)
Explanation:
Earliest deadline first scheduling and Least slack time scheduling are examples of Dynamic priority scheduling algorithms. - Which of the following is also known as CPU Scheduler?
A. Long Term Scheduler
B. Short Term Scheduler
C. Medium Term Scheduler
D. Both (A) and (B)
E. Both (B) and (C)B. Short Term Scheduler
Explanation:
Short Term Scheduler is also known as CPU Scheduler used to enhance the CPU performance and it runs very frequently
AffairsCloud Recommends Oliveboard Mock Test
AffairsCloud Ebook - Support Us to Grow
Govt Jobs by Category
Bank Jobs Notification