MCQs City

Operating System » Disk Scheduling 2

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

Whenever a process needs I/O to or from a disk it issues a ______________

A. System call to the cpu
B. System call to the operating system
C. A special procedure
D. All of the mentioned

Read more about this MCQ

If a process needs I/O to or from a disk, and if the drive or controller is busy then ____________

A. The request will be placed in the queue of pending requests for that drive
B. The request will not be processed and will be ignored completely
C. The request will be not be placed
D. None of the mentioned

Read more about this MCQ

Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

A. 600
B. 620
C. 630
D. 640

Read more about this MCQ

Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

A. 224
B. 236
C. 245
D. 240

Read more about this MCQ

Random access in magnetic tapes is _________ compared to magnetic disks.

A. Fast
B. Very fast
C. Slow
D. Very slow

Read more about this MCQ

Magnetic tape drives can write data at a speed ________ disk drives.

A. Much lesser than
B. Comparable to
C. Much faster than
D. None of the mentioned

Read more about this MCQ

On media that use constant linear velocity (CLV), the _____________ is uniform.

A. Density of bits on the disk
B. Density of bits per sector
C. The density of bits per track
D. None of the mentioned

Read more about this MCQ

SSTF algorithm, like SJF __________ of some requests.

A. May cause starvation
B. Will cause starvation
C. Does not cause starvation
D. Causes aging

Read more about this MCQ

In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.

A. Look
B. Scan
C. C-scan
D. C-look

Read more about this MCQ

In the _______ algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

A. Look
B. Scan
C. C-scan
D. C-look

Read more about this MCQ

MCQs Menu

Past Papers