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

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

A. Resource allocation state
B. System storage state
C. Operating system
D. Resources

Explanation: Resource allocation states are used to maintain the availability of the already and current available resources.

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

A. Resources currently available
B. Processes that have previously been in the system
C. Resources currently allocated to each process
D. Future requests and releases of each process

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

A. Minimum
B. Average
C. Maximum
D. Approximate

A state is safe, if ____________

A. The system does not crash due to deadlock occurrence
B. The system can allocate resources to each process in some order and still avoid a deadlock
C. The state keeps the system protected and safe
D. All of the mentioned

A system is in a safe state only if there exists a ____________

A. Safe allocation
B. Safe resource
C. Safe sequence
D. All of the mentioned

All unsafe states are ____________

A. Deadlocks
B. Not deadlocks
C. Fatal
D. None of the mentioned

A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. advertisement Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?

A. P0, p1, p2
B. P1, p2, p0
C. P2, p0, p1
D. P1, p0, p2

If no cycle exists in the resource allocation graph ____________

A. Then the system will not be in a safe state
B. Then the system will be in a safe state
C. All of the mentioned
D. None of the mentioned

The resource allocation graph is not applicable to a resource allocation system ____________

A. With multiple instances of each resource type
B. With a single instance of each resource type
C. Single & multiple instances of each resource type
D. None of the mentioned

The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

A. Less efficient
B. More efficient
C. Equal
D. None of the mentioned