Operating System Subcategories

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

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

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

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

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

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

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

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

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

Explanation: The farther a track is from the center of the disk.

SSTF algorithm, like SJF __________ of some requests.

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

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

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