Quiz on Operating System -UNIT-II

What is the primary purpose of the critical section in concurrent programming?

• Improve CPU utilization

• Protect shared resources from concurrent access

• Speed up execution time

• Increase parallelism

Which of the following is NOT a requirement for solving the critical section problem?

• Mutual Exclusion

• Progress

• Deadlock

• Bounded Waiting

What is mutual exclusion?

• Allowing multiple threads to access the same resource

• Preventing concurrent access to shared resources

• A type of scheduling algorithm

• A form of recursion

In Peterson's Algorithm, which data structure ensures turn-based access to critical section?

• Stack

• Queue

• Array

• Turn variable

Peterson’s algorithm works for how many processes?

• Any number

• 2 only

• 3 only

• 4 only

Which one is a software solution to mutual exclusion?

• Peterson’s Algorithm

• Mutex lock

• Semaphore

• Monitor

In Lamport's Bakery Algorithm, each process gets a:

• Random number

• Unique token

• Ticket number

• Priority queue

Lamport’s Bakery Algorithm is designed to handle how many threads?

• 1

• 2

• n

• 0

In mutual exclusion, the Bounded Waiting condition ensures:

• No starvation

• Infinite wait

• All threads execute simultaneously

• Deadlock

Which of the following is a hardware solution to mutual exclusion?

• Peterson’s Algorithm

• Disable Interrupts

• Lamport’s Algorithm

• Monitors