Attempt any five questions. Question No.01 is compulsory.

1.(A) Which of the following data structures holds the currently allocated instances of resources in
Banker’s Algorithm of handling deadlocks?
(a) Need (b) Available (c) Allocation (d) Max
(B) If we implement deadlock detection algorithm, we claim that system is
(a) Semaphore (b) Deadlock state (c) Circular wait (d) Not in deadlock state
(C) To access the services of operating system, the interface is provided by the
(a) System Call (b) API (c) Library (d) Assembly Instruction
(D) The program in the operating system that does processor management is called
(a) Traffic Controller (b) Dispatcher (c) Process Scheduler (d) Job Scheduler
2. Explain the FCFS, SJF and RR algorithms with Gantt Chart for the four-process given (P1, P2, P3, P4)
and their burst time is (7,3,4,3) in millisecond and their arrival time is (1,1,3,3) in millisecond. Also
find their Turn around time and waiting time. (For RR Algorithm, time quantum is 2)
3. Consider the following page reference string 3,0,2,2,6,9,9,5,0,6,6,1,5,7,6,4,5. How many page faults
could occur for the optimal page replacement and least recently used algorithm. Assume system having
3 frames.
4. Assume that there are five process-
Process Allocation Max. Available
P0 A B C D A B C D A B C D
P1 0 1 1 0 0 2 1 0 1 5 2 0
P2 1 2 3 1 1 6 5 2
P3 1 3 6 5 2 3 6 6
P4 0 6 3 2 0 6 5 2
P5 0 0 1 4 0 6 5 6
(a) Create the need matrix.
(b) Use the safety algorithm to test the system is in safe state.
5. Explain Disk Scheduling and why disk scheduling is necessary.
6. What is a process and process table.
7. What are the differences between Process and Thread?