36

36
Total No. of Questions : 6]
SEAT No. : OR

ER

ER
P5386 [Total No. of Pages : 2 Q4) a) For the table given below, calculate average waiting time and average

RV

RV
turnaround time, also draw a Gantt Chart illustrating the process execution
T.E./Insem.-644 using following scheduling algorithms. [8]

SE

SE
T.E. (Information Technology) i) FCFS ii) SJF (preemptive)

:50

:50
OPERATING SYSTEM (Semester - I)

1
:08

:08
/20 309

/20 309
(2015 Pattern) Process Arrival Time Burst Time

11

11
Time :1 hour] [Max. Marks :30 P1 0 9
11 P01

11 P01
17

17
Instructions to the candidates:
P2 1 1
1) Answer Q.1 or Q.2, Q.3or Q.4, Q.5 or Q.6.
6.2 EG

6.2 EG
/08

/08
2) Neat diagrams must be drawn wherever necessary. P3 2 7

6
3) Figures to the right indicate full marks. P4 3 1

R3

R3
.21 C

.21 C
38

38
4) Assume suitable data, if necessary.

VE

VE
P5 4 6

ER

ER
Q1) a) State and explain different services provided by an Operating System.[6] b) Define Context Switch. [2]

S
b) Explain the following shell commands with example. [4]
48

48
:50

:50
Q5) a) Consider the following snapshot of a system: [6]
1

1
.2

.2
:08

:08
i) Chmod ii) Grep iii) Cat iv) Sort
/20 309

/20 309
49

49
Allocation Maximum Available
11

11
OR A B C D A B C D A B C D
11 P01

11 P01
17

17
Q2) a) Explain the concept of virtual machine with its benefits. [4] P0 0 0 1 2 0 0 1 2 1 5 2 0
b) Write a shell script for sorting a given list of numbers using any sorting
6.2 EG

6.2 EG
/08

/08
P1 1 0 0 0 1 7 5 0
strategy. [6]

36

36
P2 1 3 5 4 2 3 5 6
C

C
ER

ER
38

38
P3 0 6 3 2 0 6 5 2
RV

RV
Q3) a) For the table given below calculate average waiting time and average P4 0 0 1 4 0 6 5 6
SE

SE
turnaround time and draw a Gantt Chart illustrating the process execution
1

1
8.2

8.2
using following scheduling algorithms. [8] Answer the following questions using banker's algorithm.
0

0
.24

.24
8:5

8:5
i) What are the contents of Need matrix?
71 1

71 1
i) RR (Time slice-2units) ii) SJF (non-preemptive)
9

9
49

49
1:0

1:0
ii) Is the system in a safe state?
8/2 30

8/2 30
Process Arrival Time Burst Time
b) Explain busy waiting with appropriate example? [4]
1

1
P1 0 8
01

01
P0

P0
OR
P2 1 5
G

G
P3 3 3 Q6) a) Write a pseudo code for producer-consumer problem using semaphores.[6]
1/0

1/0
CE

CE
b) Explain the necessary and sufficient conditions for the occurrence of a
81

81
P4 4 1
deadlock. [4]
.23

.23
P5 6 4
16

16
b) Differentiate between process and thread. [2] M M M
8.2

8.2
.24

.24
P.T.O. T.E./Insem.-644 2
49

49
JOIN @PuneEngineers | Telegram JOIN @PuneEngineers | Telegram

Total No. of Questions :6] SEAT No. : b) Suppose that a process spawns another process using fork system call.[2]
P5699 [Total No. of Pages :2 What if the parent process completes the execution before child process?
TE/INSEM./OCT.-145 What if the child process completes the execution before parent process?
7

7
6:0

6:0

T.E. (Information Technology) OR

0:5

0:5

Q4) a) For the table given below, calculate average waiting time and average
OPERATING SYSTEM
81

81
1

turnaround time and draw a Gantt Chart illustrating the process execution
09

09

(2015 Pattern) (Semester - I) using following scheduling algorithms. [8]

01

01
8/2

8/2
3

i) SJF (non-preemptive) ii) Priority (Preemptive)

01

01

Time : 1 Hour] [Max. Marks :30

0/0

0/0

Instructions to the candidates: Process Arrival Time Burst Time Priority

GP

GP
81

81

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6. P1 0 9 3

.23

.23
CE

CE

2) Neat diagrams must be drawn wherever necessary.

P2 1 1 2
16

16

3) Figures to the right indicate full marks.

8.2

8.2

P3 2 7 1
4) Assume suitable data, if necessary.
:07

:07
.24

.24

P4 3 1 5
:56

:56

Q1) a) What is operating system? State and explain the basic functions of
49

49

P5 4 6 4
10

10

Operating System. [6]

1

1
18

18
09

09

b) Explain the following shell commands with example: [4]

/20

/20

Note: For priority scheduling, minimum value indicates higher priority.

3

i) echo ii) grep iii) touch iv) ls

/08

/08
.23 01

.23 01

b) Differentiate between user level and kernel level threads. [2]

OR
10

10
GP

GP
8

Q2) a) Differentiate between monolithic and microkernel architectures. [4] Q5) a) Explain the following terms: [6]
CE

CE
16

16

b) Write a shell script to check if given string is a palindrome or not. [6] i) Mutual Exclusion
8.2

8.2

ii) Synchronization
:07

:07

Q3) a) For the table given below, calculate average waiting time and average
.24

.24

iii) Race condition

turnaround time and draw a Gantt Chart illustrating the process execution
:56

:56
49

49

using following scheduling algorithms. [8]

10

10

b) Differentiate between named pipe and unnamed pipe. [4]

1

1
18

18

i) Round Robin (time slice - 2 units) ii) Priority (non-preemptive)

09

09
/20

/20

OR
13

13

Process Arrival Time Burst Time Priority

/08

/08

Q6) a) Write a deadlock-free solution for dining philosophers problem using

P0

P0

P1 0 3 5
10

10

semaphore. [6]
G

G
8

P2 2 6 2
.23

.23
CE

CE

P3 4 4 4 b) Explain the necessary and sufficient conditions for the occurrence of a

16

16

deadlock. [4]
8.2

8.2

P4 6 5 3
.24

.24

P5 8 2 1
49

49

Note: For priority scheduling, minimum value indicates higher priority.


TE/INSEM.-145 1 P.T.O. TE/INSEM.-145 2

JOIN @PuneEngineers | Telegram JOIN @PuneEngineers | Telegram

Total No. of Questions :6] SEAT No. : b) How PCB helps in process management? Explain the structure of PCB.

8
23

23
[2]
P75 [Total No. of Pages :3

i c-

i c-
Oct./ TE/ Insem. - 194 OR

t at

t at
T.E. (Information Technology) Q4) a) For the table given below calculate the average waiting time and average

s
:11

:11
OPERATING SYSTEM turn around time and draw a Gantt Chart illustrating the process execution

1
:37

:37
using following scheduling algorithms.

/20 09

/20 09
(2015 Course) (Semester - I) (314444)

10

10
3 i) RR (Time slice - 2 units) [8]

3
19

19
22 01

22 01
Time : 1 Hour] [Max. Marks :30 ii) FCFS
Instructions to the candidates:
P

P
Process Arrival Time Burst time
/08

/08
6.2 EG

6.2 EG
1) Answers Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6.
2) Neat diagrams must be drawn wherever necessary. P1 0 4

8
C

C
23

23
38

38
3) Figures to the right side indicate full marks. P2 1 5

ic-

ic-
4) Assume suitable data, if necessary.

tat

tat
1

1
P3 2 2
8.2

8.2
1s

1s
P4 3 1
.24

.24
:1

:1
Q1) a) Write C program for fork system call in which main program accept the
1

1
:37

:37
49

49
array, parent process sort and display the element in ascending order
/20 09

/20 09
P5 4 6
10

10
whereas child process sort and print elements in descending order by
3

3
using any sorting strategy. [6] P6 6 3
19

19
22 01

22 01
b) Explain the difference between the monolithic kernel and a microkernel b) Differentiate between thread and process. [2]
P

P
with advantages and disadvantages.
/08

/08
[4]
G

G
OR
CE

CE
8

8
Q5) a) Consider the following snapshot of a system: [6]
-23

-23
38

38
Q2) a) Explain the concept of virtual machine with its implementation and benefits.
.2

.2
Also explain example of virtual machine. [6]
tic

tic
Allocation Maximum Available
16

16
sta

sta
b) State and explain different services provided by an operating sytem. [4]
.2

.2
A B C D A B C D A B C D
48

48
1

1
7:1

7:1
.2

.2
P0 0 0 1 2 0 0 1 2 1 5 2 0
01 91

01 91
Q3) a) For the table given below calculate the average waiting time and average
49

49
0:3

0:3
turn around time and draw a Gantt Chart illustrating the process execution
0

0
P1 1 0 0 0 1 7 5 0
91

91
using following scheduling algorithms. [8]
2/0 13

2/0 13
i) RR (Time slice -2 units) P2 1 3 5 4 2 3 5 6
8 2 P0

8 2 P0
8/2

8/2
ii) SJF (non-preemptive) P3 0 6 3 2 0 6 5 2
G

G
Process Arrival Time Burst time
CE

CE
P4 0 0 1 4 0 6 5 6
P1 0 10
.23

.23
Answer the following question using banker’s algorithm.
P2 1 06
16

16
P3 2 12 i) What are the contents of need matrix?
8.2

8.2
P4 3 15 ii) Is system in a safe state?
.24

.24
TE/ Insem. - 194 1 P.T.O. TE/ Insem. - 194 2
49

49
JOIN @PuneEngineers | Telegram JOIN @PuneEngineers | Telegram

b) Write a Semaphore solution for reader-writer problem. [4]

8
-23

OR
tic
sta

Q6) a) What is busy waiting with respect to process synchronization? Explain

how semaphore solves problem of synchronization. [6]
:11
91
:37

b) How resource allocation graph helps to deadlock? Write the necessary

10

conditions of deadlock to be occurred. [4]

0
2/0 13
19
20
0
.23 GP

8/

Unit-1
 1 Define Operating system and explain services of OS.
CE
82

2 Define operating system and explain different components of operating system.

23

3 Explain any two types of operating system

ic-

4 Explain multiprogramming operating system.

16

tat

5 Explain any two components of operating system.

8.2

1s

6 Explain time sharing operating system.

.24

7:1

7 Explain real time operating system with its types.

1
49

0:3

8 Explain layered structure of operating system.

09

9 Explain microkernel based operating system.

91
2/0 13

10 Explain virtual machine os.

01

11 Explain system call with example.

8 2 P0
8/2

12 List different types of system call

G

13 Explain user view and system view of operating system.

UNIT-2
CE

38

14 Define Process. Explain process state transition diagram.

c-2
.23

2 Define PCB and explain role of PCB.

i

3 Define thread and its types.

16

tat

4 Explain operations on process.

8.2

1s

5 Define threads and advantages of thread.

.24

7:1

6 Explain different types of schedulers.

1
49

0:3
09

7 Explain queuing diagram.

8 Define following: Ready queue, Job queue, Device queue.
91
2/0 13
01

JOIN @PuneEngineers | Telegram

8 2 P0
8/2
G
CE
.23
16
8.2
.24

TE/ Insem. - 194 3

49

JOIN @PuneEngineers | Telegram

 9 Compare preemptive scheduling and non-preemptive scheduling. 16 Consider following set of processes executing on a uniprocessor system.
10 Explain different scheduling criteria. Process BT
11 Define Throughput, CPU utilization, Response Time, Waiting Time, Turnaround Time. P1 6
12 Explain multilevel queue scheduling. P2 5
13 Explain multilevel feedback queue scheduling. P3 4
14 Describe inter process communication in brief. P4 2
15 Consider following set of processes executing on a uniprocessor system. P5 1
Process AT BT Draw a Gantt chart and calculate average turnaround time and average waiting time for following
P1 0 12 CPU scheduling algorithm.
P2 1 11 1.FCFS
P3 3 10 2.SJF-Non Preemptive
3.Round Robin(Time Slice=2)
P4 5 7

P5 5 6 17 Consider following set of processes executing on a uniprocessor system.

P6 7 3 Process AT BT
P7 10 2 P1 0 5
Draw a Gantt chart and calculate average turnaround time and average waiting time for following P2 3 2
CPU scheduling algorithm. P3 1 3
1.SJF-Non Preemptive P4 4 1
2.SJF-Preemptive Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram JOIN @PuneEngineers | Telegram

18 Consider following set of processes executing on a uniprocessor system. 20 Consider following set of processes executing on a uniprocessor system.
Process AT BT Process BT
P1 0 16 P1 6
P2 0 10 P2 5
P3 6 4 P3 4
P4 7 6 P4 2
P5 8 10 P5 1
Draw a Gantt chart and calculate average turnaround time and average waiting time for following Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm. CPU scheduling algorithm.
1.FCFS 2.Round Robin(Time Quantum=5) 1.FCFS
19 Consider following set of processes executing on a uniprocessor system. 2.SJF-Non Preemptive
Process AT BT 3.Round Robin(Time Slice=2)
P1 0 3 21 Consider following jobs to be executed on a uniprocessor system.
P2 2 6 Job AT BT
P3 4 4 P1 0 15
P4 7 2 P2 2 11
Draw a Gantt chart and calculate average turnaround time and average waiting time for following P3 3 10
CPU scheduling algorithm.
P4 6 6
1.SJF-Non Preemptive
P5 10 1
2.SJF-Preemptive
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram JOIN @PuneEngineers | Telegram

 22 Consider the following set of process with length of the CPU burst given in ms:
Process Burst Priority
Time
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The Processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a. Draw Gantt charts that illustrates the execution of these processes using the following scheduling
algorithms: FCFS, SJF, Non preemptive priority.
b. What is turnaround time of each process for each of the scheduling algorithm?
c. What is waiting time of each process for each of the scheduling algorithm?

UNIT-3
1 Explain following terms: Race Condition, Critical Section, and Mutual Exclusion.
2 Why there is need of synchronization? What is critical section problem?
3 Which conditions must three requirements for critical section problem.
4 Explain Peterson’s solution for two process.
5 Short note on Locks and Test and Set, swap instruction.
6 Define Semaphore and its use.
7 Define deadlock, explain necessary conditions to occur deadlock.
JOIN @PuneEngineers | Telegram
Total No. of Questions : 4] SEAT No. :

8
23

23
Find Average Turnaround Time & Average Waiting Time for SJF
P8578 Oct-22 /TE/Insem-558
[Total No. of Pages : 2

i c-

i c-
(Preemptive)& Round Robin (Time Quantum=2) scheduling algorithms

t at

t at
T.E. (Information Technology) with the help of Gantt chart

s
OPERATING SYSTEMS

:31

:31
(2019 Pattern) (Semester-I) (314442) b) With the help of neat, explain in detail process state transition diagram

1
:55

:55
with two suspend states. [7]

/20 09

/20 09
10

10
Time : 1 Hour] 3 [Max. Marks : 30

3
Instructions to the candidates: OR
22

22
04 01

04 01
1) Attempt Q1 or Q2, Q3 or Q4.
2) Assume suitable data if necessary.
P

P
/10

/10
Q4) a) Discuss with the help of neat diagram different thread models. [5]
6.2 EG

6.2 EG
3) Neat diagrams must be drawn wherever necessary.
4) Figures to the right side indicate full marks. b) List and explain the CPU scheduling criteria. [5]

8
C

C
23

23
38

38
Q1) a) Explain the role operating system as resource manager. [5] c) Explain with the help of neat diagram the process of context switching,

ic-

ic-
also explain how program counter plays its role in context switching.

tat

tat
b) Give the significance of following shell commands with example: is, uniq,
1

1
[5]
8.2

8.2
1s

1s
tail, touch grep. [5]
.24

.24
:3

:3
1

1
c) Describe the differences between a monolithic kernel and a microkernel.
:55

:55
49

49
/20 09

/20 09
[5]
10

10
3

3
22

22
04 01

04 01
OR 
P

P
/10

/10
G

G
Q2) a) What is an operating system? List and explain services provided by the
CE

CE
operating system. [5]

8
-23

-23
38

38
b) Write a shell script to check if the given string is palindrome or not. [5]
.2

.2
tic

tic
16

16
sta

sta
c) Explain about the concept of virtual machines and its advantages. [5]
.2

.2
48

48
1

1
5:3

5:3
.2

.2
02 91

02 91
Q3) a) Consider the Set of Processes with Arrival Time, Burst Time & Priority
49

49
0:5

0:5
[8]
0

0
21

21
4/1 13

4/1 13
Process Arrival Time Burst Time
8 0 P0

8 0 P0
0/2

0/2
P1 7 5
G

G
P2 3 4
CE

CE
P3 10 3
.23

.23
16

16
P4 0 8
8.2

8.2
P5 12 6
.24

.24
49

49
TE/Insem/558 2
P.T.O.

Total No. of Questions : 4] SEAT No. :

8

b) Consider the following set of processes with the length of the CPU burst
-23

-23

P5055 [Total No. of Pages : 2 time given in milliseconds.

tic

tic

[6187]-458
sta

sta

Process Arrival Time Burst Time Priority

T.E. (Information Technology) (Insem)
:22

:22

OPERATING SYSTEMS P1 0 3 2
91

91
:47

:47

(2019 Pattern) (Semester - I) (314442) (Theory)

10

10
0

P2 1 6 1
5/0 13

5/0 13
23

23

Time : 1 Hour] [Max. Marks : 30

20

20
0

Instructions to the candidates: P3 4 4 3

.23 GP

.23 GP
9/

9/

1) Answer Q.1 or Q.2 and Q.3 or Q.4.

2) Assume suitable data if necessary.
CE

CE

P4 6 2 4
80

80
8

3) Neat diagrams must be drawn wherever necessary.

23

23

4) Figures to the right indicate full marks.

ic-

ic-
16

16
tat

tat

Draw the gantt charts illustrating the execution of these processes using
8.2

8.2
2s

2s

Q1) a) Describe the concepts of virtual machines with its implementation and priority (non premptive) and SJF (premptive) algorithms. Calculate average
.24

.24
7:2

7:2

benefits. Brief the example of virtual machine. [7] waiting time and average turnaround time. [8]
1

1
49

49
0:4

0:4
09

09

b) Define operating system. Explain basic functions of operating system.[8]

31

31
5/0 13

5/0 13

OR
02

02
8 0 P0

8 0 P0
9/2

9/2

OR
G

Q4) a) Differentiate between user level threads and Kernel level threads. [5]
CE

CE
38

38

Q2) a) Explain the following operating systems [5] b) Why PCB is required? Explain the elements of PCB. [5]
c-2

c-2
.23

.23
i

i
16

16

c) Explain fork ( ) and wait ( ) system call in detail. [5]

tat

tat

i) Batch OS
8.2

8.2
2s

2s
.24

.24

ii) Real time OS

7:2

7:2
1

1
49

49
0:4

0:4
09

09

b) Illustrate the difference between a micro Kernel and a layered Kernel  

31

31
5/0 13

13

architectures of operating system with the help of neat diagrams. [5]

02

02
8 0 P0

P0
9/2

9/2

c) Write a shell script to find the factorial of a given number. [5]

G

G
5/0
CE

CE
80
.23

.23

Q3) a) Enlist different process states. Draw and explain process state transition
16

16

diagram. [7]
8.2

8.2
.24

.24
49

49

P.T.O. [6187]-458 2