Scribd
Upload
32 views1 page

OS-Assignment Questions-Mid 1 (A.y 2024-25)

The document outlines a set of assignment questions related to operating systems, covering topics such as scheduling types, process differentiation, safety in resource allocation, turnaround and waiting time calculations, deadlock conditions, system calls, and the properties of various operating systems. It includes specific scenarios for students to analyze and solve, such as determining system safety and calculating average times using different scheduling algorithms. Additionally, it addresses critical section problems and solutions, emphasizing the theoretical and practical aspects of operating systems.

Uploaded by

dandamshravanthi0205
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
32 views1 page

OS-Assignment Questions-Mid 1 (A.y 2024-25)

The document outlines a set of assignment questions related to operating systems, covering topics such as scheduling types, process differentiation, safety in resource allocation, turnaround and waiting time calculations, deadlock conditions, system calls, and the properties of various operating systems. It includes specific scenarios for students to analyze and solve, such as determining system safety and calculating average times using different scheduling algorithms. Additionally, it addresses critical section problems and solutions, emphasizing the theoretical and practical aspects of operating systems.

Uploaded by

dandamshravanthi0205
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/ 1

Operating Systems Assignment questions – Mid 1:

1 . Describe the difference among Short-term ,Medium-term, and Long-term scheduling .

2. a) Differentiate between Process and Program.

b). Draw & explain process state diagram.


3. Consider the following snapshot

Allocation Max Available


ABCD ABCD ABCD
PO 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Find if the system is SAFE? Determine the Need matrix ?
If a request from process P1 arrives for (0,4,2,0), can the request be granted
immediately?
4. Consider the following snapshot
P.NO A.T B.T
P1 0 4
P2 1 5
P3 2 2
P4 3 1
P5 4 6
P6 6 3
Calculate average turnaround time and Average waiting time using Round Robin (TQ=4).

5. Consider the following snapshot.


All five processes arrive at time 0, in the order given.

P.NO B.T
P1 10
P2 29
P3 3
P4 7
P5 12
Consider the FCFS , SJF, Round Robin (TQ=10 milliseconds) scheduling algorithms for this
set of processes. Which algorithm would give the minimum average waiting time?

6. What is Deadlock. What are the necessary conditions for deadlock?


7. What is a System Call? Write a C program on fork() and exec() system call.
8. Define the essential properties of the following types of operating systems:
i) Batch ii) Interactive iii) Time sharing iv) Real time v) Parallel vi) Distributed .
9. What is an Operating System? Explain about the
Services of Operating System.
10. a) Define Critical Section problem. What are its requirements?
b)Write and explain Peterson’s solution to the Critical section problem

You might also like