UNIT-2:
Subjective:
Short:
1. Define a process and what are the various states a process can be in?
2. What are the various components of a Process Control Block?
3. What is meant by context switch?
4. List the scheduling criteria used in CPU scheduling.
5. Define a thread and give the benefits of going for threads?
6. What are the various thread models?
7. Why do we need to go for Process synchronization?
8. What are the different Preemptive and Non-preemptive scheduling algorithms?
9. What is a Semaphore and list the types of semaphores.
10. What is Critical Section Problem and explain the three conditions to solve it.
Long:
1. Sketch the process life cycle with a neat diagram and explain it.
2. Consider the following set of process that arrive at time 0, with the length of the CPU burst
given in milliseconds
Process Burst time
P1 24
P2 16
P3 8
P4 13
Calculate the average waiting time using FCFS, SJF, RR (TS=3)
3. Consider the following set of process with the arrival time, with the length of the CPU burst
given in milliseconds
Process Arrival Time Burst time
P1 0 9
P2 3 2
P3 1 7
P4 2 4
Calculate the average waiting time using FCFS, SRT, RR (TS=3)
4. Distinguish between a process and thread.
5. By illustrating process P1 structure, explain Peterson’s solution to critical section problem.
6. Explain readers & writers problem & its solution using semaphores
7. Discuss the classic problems of synchronization.
8. Give a solution for dining philosopher’s problem using monitors.
9. Discuss various concurrency control algorithms.
10. Explain the schedulers and scheduling queues used in CPU scheduling.