MCQs City

Operating System » Distributed Synchronization

Attempt Distributed Synchronization Quiz

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

In distributed systems, a logical clock is associated with ______________

A. Each instruction
B. Each process
C. Each register
D. None of the mentioned

Read more about this MCQ

If timestamps of two events are same, then the events are ____________

A. Concurrent
B. Non-concurrent
C. Monotonic
D. Non-monotonic

Read more about this MCQ

If a process is executing in its critical section ____________

A. Any other process can also execute in its critical section
B. No other process can execute in its critical section
C. One more process can execute in its critical section
D. None of the mentioned

Read more about this MCQ

A process can enter into its critical section ____________

A. Anytime
B. When it receives a reply message from its parent process
C. When it receives a reply message from all other processes in the system
D. None of the mentioned

Read more about this MCQ

For proper synchronization in distributed systems ____________

A. Prevention from the deadlock is must
B. Prevention from the starvation is must
C. Prevention from the deadlock & starvation is must
D. None of the mentioned

Read more about this MCQ

In the token passing approach of distributed systems, processes are organized in a ring structure ____________

A. Logically
B. Physically
C. Both logically and physically
D. None of the mentioned

Read more about this MCQ

In distributed systems, what will the transaction coordinator do?

A. Starts the execution of transaction
B. Breaks the transaction into number of sub transactions
C. Coordinates the termination of the transaction
D. All of the mentioned

Read more about this MCQ

In case of failure, a new transaction coordinator can be elected by ____________

A. Bully algorithm
B. Ring algorithm
C. Both bully and ring algorithm
D. None of the mentioned

Read more about this MCQ

In distributed systems, election algorithms assumes that ____________

A. A unique priority number is associated with each active process in system
B. There is no priority number associated with any process
C. Priority of the processes is not required
D. None of the mentioned

Read more about this MCQ

According to the ring algorithm, links between processes are ____________

A. Bidirectional
B. Unidirectional
C. Both bidirectional and unidirectional
D. None of the mentioned

Read more about this MCQ

MCQs Menu

Past Papers