Operating System MCQ - Scheduling Algorithms

This section focuses on "Scheduling Algorithms" in Operating System. These Multiple Choice Questions (MCQ) should be practiced to improve the Operating System skills required for various interviews (campus interview, walk-in interview, company interview), placements, entrance exams and other competitive examinations.

1. The algorithms are ________.

A. non-preemptive
B. preemptive
C. Both A and B
D. None of the above

View Answer


2. Which of the following is process scheduling algorithms?

A. FCFS
B. SJN
C. RR
D. All of the above

View Answer


3. Which of the following algorithms work based on priority?

A. non-preemptive
B. preemptive
C. Both A and B
D. None of the above

View Answer


4. Which of the following is false regarding First Come First Serve (FCFS)?

A. FCFS performance is high
B. average wait time is high.
C. Its implementation is based on FIFO queue.
D. FCFS is easy to understand and implement.

View Answer


5. Shortest Job Next is also known as?

A. Batch job
B. Advance job
C. shortest job first
D. shortest job last

View Answer


6. Which of the following is non-preemptive algorithm?

A. Priority Based Scheduling
B. Shortest Remaining Time
C. FCFS
D. shortest job first

View Answer


7. In Round Robin Scheduling, Each process is provided a fix time to execute, it is called a?

A. Batch Time
B. Job Time
C. quantum
D. Period

View Answer


8. Which of the following is preemptive algorithm?

A. Round Robin Scheduling
B. Shortest Remaining Time
C. Multiple-Level Queues Scheduling
D. Both A and B

View Answer


9. __________ is used to save states of preempted processes.

A. Context switching
B. Quantam
C. Process Period
D. Batch Jobs

View Answer


10. In Priority Based Scheduling, if Processes have same priority then which Scheduling algorithm is used?

A. SJN
B. FCFS
C. SRT
D. Round Robin

View Answer





Discussion


* You must be logged in to add comment.