Fundamentals of Operating Systems

What are the different states a process can be in?

• New, Ready, Running, Waiting, Terminated

• Completed

• Blocked

• Paused

Explain the purpose of semaphore operations in process synchronization.

• Semaphore operations are used to increase the speed of processes.

• Semaphore operations are primarily for memory allocation.

• Semaphore operations are a method for data encryption.

• Semaphore operations ensure safe access to shared resources in concurrent programming.

What is the critical section problem and how can it be solved?

• The critical section problem can be ignored in single-threaded applications.

• The critical section problem can be solved using synchronization mechanisms like locks, semaphores, or monitors.

• The critical section problem is solved by increasing the number of threads.

• The critical section problem is resolved by using random delays between processes.

Describe the producer-consumer problem and its challenges.

• Producers and consumers do not need to synchronize their actions.

• The producer-consumer problem is only about data storage.

• Challenges include network latency and server downtime.

• The producer-consumer problem involves synchronization between producers and consumers accessing a shared buffer, with challenges including buffer overflow and underflow.

How can semaphores be used to solve the producer-consumer problem?

• Semaphores are used to increase the speed of the consumer process.

• Semaphores manage access to shared resources, ensuring producers and consumers operate without conflicts.

• Semaphores allow producers to create multiple items simultaneously.

• Semaphores prevent producers from accessing shared resources altogether.

What is the dining philosophers problem and its significance in synchronization?

• The dining philosophers problem demonstrates the challenges of synchronization and resource sharing in concurrent programming.

• It illustrates the importance of single-threaded programming.

• The dining philosophers problem is a cooking technique.

• The problem focuses on the benefits of using multiple resources without synchronization.

List the conditions that must be satisfied to avoid deadlock in the dining philosophers problem.

• 1. Mutual Exclusion, 2. Hold and Wait, 3. No Preemption, 4. Circular Wait

• Immediate Allocation

• Resource Sharing

• Sequential Execution

How does a binary semaphore differ from a counting semaphore?

• A binary semaphore is limited to two states (0 and 1), while a counting semaphore can represent multiple states (any non-negative integer).

• A binary semaphore can represent any non-negative integer, while a counting semaphore is limited to two states.

• A binary semaphore is used for multiple threads, while a counting semaphore is used for single-threaded applications.

• A binary semaphore can be reset, while a counting semaphore cannot be reset once set.

What are the advantages of using semaphores over mutexes?

• Semaphores can manage multiple concurrent accesses and facilitate signaling between threads, unlike mutexes which provide exclusive access.

• Semaphores are simpler to implement than mutexes.

• Mutexes can manage multiple concurrent accesses and facilitate signaling.

• Semaphores provide exclusive access to resources like mutexes.

Explain how process states transition during execution.

• Process states transition through New, Ready, Running, Waiting, and Terminated.

• New, Running, Waiting, Completed, Terminated

• New, Ready, Running, Suspended, Terminated

• New, Ready, Running, Blocked, Finished