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 bounded buffer problem is also known as ____________

A. Readers €? writers problem
B. Dining €? philosophers problem
C. Producer €? consumer problem
D. None of the mentioned

In the bounded buffer problem, there are the empty and full semaphores that ____________

A. Count the number of empty and full buffers
B. Count the number of empty and full memory spaces
C. Count the number of empty and full queues
D. None of the mentioned

In the bounded buffer problem ____________

A. There is only one buffer
B. There are n buffers ( n being greater than one but finite)
C. There are infinite buffers
D. The buffer size is bounded

To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.

A. Readers
B. Writers
C. Readers and writers
D. None of the mentioned

The dining – philosophers problem will occur in case of ____________

A. 5 philosophers and 5 chopsticks
B. 4 philosophers and 5 chopsticks
C. 3 philosophers and 5 chopsticks
D. 6 philosophers and 5 chopsticks

Explanation: 1. DefinitionOne-liner: It is a classical synchronization problem used to model the challenges of allocating multiple shared resources among several processes without causing deadlock. 2. Primary CausesDeadlock: Occurs when all philosophers pick up their left fork simultaneously, leaving no right forks available (Circular Wait).Starvation: Occurs when a philosopher is indefinitely unable to acquire both forks because their neighbors are constantly alternating eating and thinking.3. Key Solutions (Deadlock Prevention)Resource Hierarchy: Assign numbers to forks and require philosophers to always pick up the lower-numbered fork first.Limitation: Allow only $n-1$ philosophers (e.g., 4 out of 5) to sit at the table simultaneously.Asymmetric Strategy: Have even-positioned philosophers pick the right fork first and odd-positioned philosophers pick the left fork first.Atomicity: Use a Monitor or Semaphore to ensure a philosopher only picks up forks if both are available at the same time.

A deadlock free solution to the dining philosophers problem ____________

A. Necessarily eliminates the possibility of starvation
B. Does not necessarily eliminate the possibility of starvation
C. Eliminates any possibility of any kind of problem further
D. None of the mentioned

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. advertisement signal(mutex); ..... critical section ..... wait(mutex); In this situation :

A. A deadlock will occur
B. Processes will starve to enter critical section
C. Several processes maybe executing in their critical section
D. All of the mentioned

All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. wait(mutex); ..... critical section ..... wait(mutex);

A. A deadlock will occur
B. Processes will starve to enter critical section
C. Several processes maybe executing in their critical section
D. All of the mentioned

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. (GATE 2010) Method used by P1 : while(S1==S2); Critical section S1 = S2; Method used by P2 : while(S1!=S2); Critical section S2 = not(S1); Which of the following statements describes properties achieved?

A. Mutual exclusion but not progress
B. Progress but not mutual exclusion
C. Neither mutual exclusion nor progress
D. Both mutual exclusion and progress

Explanation: The while(S1==S2) or while(S1!=S2) loops will work as a mutex. When either P1 or P2 enters the Critical section (CS), they will make sure to change the values of S1 or S2 upon exit from the CS such that the other process enters the CS while that process waits on the mutex.