Operating System Questions and Answers – CPU Scheduling Algorithms-1

This set of 1000+ Operating System MCQs focuses on “CPU Scheduling Algorithms”

1) Round robin scheduling falls under the category of :
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these
View Answer

Answer: b
Explanation: None.

2) With round robin scheduling algorithm in a time shared system,
a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
View Answer

Answer: a
Explanation: All the processes will be able to get completed.

3) The portion of the process scheduler in an operating system that dispatches processes is concerned with :
a) assigning ready processes to CPU
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
d) All of these
View Answer

Answer: a
Explanation: None.

4) Complex scheduling algorithms :
a) are very appropriate for very large computers
b) use minimal resources
c) use many resources
d) All of these
View Answer

Answer: a
Explanation: Large computers are overloaded with greater number of processes.

5) The FIFO algorithm :
a) first executes the job that came in last in the queue
b) first executes the job that came in first in the queue
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs
View Answer

Answer: b
Explanation: None.

6) The strategy of making processes that are logically runnable to be temporarily suspended is called :
a) Non preemptive scheduling
b) Preemptive scheduling
c) Shortest job first
d) First come First served
View Answer

Answer: b
Explanation: None.

7) Scheduling is :
a) allowing a job to use the processor
b) making proper use of processor
c) Both a and b
d) None of these
View Answer

Answer: c
Explanation: None.

8) There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms ?
a) tQ = 15ms
b) tQ = 40ms
c) tQ = 45ms
d) tQ = 50ms
View Answer

Answer: a
Explanation: None.

9) Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
a) earliest due date
b) slack time remaining
c) first come, first served
d) critical ratio
View Answer

Answer: c
Explanation: None.

10) Which of the following algorithms tends to minimize the process flow time ?
a) First come First served
b) Shortest Job First
c) Earliest Deadline First
d) Longest Job First
View Answer

Answer: b
Explanation: None.

11) Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.
a) Lengthened; Shortened
b) Shortened; Lengthened
c) Shortened; Shortened
d) Shortened; Unchanged
View Answer

Answer: b
Explanation: None.

12) Which of the following statements are true ? (GATE 2010)
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a) I only
b) I and III only
c) II and III only
d) I, II and III
View Answer

Answer: d
Explanation:
I) Shortest remaining time first scheduling is a preemptive version of shortest job scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU.
II) Preemption may cause starvation. If priority based scheduling with preemption is used, then a low priority process may never get CPU.
III) Round Robin Scheduling improves response time as all processes get CPU after a specified time.

Sanfoundry Global Education & Learning Series – Operating System.

Subscribe Newsletter & Posts
About

Manish Bhojasia, a technology veteran with 17+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below.


Sanfoundry Training Center of Excellence (CoE)

Manish Bhojasia, a technology veteran with 17+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below.


1000 OS MCQs | Quiz

Basics
Processes
Process Control Block
Process Scheduling Queues
Process Synchronization
Process Creation
Inter Process Communication
Remote Procedure Calls
Structures
CPU Scheduling
CPU Scheduling Benefits
CPU Scheduling Algorithms - 1
CPU Scheduling Algorithms - 2
The Critical Section (CS) Problem and Solutions
Semaphores - 1
Semaphores - 2
Classic Synchronization Problems
Monitors
Atomic Transactions
Deadlock
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Deadlock Recovery
Swapping Processes - 1
Swapping Processes - 2
Memory Management
Memory Allocation - 1
Memory Allocation - 2
Paging - 1
Paging - 2
Segmentation
I/O System - Application I/O Interface - 1
I/O System - Application I/O Interface - 2
I/O System - Kernel I/O Subsystems
RTOS
Real Time System - Implementing RT Operating Systems - 1
Real Time System - Implementing RT Operating Systems - 2
Real Time System - Real Time CPU Scheduling - 1
Real Time System - Real Time CPU Scheduling - 2
Multimedia Systems
Multimedia System - Compression - 1
Multimedia System - Compression - 2
Multimedia System - Compression - 3
Multimedia System - CPU and Disk Scheduling
Multimedia System - Network Management
Security - User Authentication
Security - Program and System Threats
Security - Securing Systems and Facilities
Security - Intrusion Detection
Security - Cryptography
Secondary Storage
Linux
Threads
User and Kernel Threads
Multi Threading Models
The fork and exec System Calls
Thread Cancellation
Signal Handling
Thread Pools
Virtual Memory
Demand Paging
Page Replacement Algorithms - 1
Page Replacement Algorithms - 2
Allocation of Frames
Thrashing
File System
File System Implementation
File System Interface Access Methods - 1
File System Interface Access Methods - 2
File System Interface Directory Structure - 1
File System Interface Directory Structure - 2
File System Interface Mounting and Sharing
File System Interface Protection
File System Implementation - Allocation Methods - 1
File System Implementation - Allocation Methods - 2
File System Implementation - Allocation Methods - 3
File System Implementation - Performance
File System Implementation - Recovery
File System Implementation - Network File System - 1
File System Implementation - Network File System - 2
I/O Subsystem
Disk Scheduling - 1
Disk Scheduling - 2
Disk Management
Swap Space Management
RAID Structure - 1
RAID Structure - 2
Tertiary Storage
Protection - Access Matrix
Protection
Security
Protection - Memory Protection
Protection - Revocation of Access Rights
Distributed Operating System
Distributed Operating System - Types & Resource Sharing
Distributed Operating System - Network Structure & Topology
Distributed Operating System - Robustness of Distributed Systems
Distributed File System - 1
Distributed File System - 2
Distributed File System - 3
Distributed Coordination
Distributed Synchornization
Follow Manish & Sanfoundry