Scribd
Upload
11 views2 pages

Os Upload 3

Uploaded by

dusravalorant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Os Upload 3

Uploaded by

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

B.

Tech CSE, SE and CC


Assignment 1 (2023-24)
Semester – 4th
Subject Name:Operating System
1. What is Operating System? What are the various services provided by the
operating system?
2. What is process? Explain five state process model and explain each state
transition?
3. What is Linux OS? What is shell? What are the different types of shell in
Linux?
4. What is thread? Explain the difference between process and thread?
5. What are the user level threads and kernel level threads?
6. What is the use of process control block? Discuss the content of PCB.
Discuss how the PCB’s are chained together to form a list of ready processes.
7. Explain with the help of diagram how System call will be is generated?
8. Describe microkernel and monolithic kernel structure.
9. What is the need of thread ?Describe any four advantages of multithreading
model.
10. Write short note on i) Multiprogramming OS ii) Priority Based process
scheduling
11. Consider Five Processes P1 to P5 arrived at same time. They have estimated
running time 10, 2, 6, 8 and 4 seconds, respectively. Their Priorities are 3, 2,
5, 4 and 1, respectively with 5 being highest Priority. Find the average
turnaround time and average waiting time for Round Robin (quantum time=3)
and Priority Scheduling algorithm.
12. Consider the processes P1, P2, P3, P4 with burst time is 21, 3, 6 and 2
respectively, arrives for execution in the same order, with arrival time 0, draw
GANTT chart and find the average waiting time using the FCFS and SJF
scheduling algorithm.
13. Consider three processes (process id 0, 1, 2 respectively) with compute time
bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the
longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are
broken by giving priority to the process with the lowest process id. What is
average turn around time and waiting time?
14. Consider the 3 processes P1,P2,, and P3 shown the the table.
Process Arrival time Time Units Required
P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS, SJF and RR2
(round robin scheduling with CPU quantum of 2 time units) .Calculate average
response time,ATAT,AWT?
15. Explain structure of Operating System.
16. Discuss role/functions of OS as a resource manager.
17. Explain the different types of operating system.
18. What is RAG? Explain briefly.
19. What is deadlock? Explain necessary and sufficient conditions for deadlock to occur.
20. Explain how deadlock can be prevented.
21. consider the following situation of system

Answer the following questions using Banker's algorithm.


i) What is the content of need matrix.
ii) Is the system in safe state? Give the safe sequence.
iii) If the request from process P1 arrives for (0, 4, 2, 0) can it be granted
immediately?
22. Explain Deadlock recovery in brief.

(Subject Teacher)
Ms. Snehal Kathale
Ms. Roshni Patel

NOTE: Submit Assignment before Submission date.


Submission Date: 07/03/2024

You might also like