Scribd
Upload
37 views

Os Assignment 3

The document contains 12 questions regarding operating system concepts like scheduling, process states, context switching, deadlocks, and threads. The questions cover topics such as the differences between preemptive and non-preemptive scheduling, whether a deadlock can involve a single process, components of a process control block, short, long, and medium-term schedulers, and applying the banker's algorithm to determine if a system is in a safe state.

Uploaded by

Student of rec bijnor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views

Os Assignment 3

The document contains 12 questions regarding operating system concepts like scheduling, process states, context switching, deadlocks, and threads. The questions cover topics such as the differences between preemptive and non-preemptive scheduling, whether a deadlock can involve a single process, components of a process control block, short, long, and medium-term schedulers, and applying the banker's algorithm to determine if a system is in a safe state.

Uploaded by

Student of rec bijnor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Rajkiya Engineering College Bijnor

Department: Information Technology


Subject: Operating Systems Subject Code: KCS 401
Assignment-3
Note: Answer to all questions on A4 sized paper in precise manner. Don’t copy others .

Q. no 1: Define the difference between preemptive and non-preemptive scheduling.


Q. no 2: Is it possible to have a dead lock involving only one process? Explain your answer.
Q. no 3: Draw the process state transition diagram. Level all states and transitions.
Q. no 4: Mention the various components of information maintained by process control
block.
Q.n0 5: Discuss salient features of (i) short term (ii) long term (iii) medium-term process
schedulers.
Q.no 6: What is context switch? Name the sequence of events (actions) that take place
during context switch. How to optimize the delay involved in context switching?
Q. no 7: Which of FCFS, SJF and Round-Robin scheduling algorithms can lead to starvation?S
Q. no 8: Consider three processes, all arriving at time zero, with total execution times of
10,20 and 30 units, respectively. Each process spends the first 20% of execution time doing
[/0 (reads the input data), the next 70% of time doing computation, and the last 10% of time
doing [/0 again (prints the results). The operating system uses a shortest remaining compute
time first scheduling algorithm and schedules a new process either when the running
process gets blocked on [/0 or when the running process finishes its compute burst. Assume
that all I/O operations can be overlapped as much as possible. For what percentage of time
does the CPU remain idle?
Q.no 9: Consider the following CPU processes with arrival times (in milliseconds) and length
of CPU bursts (in milliseconds) except for process P4 as given below:

Process Arrival Time CPU Burst Time


P1 0 5
P2 1 1
P3 3 3
P4 4 Z
If the average waiting time across all processes is 2 milliseconds and preemptive shortest
remaining time first scheduling algorithm is used to schedule the processes, what will be the
value of z?
Q. no 10: Consider the following snapshot of a system:

Allocated Maximum Available


Process R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8 7 7 10
P2 2 0 4 4 3 3
P3 1 2 4 3 4 4

Answer the following questions using the banker’s algorithm:


(1) What is the content of matrix need?
(2) Is the system in a safe state?

Q. no 11: Explain in detail about the Threads and their management.


Q. no 12: What is a deadlock? Discuss the necessary conditions for deadlock with examples

You might also like