Scribd
Upload
12 views

Ia1 Os

Uploaded by

1by20et042
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
12 views

Ia1 Os

Uploaded by

1by20et042
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

Q.

NO Questions

1.a Define Operating System. Explain its goals.


b Distinguish between the following terms. (i)Program and Job (ii)Process and Sub-
request.
2.a List and describe the various architectural supports required and
techniques used for improving the performance in multiprogramming O.S.
b Apply the memory management technique used to manage the memory
efficiently in time sharing O.S.
3.a Explain the layered approach of operating system structure with a diagram.
b Differentiate between the following: i) Main memory vs Secondary memory
ii) SSD vs HDD
4.a Describe the various functions of an operating system.
b List and explain the various operating system classes with respect to key features
and prime concerns.
5.a What are the various components of process environment? Explain the
various fields of PCB and explain the importance of each field.
b Explain the various resource allocation techniques used for resources
allocation.

6.a What is pre-emption and non-pre emption? Explain with an example.


b Classify Real-time operating systems based on their performance and applications
with an example.
7a Describe the conditions under which the fundamental state transitions occur for a
process with a neat diagram.
b Calculate average waiting and turnaround times by drawing the Gantt chart using
FCFS as well as SRN algorithms for the following processes shown below::-
Processes Arrival time Burst Time
P1 0 24
P2 0 3
P3 0 3
Which is the best scheduling algorithm among the two in this case? Justify.
8.a Examine the average turn-around and waiting times by drawing the Gantt chart
using LCN and SRN algorithms for the following process, time quantum =1ms:-
Processes Arrival time Burst Time
P1 0 4
P2 3 5
P3 5 5
P4 6 4
P5 8 2
Compare the two methods and comment on the best method.
8b Distinguish between User-level and Kernel-level threads in an operating system.
9a What is a priority scheduling technique? Explain the different types of priority
scheduling.
9b Estimate the pre-emptive priority scheduling policy's average waiting time of the
following processes.
Processes Arrival time Burst Time Priority
P1 0 11 2
P2 5 28 0
P3 12 2 3
P4 2 10 1
P5 9 16 4

10a Interpret the process of Fair-share scheduling in Unix with an example.


10b Using Round-Robin scheduling policy of time quantum=2 units, determine the
average waiting time and average turnaround time for the following process:-
Processes Arrival time Burst Time
P1 0 5
P2 1 3
P3 2 1
P4 3 2
P5 4 3

You might also like