- Explain clearly short-term and long-term scheduling.
- What do you mean by the processor scheduling ? Explain the various levels of scheduling .
- What are semaphores? How does semaphores solve dinning philosopher problem.
- Explain Peterson solution for mutual exclusion.
- Define race condition. List the requirements that a solution to critical section problem must satisfy.
- Explain critical section problem. How are semaphores used for solving critical section problem?
- What is preemptive and non preemptive scheduling? Discuss one preemptive and one non preemptive scheduling algorithm.
- Explain producer and consumer problem. How it solved using semaphore?
- Explain race condition.
- What is dining philosopher’s problem? Explain the solution of this problem by a suitable example
Describe following: (i) Semaphore.
(ii) Wait() operation
(iii) Signal() operation
- Consider the following set of process with the arrival time and CPU burst time given in milliseconds
| Processes | Arrival time | CPU burst time |
| P1 | 0 | 5 |
| P2 | 1 | 3 |
| P3 | 2 | 3 |
| P4 | 3 | 1 |
- What is avg. waiting time for these processes with the preemptive shortest job first scheduling? .
- Consider the following set of processes
| Processes | Burst time | Arrival time | Priority |
| P1 | 10 | 0 | 2 |
| P2 | 5 | 2 | 1 |
| P3 | 2 | 3 | 0 |
| P4 | 20 | 5 | 3 |
- Draw Gantt charts and calculate average wait time, average turnaround time using following CPU scheduling.
- Preemptive shortest job first
- Non preemptive priority(0=HIGH priority)
- Consider the following set of processes with the length of CPU burst time given in (m sec)
| Processes | Burst time | Priority |
| P1 | 10 | 3 |
| P2 | 1 | 1 |
| P3 | 2 | 3 |
| P4 | 1 | 4 |
| p5 | 5 | 2 |
- Draw 4 gantt charts illustrating the execution of these processes using FCFS, SJF, non preemptive priority(a smaller priority number implies a higher priority) and RR(quantum=1) scheduling.
- What is turnaround time of each process for each of the scheduling algorithms in part (i)?
- What is the waiting time of each process for each of the scheduling algorithm in part (i)?
- Which of the schedules in part (i) results in the minimal average waiting time.
