Question 1:
There are six processes given below with their run time units. Assume that all processes arrive in numerical order
at time 0 then answer the questions given below:
Process ID CPU Requirements
P1 5
P2 4
P3 7
P4 1
P5 8
P6 10
Show the scheduling order for these processes under first-come-first-served, shortest-job first, and round-
robin scheduling (quantum = 4).
Question 2:
There are two processes that could take place even at the same time. One process helps in getting amount from
the ATM and the second helps in depositing the money in the bank account through a cheque. You ensure mutual
exclusiveness by using semaphore with wait and signal operations. Write pseudo-code or algorithm for these two
