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

RAID stands for ____________

A. Redundant allocation of inexpensive disks
B. Redundant array of important disks
C. Redundant allocation of independent disks
D. Redundant array of independent disks

If the mean time to failure of a single disk is 100,000 hours, then the mean time to failure of some disk in an array of 100 disks will be ____________

A. 100 hours
B. 10 days
C. 10 hours
D. 1000 hours

The solution to the problem of reliability is the introduction of __________

A. Aging
B. Scheduling
C. Redundancy
D. Disks

The technique of duplicating every disk is known as ____________

A. Mirroring
B. Shadowing
C. Redundancy
D. All of the mentioned

The mean time to failure of a mirrored disk depends on ____________ I) the mean time to failure of individual disks II) the mean time to repair

A. Only i
B. Only ii
C. Both i and ii
D. Neither i nor ii

RAID level _______ refers to disk mirroring.

A. 0
B. 1
C. 2
D. 3

RAID level ______ is also known as bit interleaved parity organisation.

A. 0
B. 1
C. 2
D. 3

A single parity bit can be used for ____________

A. Detection
B. Multiple error corrections
C. Few error corrections
D. All of the mentioned

RAID level ______ is also known as memory style error correcting code(ECC) organization.

A. 1
B. 2
C. 3
D. 4

RAID level 3 does not have _________ as in RAID level 1.

A. Efficiency
B. Enough storage space for data
C. Storage overhead
D. Time consumption overhead

Explanation: There is one mirror disk for every disk in level 1.