9

13

10

4

11

14

13

10

11

There will be a random output after every execution.

12

Step 2 of P1, Steps of P2, Step 1 of P1

Every time, there will be a random output.

Step 1 of P1, Steps of P2, Step 2 of P1

Steps of P2, Step 1 of P1, Step 2 of P1

This situation may create a deadlock.

Step 1 of P1, Step 2 of P1, Steps of P2

Steps of P2, Step 2 of P1, Step 1 of P1

Step 2 of P1, Step 1 of P1, Steps of P2

Flag_1 = True, Flag_2 = True, Turn = 2

Flag_1 = True, Flag_2 = False, Turn = 2

Flag_1 = False, Flag_2 = True, Turn = 2

Peterson’s Solution uses strict alternation; therefore, Process P1 cannot enter the critical section.

Flag_1 = False, Flag_2 = False, Turn = 2

Flag_1 = True, Flag_2 = True, Turn = 1

Flag_1 = False, Flag_2 = True, Turn = 1

Flag_1 = True, Flag_2 = False, Turn = 1

Flag_1 = False, Flag_2 = False, Turn = 1

Bad scheduling

Higher overhead

Increased CPU utilization

Decreased CPU speed

Higher power consumption

Desynchronization

Higher memory consumption

Lower average waiting time

The process will be forked.

The process will be terminated.

It depends on how long the I/O will take.

A new process thread will be created.

The PCB of the process won’t be saved unless the I/O is completed.

The process will continue its execution.

The process will be preempted.

Round Robin

First Come, First Served

CFS scheduler

Priority Scheduling

O(1) scheduler

Shortest Job First

None of the mentioned ones can lead to starvation

It schedules processes for execution.

It allows a process to request services from the kernel.

It enables inter-process communication by bypassing the kernel.

It provides direct access to hardware without kernel intervention.

It translates high-level programming code into machine code.

It allows multiple threads to communicate with each other.

It facilitates scheduling of processes.