1. Define process and Explain process states in details with diagram (Life cycle of a process).
2. Explain process control block in detail.
3. What is thread? Explain multithreading in detail.
4. What are various criteria for a good process scheduling algorithm?
5. Explain the following process scheduling algorithm with example.
A. FCFS
B. Priority scheduling
C. Shortest job first scheduling
D. Round robin
6. Write a short note on context switching.
7. Differentiate between long-term, short-term and medium-term schedulers.
8. Explain two fundamental models of inter-process communication (IPC).
9. Explain the terms related to IPC –a) Race condition b) critical section c) Mutual exclusion d)
Semaphores.
10. Explain Peterson’s solution for achieving mutual exclusion.
11. Write a short note a) Multiple-processor scheduling b) Load Balancing c) Processor Affinity.
12. Define a) Semaphores b) Monitors c) Deadlocks d) Race condition.
13. Consider following processes with length of CPU burst time in milliseconds
Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round
robin(quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm.
14. Consider following processes with length of CPU burst time in millisecond
Process Brust time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All processes arrived in order p1, p2, p3, p4, p5 all at time zero.
1) Draw Gantt charts illustrating execution of these processes for FCFS, non-preemptive priority
(smaller priority number implies a higher priority).
2) Calculate waiting time for each process for each scheduling algorithm
3) Calculate average waiting time for each scheduling algorithm.