Cpu Scheduling Algorithms 2 MCQs

10 MCQs — Operating System MCQs

Practice Cpu Scheduling Algorithms 2 MCQs with correct answers and explanations. These questions are from the Operating System MCQs section.

Attempt Cpu Scheduling Algorithms 2 Quiz

Operating System Subcategories

Application Io Interface 1	Application Io Interface 2
Atomic Transactions	Basics
Classic Sync Problems	Communication Systems Bandwidth Transmission Medium
Cpu Scheduling	Cpu Scheduling 2
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Cpu Scheduling Benefits	Critical Section Problem
Deadlock	Deadlock Avoidance
Deadlock Detection	Deadlock Prevention
Deadlock Recovery	Disk Management
Disk Scheduling 1	Disk Scheduling 2
Distributed File System	Distributed Operating System
Distributed Synchronization	File System 1
File System Allocation Methods 1	File System Allocation Methods 2
File System Allocation Methods 3	File System Concepts
File System Free Space Performance	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 Sharing	File System Interface Protection
File System Recovery	Inter Process Communication
Io Subsystem	Kernel Io Subsystems
Linux	Mass Storage Raid 1
Mass Storage Raid 2	Mass Storage Tertiary Storage
Memory Allocation 1	Memory Allocation 2
Memory Management	Memory Management Paging 1
Memory Management Paging 2	Memory Management Segmentation
Memory Management Swapping 1	Memory Management Swapping 2
Multi Threading Models	Multimedia System Compression 1
Multimedia System Compression 2	Multimedia System Compression 3
Multimedia System Cpu Disk Scheduling	Multimedia System Network Management
Network File System 1	Network File System 2
Network Structure Topology	Operating System
Process Control Block	Process Creation
Process Rpc	Process Scheduling Queue
Process Structures	Process Sync Monitors
Process Synchronization	Processes
Protection Access Matrix	Protection Concepts
Protection Memory Protection	Protection Revocation Access Rights
Robustness	Rtos
Secondary Storage	Security
Security Cryptography	Security Intrusion Detection
Security Program System Threats	Security System Facility
Security User Authentication	Semaphores 1
Semaphores 2	Swap Space Management
Threads	Threads Cancellation
Threads Fork Exec	Threads Pools
Threads Signal Handling	Threads Ult Klt
Two Port Network	Virtual Memory
Virtual Memory Demand Paging	Virtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1	Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing

The FCFS algorithm is particularly troublesome for ____________

A. Time sharing systems
B. Multiprogramming systems
C. Multiprocessor systems
D. Operating systems

Read more about this MCQ

The real difficulty with SJF in short term scheduling is ____________

A. It is too good an algorithm
B. Knowing the length of the next cpu request
C. It is too complex to understand
D. None of the mentioned

Read more about this MCQ

Consider the following set of processes, the length of the CPU burst time given in milliseconds. Process Burst time P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm.

A. The waiting time for process p1 is 3ms
B. The waiting time for process p1 is 0ms
C. The waiting time for process p1 is 16ms
D. The waiting time for process p1 is 9ms

Read more about this MCQ

Preemptive Shortest Job First scheduling is sometimes called ____________

A. Fast sjf scheduling
B. Edf scheduling ? earliest deadline first
C. Hrrn scheduling ? highest response ratio next
D. Srtn scheduling ? shortest remaining time next

Read more about this MCQ

An SJF algorithm is simply a priority algorithm where the priority is ____________

A. The predicted next cpu burst
B. The inverse of the predicted next cpu burst
C. The current cpu burst
D. Anything the user wants

Read more about this MCQ

Choose one of the disadvantages of the priority scheduling algorithm?

A. It schedules in a very complex manner
B. Its scheduling takes up a lot of time
C. It can lead to some low priority process waiting indefinitely for the cpu
D. None of the mentioned

Read more about this MCQ

What is ‘Aging’?

A. Keeping track of cache contents
B. Keeping track of what pages are currently residing in memory
C. Keeping track of how many times a given page is referenced
D. Increasing the priority of jobs to ensure termination in a finite time

Read more about this MCQ

A solution to the problem of indefinite blockage of low – priority processes is ____________

A. Starvation
B. Wait queue
C. Ready queue
D. Aging

Read more about this MCQ

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

Read more about this MCQ

Which of the following scheduling algorithms gives minimum average waiting time?

A. Fcfs
B. Sjf
C. Round ? robin
D. Priority

Read more about this MCQ

MCQs Menu

Cpu Scheduling Algorithms 2 MCQs

Operating System Subcategories

MCQs Menu

Past Papers