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

The operating system is responsible for?

A. Disk initialization
B. Booting from disk
C. Bad-block recovery
D. All of the mentioned

Which one of the following is not a secondary storage?

A. Magnetic disks
B. Magnetic tapes
C. Ram
D. None of the mentioned

Which private network uses storage protocol rather than networking protocol?

A. Storage area network
B. Local area network
C. Wide area network
D. None of the mentioned

The time for the disk arm to move the heads to the cylinder containing the desired sector is called ___________

A. Disk time
B. Seek time
C. Arm time
D. Sector time

Which algorithm of disk scheduling selects the request with the least seek time from the current head positions?

A. Sstf scheduling
B. Fcfs scheduling
C. Scan scheduling
D. Look scheduling

A swap space can reside in ___________

A. Separate disk partition
B. Ram
C. Cache
D. None of the mentioned

RAID level 1 refers to ___________

A. Disk arrays with striping
B. Disk mirroring
C. Both disk arrays with striping and disk mirroring
D. €?. advertisement

Explanation: A variety of disk-organization techniques is called “redundant arrays of independent disks (RAID)”.

When we write something on the disk, which one of the following can not happen?

A. Successful completion
B. Partial failure
C. Total failure
D. None of the mentioned

What will happen during the recovery from a failure?

A. Each pair of physical block is examined
B. Specified pair of physical block is examined
C. First pair of physical block is examined
D. None of the mentioned

The replacement of a bad block generally is not totally automatic because ___________

A. Data in bad block can not be replaced
B. Data in bad block is usually lost
C. Bad block does not contain any data
D. None of the mentioned