1. What is Race condition ? Junior A. a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes B. an operation that completes entirely without any possibility of interruption midway C. a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data D. an integer synchronization variable accessed only through atomic wait and signal operations
2. Which term means: "a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data"? Junior A. Monitor B. Busy waiting C. Mutual exclusion D. Race condition
3. Which statement is correct? Junior A. Race condition — a hazard where a high-priority task waits on a lock held by a preempted lower-priority task B. Race condition — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes C. Race condition — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data D. Race condition — an integer synchronization variable accessed only through atomic wait and signal operations
4. What is Critical section ? Junior A. the requirement that only one process be inside the critical section at any moment B. a classic synchronization scenario coordinating processes that fill and empty a bounded buffer C. a code region accessing shared data that at most one process may execute at a time D. a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
5. Which term means: "a code region accessing shared data that at most one process may execute at a time"? Junior A. Busy waiting B. Critical section C. Monitor D. Atomic operation
6. Which statement is correct? Junior A. Critical section — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data B. Critical section — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section C. Critical section — a code region accessing shared data that at most one process may execute at a time D. Critical section — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
7. What is Mutual exclusion ? Junior A. an operation that completes entirely without any possibility of interruption midway B. an integer synchronization variable accessed only through atomic wait and signal operations C. the requirement that only one process be inside the critical section at any moment D. a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
8. Which term means: "the requirement that only one process be inside the critical section at any moment"? Junior A. Producer-consumer problem B. Mutex C. Race condition D. Mutual exclusion
9. Which statement is correct? Junior A. Mutual exclusion — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data B. Mutual exclusion — a lock allowing only the thread that locked it to unlock it, ensuring exclusive access C. Mutual exclusion — the requirement that only one process be inside the critical section at any moment D. Mutual exclusion — an integer synchronization variable accessed only through atomic wait and signal operations
10. What is Mutex ? Junior A. a semaphore restricted to values 0 and 1, behaving like a simple lock B. the requirement that only one process be inside the critical section at any moment C. a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data D. a lock allowing only the thread that locked it to unlock it, ensuring exclusive access
11. Which term means: "a lock allowing only the thread that locked it to unlock it, ensuring exclusive access"? Junior A. Mutual exclusion B. Mutex C. Spinlock D. Monitor
12. Which statement is correct? Junior A. Mutex — a classic problem illustrating deadlock and starvation among processes competing for shared forks B. Mutex — a lock allowing only the thread that locked it to unlock it, ensuring exclusive access C. Mutex — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes D. Mutex — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
13. What is Semaphore ? Mid A. an integer synchronization variable accessed only through atomic wait and signal operations B. a semaphore restricted to values 0 and 1, behaving like a simple lock C. the requirement that only one process be inside the critical section at any moment D. a hazard where a high-priority task waits on a lock held by a preempted lower-priority task
14. Which term means: "an integer synchronization variable accessed only through atomic wait and signal operations"? Mid A. Semaphore B. Binary semaphore C. Mutex D. Race condition
15. Which statement is correct? Mid A. Semaphore — a code region accessing shared data that at most one process may execute at a time B. Semaphore — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data C. Semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources D. Semaphore — an integer synchronization variable accessed only through atomic wait and signal operations
16. What is Binary semaphore ? Mid A. a semaphore that can take any non-negative value to manage a pool of identical resources B. an integer synchronization variable accessed only through atomic wait and signal operations C. a classic synchronization scenario coordinating processes that fill and empty a bounded buffer D. a semaphore restricted to values 0 and 1, behaving like a simple lock
17. Which term means: "a semaphore restricted to values 0 and 1, behaving like a simple lock"? Mid A. Producer-consumer problem B. Race condition C. Binary semaphore D. Mutual exclusion
18. Which statement is correct? Mid A. Binary semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources B. Binary semaphore — a semaphore restricted to values 0 and 1, behaving like a simple lock C. Binary semaphore — an operation that completes entirely without any possibility of interruption midway D. Binary semaphore — a flaw where the result depends on the unpredictable timing of concurrent accesses to shared data
19. What is Counting semaphore ? Mid A. a semaphore restricted to values 0 and 1, behaving like a simple lock B. a lock allowing only the thread that locked it to unlock it, ensuring exclusive access C. a semaphore that can take any non-negative value to manage a pool of identical resources D. a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data
20. Which term means: "a semaphore that can take any non-negative value to manage a pool of identical resources"? Mid A. Counting semaphore B. Spinlock C. Mutex D. Critical section
21. Which statement is correct? Mid A. Counting semaphore — a hazard where a high-priority task waits on a lock held by a preempted lower-priority task B. Counting semaphore — a semaphore that can take any non-negative value to manage a pool of identical resources C. Counting semaphore — a classic synchronization scenario coordinating processes that fill and empty a bounded buffer D. Counting semaphore — an operation that completes entirely without any possibility of interruption midway
22. What is Peterson's solution ? Senior A. a hazard where a high-priority task waits on a lock held by a preempted lower-priority task B. an operation that completes entirely without any possibility of interruption midway C. a classic problem illustrating deadlock and starvation among processes competing for shared forks D. a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
23. Which term means: "a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes"? Senior A. Spinlock B. Monitor C. Peterson's solution D. Binary semaphore
24. Which statement is correct? Senior A. Peterson's solution — a classic problem illustrating deadlock and starvation among processes competing for shared forks B. Peterson's solution — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes C. Peterson's solution — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data D. Peterson's solution — a semaphore that can take any non-negative value to manage a pool of identical resources
25. What is Monitor ? Mid A. a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data B. a lock that makes a waiting thread busy-wait in a loop instead of blocking and sleeping C. a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically D. an operation that completes entirely without any possibility of interruption midway
26. Which term means: "a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically"? Mid A. Monitor B. Priority inversion C. Spinlock D. Producer-consumer problem
27. Which statement is correct? Mid A. Monitor — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section B. Monitor — a synchronization problem allowing many concurrent readers but only one exclusive writer of shared data C. Monitor — a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically D. Monitor — a software algorithm using a turn variable and flags to enforce mutual exclusion for two processes
28. What is Busy waiting ? Mid A. a semaphore that can take any non-negative value to manage a pool of identical resources B. a high-level construct bundling shared data with procedures that guarantee mutual exclusion automatically C. repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section D. a lock that makes a waiting thread busy-wait in a loop instead of blocking and sleeping
29. Which term means: "repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section"? Mid A. Priority inversion B. Busy waiting C. Readers-writers problem D. Spinlock
30. Which statement is correct? Mid A. Busy waiting — a code region accessing shared data that at most one process may execute at a time B. Busy waiting — an operation that completes entirely without any possibility of interruption midway C. Busy waiting — the requirement that only one process be inside the critical section at any moment D. Busy waiting — repeatedly checking a condition in a loop, wasting CPU cycles while waiting to enter a section Showing 30 of 48 OS · Synchronization questions — the full set, with answers, explanations and an AI tutor on every question, is inside.