Deadlock

What is the main problem that the Critical Section problem aims to solve?

• Deadlock

• Process Synchronization

• Paging

• Fragmentation

Which of the following is NOT a necessary condition for a solution to the Critical Section problem?

• Mutual Exclusion

• Progress

• Bounded Waiting

• Starvation

Which synchronization mechanism can be used to solve the Critical Section problem?

• Semaphore

• paging

• Demand Paging

• Thrashing

Which of the following statements about Critical Section is true?

• It is a part of the program where shared resources are accessed

• It always leads to deadlock

• • It prevents concurrent execution

• It only occurs in single-threaded programs

Which of the following is NOT a classical solution to the Critical Section problem?

• Peterson’s Algorithm

• Bakery Algorithm

• Dekker’s Algorithm

• Round-Robin Scheduling

What is the primary goal of synchronization in operating systems?

• Preventing deadlock

• Managing CPU scheduling

• Ensuring orderly execution of concurrent processes

• Increasing memory size

Which of the following is NOT a synchronization mechanism?

• Semaphore

• Monitor

• Mutex

• Fragmentation

Which type of semaphore can have only two values, 0 and 1?

• Binary Semaphore

• Counting Semaphore

• Mutex

• None of the above

Which of the following synchronization mechanisms uses condition variables?

• Semaphore

• Monitor

• Mutex

• Spin lock

What does the Producer-Consumer problem deal with?

• Process Scheduling

• Process Synchronization

• Deadlock Avoidance

• Memory Allocation