OS · Synchronization interview questions

1. A.a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
2. B.an operation that completes entirely without any possibility of interruption midway
3. C.a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
4. D.an integer synchronization variable accessed only through atomic wait and signal operations

Answer + AI explanation with a free account

1. A.Monitor
2. B.Busy waiting
3. C.Mutual exclusion
4. D.Race condition

Answer + AI explanation with a free account

1. A.Race condition — a hazard where a high-priority task waits on a lock held by a preempted lower-priority task
2. B.Race condition — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
3. C.Race condition — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
4. D.Race condition — an integer synchronization variable accessed only through atomic wait and signal operations

Answer + AI explanation with a free account

1. A.the requirement that only one process be inside the critical section at any moment
2. B.a classic synchronization scenario coordinating processes that fill and empty a bounded buffer
3. C.a code region accessing shared data that at most one process may execute at a time
4. D.a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data

Answer + AI explanation with a free account

1. A.Busy waiting
2. B.Critical section
3. C.Monitor
4. D.Atomic operation

Answer + AI explanation with a free account

1. A.Critical section — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
2. B.Critical section — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section
3. C.Critical section — a code region accessing shared data that at most one process may execute at a time
4. D.Critical section — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data

Answer + AI explanation with a free account

1. A.an operation that completes entirely without any possibility of interruption midway
2. B.an integer synchronization variable accessed only through atomic wait and signal operations
3. C.the requirement that only one process be inside the critical section at any moment
4. D.a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data

Answer + AI explanation with a free account

1. A.Producer-consumer problem
2. B.Mutex
3. C.Race condition
4. D.Mutual exclusion

Answer + AI explanation with a free account

1. A.Mutual exclusion — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
2. B.Mutual exclusion — a lock allowing only the thread that locked it to unlock it, ensuring exclusive access
3. C.Mutual exclusion — the requirement that only one process be inside the critical section at any moment
4. D.Mutual exclusion — an integer synchronization variable accessed only through atomic wait and signal operations

Answer + AI explanation with a free account

1. A.a semaphore restricted to values 0 and 1, behaving like a simple lock
2. B.the requirement that only one process be inside the critical section at any moment
3. C.a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
4. D.a lock allowing only the thread that locked it to unlock it, ensuring exclusive access

Answer + AI explanation with a free account

1. A.Mutual exclusion
2. B.Mutex
3. C.Spinlock
4. D.Monitor

Answer + AI explanation with a free account

1. A.Mutex — a classic problem illustrating deadlock and starvation among processes competing for shared forks
2. B.Mutex — a lock allowing only the thread that locked it to unlock it, ensuring exclusive access
3. C.Mutex — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
4. D.Mutex — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data

Answer + AI explanation with a free account

1. A.an integer synchronization variable accessed only through atomic wait and signal operations
2. B.a semaphore restricted to values 0 and 1, behaving like a simple lock
3. C.the requirement that only one process be inside the critical section at any moment
4. D.a hazard where a high-priority task waits on a lock held by a preempted lower-priority task

Answer + AI explanation with a free account

1. A.Semaphore
2. B.Binary semaphore
3. C.Mutex
4. D.Race condition

Answer + AI explanation with a free account

1. A.Semaphore — a code region accessing shared data that at most one process may execute at a time
2. B.Semaphore — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
3. C.Semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources
4. D.Semaphore — an integer synchronization variable accessed only through atomic wait and signal operations

Answer + AI explanation with a free account

1. A.a semaphore that can take any non-negative value to manage a pool of identical resources
2. B.an integer synchronization variable accessed only through atomic wait and signal operations
3. C.a classic synchronization scenario coordinating processes that fill and empty a bounded buffer
4. D.a semaphore restricted to values 0 and 1, behaving like a simple lock

Answer + AI explanation with a free account

1. A.Producer-consumer problem
2. B.Race condition
3. C.Binary semaphore
4. D.Mutual exclusion

Answer + AI explanation with a free account

1. A.Binary semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources
2. B.Binary semaphore — a semaphore restricted to values 0 and 1, behaving like a simple lock
3. C.Binary semaphore — an operation that completes entirely without any possibility of interruption midway
4. D.Binary semaphore — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data

Answer + AI explanation with a free account

1. A.a semaphore restricted to values 0 and 1, behaving like a simple lock
2. B.a lock allowing only the thread that locked it to unlock it, ensuring exclusive access
3. C.a semaphore that can take any non-negative value to manage a pool of identical resources
4. D.a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data

Answer + AI explanation with a free account

1. A.Counting semaphore
2. B.Spinlock
3. C.Mutex
4. D.Critical section

Answer + AI explanation with a free account

1. A.Counting semaphore — a hazard where a high-priority task waits on a lock held by a preempted lower-priority task
2. B.Counting semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources
3. C.Counting semaphore — a classic synchronization scenario coordinating processes that fill and empty a bounded buffer
4. D.Counting semaphore — an operation that completes entirely without any possibility of interruption midway

Answer + AI explanation with a free account

1. A.a hazard where a high-priority task waits on a lock held by a preempted lower-priority task
2. B.an operation that completes entirely without any possibility of interruption midway
3. C.a classic problem illustrating deadlock and starvation among processes competing for shared forks
4. D.a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes

Answer + AI explanation with a free account

1. A.Spinlock
2. B.Monitor
3. C.Peterson's solution
4. D.Binary semaphore

Answer + AI explanation with a free account

1. A.Peterson's solution — a classic problem illustrating deadlock and starvation among processes competing for shared forks
2. B.Peterson's solution — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
3. C.Peterson's solution — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
4. D.Peterson's solution — a semaphore that can take any non-negative value to manage a pool of identical resources

Answer + AI explanation with a free account

1. A.a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
2. B.a lock that makes a waiting thread busy-wait in a loop instead of blocking and sleeping
3. C.a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically
4. D.an operation that completes entirely without any possibility of interruption midway

Answer + AI explanation with a free account

1. A.Monitor
2. B.Priority inversion
3. C.Spinlock
4. D.Producer-consumer problem

Answer + AI explanation with a free account

1. A.Monitor — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section
2. B.Monitor — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
3. C.Monitor — a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically
4. D.Monitor — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes

Answer + AI explanation with a free account

1. A.a semaphore that can take any non-negative value to manage a pool of identical resources
2. B.a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically
3. C.repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section
4. D.a lock that makes a waiting thread busy-wait in a loop instead of blocking and sleeping

Answer + AI explanation with a free account

1. A.Priority inversion
2. B.Busy waiting
3. C.Readers-writers problem
4. D.Spinlock

Answer + AI explanation with a free account

1. A.Busy waiting — a code region accessing shared data that at most one process may execute at a time
2. B.Busy waiting — an operation that completes entirely without any possibility of interruption midway
3. C.Busy waiting — the requirement that only one process be inside the critical section at any moment
4. D.Busy waiting — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section

Answer + AI explanation with a free account