Total No. of Questions :6] SEAT No.

:
P5699 [Total No. of Pages :2
TE/INSEM./OCT.-145

7
6:0
T.E. (Information Technology)

0:5
OPERATING SYSTEM

81
8/2 1
9
(2015 Pattern) (Semester - I)

01
8 1 30
.23 01
Time : 1 Hour] [Max. Marks :30
0/0
Instructions to the candidates:
8.2 G
P

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

.24 CE

2) Neat diagrams must be drawn wherever necessary.

16

3) Figures to the right indicate full marks.

4) Assume suitable data, if necessary.

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

0:5
Operating System. [6]
81
91
b) Explain the following shell commands with example: [4]
01
30
8/2

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

01
0/0

OR
GP
81

Q2) a) Differentiate between monolithic and microkernel architectures. [4]

.23
CE
16

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

8.2

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

6:0
turnaround time and draw a Gantt Chart illustrating the process execution
49

0:5

using following scheduling algorithms. [8]

81
91

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

01
30
8/2

Process Arrival Time Burst Time Priority

01
0/0

P1 0 3 5
GP
81

P2 2 6 2
.23
CE

P3 4 4 4
16
8.2

P4 6 5 3
.24

P5 8 2 1
49

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

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

JOIN @PuneEngineers | Telegram

 b) Suppose that a process spawns another process using fork system call.[2]
What if the parent process completes the execution before child process?
What if the child process completes the execution before parent process?

7
6:0
OR

0:5
Q4) a) For the table given below, calculate average waiting time and average

81
8/2 1
turnaround time and draw a Gantt Chart illustrating the process execution

9
using following scheduling algorithms. [8]

01
8 1 30
i) SJF (non-preemptive) ii) Priority (Preemptive)
.23 01
Process 0/0
Arrival Time Burst Time Priority
8.2 G
P

P1 0 9 3
.24 CE

P2 1 1 2
16

P3 2 7 1

7
6:0
P4 3 1 5
49

0:5
P5 4 6 4
81
91
01
30

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

8/2
01

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

0/0
GP
81
.23

Q5) a) Explain the following terms: [6]

CE
16

i) Mutual Exclusion
8.2

ii) Synchronization
7
.24

6:0
iii) Race condition
49

0:5

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

81
91
01
30
8/2

OR
01

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

0/0

semaphore. [6]
GP
81
.23
CE

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

16

deadlock. [4]
8.2
.24
49


TE/INSEM.-145 2

JOIN @PuneEngineers | Telegram