Operating System » Critical Section Problem
Operating System Subcategories
Application Io Interface 1Application Io Interface 2
Atomic TransactionsBasics
Classic Sync ProblemsCommunication Systems Bandwidth Transmission Medium
Cpu SchedulingCpu Scheduling 2
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
Cpu Scheduling BenefitsCritical Section Problem
DeadlockDeadlock Avoidance
Deadlock DetectionDeadlock Prevention
Deadlock RecoveryDisk Management
Disk Scheduling 1Disk Scheduling 2
Distributed File SystemDistributed Operating System
Distributed SynchronizationFile System 1
File System Allocation Methods 1File System Allocation Methods 2
File System Allocation Methods 3File System Concepts
File System Free Space PerformanceFile System Implementation
File System Interface Access Methods 1File System Interface Access Methods 2
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Interface Protection
File System RecoveryInter Process Communication
Io SubsystemKernel Io Subsystems
LinuxMass Storage Raid 1
Mass Storage Raid 2Mass Storage Tertiary Storage
Memory Allocation 1Memory Allocation 2
Memory ManagementMemory Management Paging 1
Memory Management Paging 2Memory Management Segmentation
Memory Management Swapping 1Memory Management Swapping 2
Multi Threading ModelsMultimedia System Compression 1
Multimedia System Compression 2Multimedia System Compression 3
Multimedia System Cpu Disk SchedulingMultimedia System Network Management
Network File System 1Network File System 2
Network Structure TopologyOperating System
Process Control BlockProcess Creation
Process RpcProcess Scheduling Queue
Process StructuresProcess Sync Monitors
Process SynchronizationProcesses
Protection Access MatrixProtection Concepts
Protection Memory ProtectionProtection Revocation Access Rights
RobustnessRtos
Secondary StorageSecurity
Security CryptographySecurity Intrusion Detection
Security Program System ThreatsSecurity System Facility
Security User AuthenticationSemaphores 1
Semaphores 2Swap Space Management
ThreadsThreads Cancellation
Threads Fork ExecThreads Pools
Threads Signal HandlingThreads Ult Klt
Two Port NetworkVirtual Memory
Virtual Memory Demand PagingVirtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing
Concurrent access to shared data may result in ____________
A. Data consistency
B. Data insecurity
C. Data inconsistency
D. None of the mentioned
Read more about this MCQ
Mutual exclusion implies that ____________
A. If a process is executing in its critical section, then no other process must be executing in their critical sections
B. If a process is executing in its critical section, then other processes must be executing in their critical sections
C. If a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
D. None of the mentioned
Read more about this MCQ
Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________
A. After a process has made a request to enter its critical section and before the request is granted
B. When another process is in its critical section
C. Before a process has made a request to enter its critical section
D. None of the mentioned
Read more about this MCQ
In the bakery algorithm to solve the critical section problem ____________
A. Each process is put into a queue and picked up in an ordered manner
B. Each process receives a number (may or may not be unique) and the one with the lowest number is served next
C. Each process gets a unique number and the one with the highest number is served next
D. Each process gets a unique number and the one with the lowest number is served next
Read more about this MCQ