0% found this document useful (0 votes)
7 views2 pages

Sep - 2024

Uploaded by

Mad world
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
0% found this document useful (0 votes)
7 views2 pages

Sep - 2024

Uploaded by

Mad world
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

Total No. of Questions : 4] SEAT No.

8
23
PC55 [Total No. of Pages : 2

ic-
[6360]-56

tat
T.E. (Information Technology) (Insem)

3s
OPERATING SYSTEMS

8:5
(2019 Pattern) (Semester - I) (314442)

02 91
0:3
0
41
Time : 1 Hour] [Max. Marks : 30
2/0 13
Instructions to the candidates:
0
1) Attempt Q1 or Q2, Q3 or Q4.
9/2
.23 GP

2) Neat diagrams must be drawn wherever necessary.


3) Figures to the right indicate full marks.
E

4) Assume suitable data, jf necessary.


80

8
C

23
ic-
Q1) a) What is multiprogramming, multitasking and multiprocessing? Discuss
16

tat
8.2

with an example. [5]

3s
.24

8:5
91
49

0:3
b) Define operating system. Discuss objectives and functions of operating
30
41

system. [5]
01
02
9/2
GP

c) Discuss following command with an example - pwd, ps, touch, fork,


2/0

uniq. [5]
CE
80

8
23
.23

OR ic-
16

tat
8.2

3s
.24

Q2) a) Explain serial processing OS and simple batch OS. [5]


8:5
91
49

0:3
30
41

b) Write a shell script to identify whether the given string is palindrome or


01
02

not. [5]
9/2
GP
2/0

c) Describe the read and echo commands with various options in BASH
CE
80

scripting. Provide an example of how you can use it. [5]


.23
16
8.2
.24

P.T.O.
49
Q3) a) How does a process more between different states in an operating system.

8
23
Explain with the help of state transition diagram. [7]

ic-
tat
b) Consider a multitasking OS, with four tasks, with the length of the CPU

3s
burst time given in milliseconds.

8:5
02 91
Process Arrival Time Burst Time Priority

0:3
0
41
1 2/0 13 0 3 4
0
2 2 6 2
9/2
.23 GP

3 4 4 3
E
80

8
C

23
4 5 2 6

ic-
16

tat
Draw the Gantt chart. Using SJF (non premptive) and priority (premptive).
8.2

3s
Scheduling algorithms. Find average WT and average TAT also. [8]
.24

8:5
91
49

0:3
OR
30
41

Q4) a) Illustrate the difference between process and thread. Explain the typical
01
02

entries in PCB and thread control block. [7]


9/2
GP
2/0

b) Explain the various types of processor schedules with the help of process
CE
80

state transitions. [8]

8
23
.23

ic-
16

tat
8.2

3s
.24

8:5


91
49

0:3
30
41
01
02
9/2
GP
2/0
CE
80
.23
16
8.2
.24

[6360]-56 2
49

You might also like