CPU Scheduling Solved MCQ’s Questions Answers

18
Score: 0
Attempted: 0/18

1. Which of the following cannot be scheduled by the kernel?
(A) Process
(B) User-level thread
(C) Kernel-level thread
(D) None of the mentioned

2. If _______ rule sequences the jobs, orders are processed in the sequence they arrive.
(A) First come, first served
(B) Critical ratios
(C) Earliest due date
(D) Lack time remaining

3. In the scheduling algorithm, Multilevel feedback
(A) Processes are not classified into groups
(B) A process can move to a different classified ready queue
(C) Classification of the ready queue is permanent
(D) None of the mentioned

4. Select one which algorithms tend to minimize the process flow time?
(A) First come First served
(B) Earliest Deadline First
(C) Shortest Job First
(D) Longest Job First

5. The process can be classified into many groups in
(A) Shortest job scheduling algorithm
(B) Multilevel queue scheduling algorithm
(C) Round-robin scheduling algorithm
(D) Priority scheduling algorithm

6. The turnaround time for short jobs during multiprogramming is usually shortened and that for long jobs is slightly ___________
(A) Shortened
(B) Unchanged
(C) Lengthened
(D) Shortened

7. Time quantum can be said
(A) Multilevel queue scheduling algorithm
(B) Round-robin scheduling algorithm
(C) Shortest job scheduling algorithm
(D) Priority scheduling algorithm

8. Select the statements which are true according to GATE 2010.
i. Starvation may be caused by Shortest remaining time first scheduling
ii. Starvation may be caused by Preemptive scheduling
iii. In terms of response time, Round robin is better than FCFS
(A) All the given option

9. At the ready queue when a process arrives in priority scheduling algorithm, the priority of this process is compared with the priority of?
(A) Currently running process
(B) Parent process
(C) All process
(D) Init process

10. The FIFO algorithm said:
(A) Executes the job first that needs a minimal processor
(B) The job first executes that comes last in the queue
(C) The job first executes that has maximum processor needs
(D) The job first executes that came in first in the queue

11. A program that is bound by CPU might have
(A) CPU bursts many short
(B) CPU bursts a few short
(C) CPU bursts a few longer
(D) None of the above

12. Scheduling algorithms that work on complex:
(A) Uses few resources
(B) Uses most resources
(C) Are suitable for large computers
(D) All of the mentioned

13. Scheduling algorithm which allocates the CPU first to the process which requests the CPU first?
(A) FCFS scheduling
(B) Priority scheduling
(C) Shortest job scheduling
(D) None of the mentioned

14. In an operating system, the portion of the process scheduler that forwards processes is concerned with:
(A) Running processes are assigning to blocked queue
(B) Ready processes are assigning to CPU
(C) Ready processes are assigning to the waiting queue
(D) All of the mentioned

15. From the time of submission of a process to the time of completion, the interval is termed as
(A) Waiting time
(B) Turnaround time
(C) Response time
(D) Throughput

16. Under the category of_______, Round-robin scheduling falls:
(A) Preemptive scheduling
(B) Nonpreemptive scheduling
(C) All of the mentioned
(D) None of the mentioned

17. The processes that are inhabited in main memory and are ready and waiting to execute and remain on a list called
(A) Process queue
(B) Execution queue
(C) Job queue
(D) Ready queue

18. Control of the CPU to the process selected by the short-term scheduler is assigned by the module ________.
(A) Interrupt
(B) Scheduler
(C) Dispatcher
(D) None of the mentioned

CPU Scheduling Solved MCQ’s Questions Answers
By: Prof. Dr. Fazal Rehman | Last updated: April 16, 2025

Next Operating System MCQs

Related Posts:

Leave a Comment