ASSIGNMENT 2

Q1. What advantages is there in having different time-quantum sizes on different levels of a multilevel queue scheduling?
Q2.What do you understand by process? Explain various states of a process with a suitable diagram. Explain process control block.
Q3.What is scheduling ?What are various criteria for scheduling?
Q4.What are schedulers and various types of schedulers?
Q5.What is process address space and process identification information?
Q6. Write short notes on the following:-
1.Dispatcher
2.Starvation
3.Aging
4.Convoy effect
5.Gantt chart
6.Cooperating processes
7.Multithreaded model
8.Resource allocation graph
9.Quantum
10.Bankers Algorithms(including safety and resource request algorithm).
Q7.What is preemptive and non preemptive scheduling?
Q8.What is a thread and how is it different from process? What are user and kernel level threads?
Q9.What is CPU scheduling ? What are various scheduling algorithms? Explain multiprocessor scheduling. Discuss design issues related to multiprocessor scheduling.
Q10.What is deadlock? What are various conditions for deadlock?
Q11. What is deadlock prevention and deadlock avoidance?
Q12.What are various methods for deadlock detection if:-
1.Single instance of each resource is available in the system.
2.Multiple instances of some resource is available in the system.
Q13.Explain deadlock recovery in detail.
NUMERICALS
Q14.Consider the following snapshot of a system:

Allocation Max Available

ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656




1.What is content of need matrix?
2.Is the system in a safe state?
3.If a request from process P1 arrives for (0,,4,2,0),can the request be granted immediately?
Q15.Consider the following table :
Process Burst Time Priority
P0 10 3
P1 1 1
P2 2 3
P3 1 4
P4 5 2
1.Draw four Gantt chart illustrating the execution of these processes using FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.
2.Calculate average waiting time for each of the scheduling algorithm (FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.)
3.Calculate average turn around time for each of the scheduling algorithm (FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.)