MCQs City

Operating System » Classic Sync Problems

Operating System Subcategories

Application Io Interface 1	Application Io Interface 2
Atomic Transactions	Basics
Classic Sync Problems	Communication Systems Bandwidth Transmission Medium
Cpu Scheduling	Cpu Scheduling 2
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Cpu Scheduling Benefits	Critical Section Problem
Deadlock	Deadlock Avoidance
Deadlock Detection	Deadlock Prevention
Deadlock Recovery	Disk Management
Disk Scheduling 1	Disk Scheduling 2
Distributed File System	Distributed Operating System
Distributed Synchronization	File System 1
File System Allocation Methods 1	File System Allocation Methods 2
File System Allocation Methods 3	File System Concepts
File System Free Space Performance	File System Implementation
File System Interface Access Methods 1	File System Interface Access Methods 2
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Interface Protection
File System Recovery	Inter Process Communication
Io Subsystem	Kernel Io Subsystems
Linux	Mass Storage Raid 1
Mass Storage Raid 2	Mass Storage Tertiary Storage
Memory Allocation 1	Memory Allocation 2
Memory Management	Memory Management Paging 1
Memory Management Paging 2	Memory Management Segmentation
Memory Management Swapping 1	Memory Management Swapping 2
Multi Threading Models	Multimedia System Compression 1
Multimedia System Compression 2	Multimedia System Compression 3
Multimedia System Cpu Disk Scheduling	Multimedia System Network Management
Network File System 1	Network File System 2
Network Structure Topology	Operating System
Process Control Block	Process Creation
Process Rpc	Process Scheduling Queue
Process Structures	Process Sync Monitors
Process Synchronization	Processes
Protection Access Matrix	Protection Concepts
Protection Memory Protection	Protection Revocation Access Rights
Robustness	Rtos
Secondary Storage	Security
Security Cryptography	Security Intrusion Detection
Security Program System Threats	Security System Facility
Security User Authentication	Semaphores 1
Semaphores 2	Swap Space Management
Threads	Threads Cancellation
Threads Fork Exec	Threads Pools
Threads Signal Handling	Threads Ult Klt
Two Port Network	Virtual Memory
Virtual Memory Demand Paging	Virtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1	Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

Operating System » Classic Sync Problems

Operating System Subcategories

MCQs Menu

Past Papers