Total No. of Questions : 8] SEAT No.

:
P820 [5870] - 1141
[Total No. of Pages : 2

T.E. (I.T.)
OPERATING SYSTEMS
(2019 Pattern) (Semeser - I) (314442)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Answer Q1or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
2) Neat diagram must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Assume suitable data, if necessary.

Q1) a) Explain requirements for mutual exclusion. [8]

b) Explain following terms: [9]
i) Principles of concurrency
ii) Semaphores
iii) Mutex
OR
Q2) a) Explain following synchronization problems [8]
i) Readers/ Writers Problem.
ii) Producer and Consumer problem.
b) Explain Inter-process communication using [9]
i) Pipes
ii) Shared Memory
iii) Semaphore

Q3) a) For the given reference string with 4 page frame abvailable, determine
the number of page faults for FIFO, OPTIMAL, LRU algorithms:
3, 5, 3, 7, 2, 1, 5, 4, 6, 7, 4, 1, 2. [12]
b) Explain with the help of neat diagram Hierarchical page table. [6]

OR
Q4) a) A1 MByte block of memory is allocated using the buddy system. [10]
i) Show the result of the following sequence in the graphical form for
A : Request 35KB, B: Request 140 KB, C : Request 120KB,
D : Request 250KB, Return C, E: Request 70 KB, Return B, Return
D, F : Request, 100KB, Return A, Return E.
ii) Draw the tree representation after Return B.
b) What is Principle of Locality? Explain working set model. [8]

[5870] - 1141 1
P.T.O.
Q5) a) Assume a disk with 200 tracks and the disk request queue has random
Requests in it as follows: 55, 58, 39, 18, 90, 160, 150, 38, 184. Find the
no of tracks traversed and average seek length if [12]
i) FCFS
ii) SSTF
iii) SCAN
iv) C-Look is used and initially head is at track no 100. Assume head is
moving towards outer track for SCAN and C-Look.
b) State and explain diff approaches of I/O buffering. [6]

OR

Q6) a) Describe 3 methods of record blocking with the help of neat diagrams.
[9]
b) Explain different file organization techniques. [9]

Q7) a) Explain working of “General Loading Scheme” with advantages and

disadvantages. [6]
b) Draw and explain flowchart of Pass-2 of two pass assembler. [6]
c) Define following system software components with suitable diagram.[5]
i) Compiler
ii) Loader
iii) Editor
iv) Linker
v) Debugger
OR

Q8) a) Explain Phase structure of Compiler with neat diagram. [6]

b) What is the need of symbol table (ST) and literal table (LT) in two pass
assembler? Explain fields of ST and LT with suitable example. [6]
c) What are types of loaders? Discuss four different functions of loaders.
[5]



[5870] - 1141 2
Total No. of Questions : 8] SEAT No. :

8
23
PA-1500 [Total No. of Pages : 3

ic-
[5926]-120

tat
T.E. (Information Technology)

8s
OPERATING SYSTEMS

3:0
(2019 Pattern) (Semester-I) (314442)

02 91
3:4
0
Time : 2½ Hours] [Max. Marks : 70

31
4/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3. or Q.4, Q.5 or Q.6, and Q.7 or Q.8.
0
1/2
2) Figures to the right side indicate full marks.
.23 GP
E
81

8
C

23
Q1) a) What is semaphore and mutex? Explain with the help of pseudocode,

ic-
how semaphore is used to solve producer consumer problem? [9]
16

tat
8.2

b) What are the four necessary conditions for deadlock? How is a deadlock

8s
detected in a system with resources having single instances? Explain with
.24

3:0
91
an example. [9]
49

3:4
30

OR
31
01
02

Q2) a) Define mutual exclusion, race condition, semaphore. Deadlock. [6]

1/2
GP

b) What is Bankers safe sequence algorithm? Apply it for finding safe sequence
4/0

of execution of 5 processes in a system having Snapshot at time T0: [12]

CE
81

8
23
Allocation Max Available
.23

ABC ABC ABC ic-

16

tat
8.2

8s

P0 010 753 332

.24

3:0

P1 200 322
91
49

3:4

P2 302 902
30
31

P3 211 222
01
02
1/2

P4 002 433
GP
4/0

Also determine whether following requests can be granted or not:

CE
81

i) Request for process P2: - 3 0 0 and

.23

ii) Request for process P3: - 0 0 1

16
8.2
.24

P.T.O.
49

[5926]-120 1
Q3) a) Given memory partitions of 150k, 650k, 280k, 390k and 540k (in order)

8
23
how would each of the First fit, Best fir, and Worst fit algorithms place

ic-
processes of 212k, 457k, 112k, 510k and 326k (in order) [9]

tat
b) With the help of neat diagrams, Write a short note on Buddy system. [8]

8s
3:0
OR

02 91
3:4
Q4) a) Explain Belady’s anomaly with suitable example. [6]

0
31
b) 4/0 13
Consider the following segment table: [6]
0
1/2
Segment Base Length
.23 GP

0 1790 350
E
81

8
1 2722 1050
C

23
ic-
2 520 925
16

tat
8.2

3 5200 450

8s
.24

3:0
4 4200 655
91
49

3:4
What are the physical addresses for the following logical addresses?
30
31

i) 0,330
01
02

ii) 2,525
1/2
GP
4/0

iii) 4,700
CE
81

8
iv) 3,400

23
.23

ic-
v) 1,1110
16

tat
c) What are the distinctions among logical, relative and physical addresses?[5]
8.2

8s
.24

3:0
91
49

3:4

Q5) a) A disk drive has 200 tracks, numbered 0-199. The drive is currently serving
30
31

the request at track no 53. The queue of pending requests in FIFO order
01
02

is 98, 183, 37, 122, 14, 124, 65, 67. Starting from the current head
1/2

position what is the total distance that disk arm moves to satisfy all the
GP
4/0

pending requests for the following disk scheduling algorithms. Assume

CE

that the head is moving in the increasing order of track number for SCAN
81

and C-LOOK. [12]

.23
16
8.2
.24
49

[5926]-120 2
 i) FCFS

8
23
ii) SCAN

ic-
tat
iii) C-LOOK

8s
iv) SSTF

3:0
02 91
b) Explain with diagrams different I/O buffering techniques. [6]

3:4
0
31
OR
4/0 13
Q6) a) List and explain different file access methods. [9]
0
1/2
.23 GP

b) Describe different methods of record blocking with the help of a neat diagram.[9]
E
81

8
C

23
Q7) a) What is system software? Explain any four system software in brief? [6]

ic-
16

tat
b) Explain imperative statement, declarative statement, and assembly directive
8.2

8s
of assembly language programming? [6]
.24

3:0
c) Discuss with example what is forward reference problem. [5]
91
49

3:4
30

OR
31
01

Q8) a) Explain ORIGIN, EQU and LTROG with an example. [6]

02
1/2
GP

b) Explain the data structures required for two PASS Assembler in detail.[6]
4/0

c) Differentiate between literal and immediate operand. [5]

CE
81

8
23
.23

ic-
16

tat
8.2

8s


.24

3:0
91
49

3:4
30
31
01
02
1/2
GP
4/0
CE
81
.23
16
8.2
.24
49

[5926]-120 3
Total No. of Questions : 8] SEAT No. :

8
23
P483 [Total No. of Pages : 2

ic-
[6003]-702

tat
T.E. (Information Technology)

8s
OPERATING SYSTEMS

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

02 91
0:2
0
Time : 2½ Hours] [Max. Marks : 70

31
8/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
6/2
2) Neat diagrams must be drawn wherever necessary.
.23 GP

3) Figures to the right side indicate full marks.

4) Assume suitable data, if neccessary.
E
80

8
C

23
Q1) a) What conditions are generally associated with readers-writers problem?

ic-
16

Write its pseudo code. [9]

tat
8.2

8s
b) Describe resource allocation graph in detail. [9]
.24

3:5
91
OR
49

0:2
30
31

Q2) a) Enlist different IPC techniques. Differentiate between named pipe and
01
02

unnamed pipe with suitable example. [9]

6/2
GP

b) What is Critical Section Problem? Give semaphore solution for producer-

8/0

consumer problem. [9]

CE
80

8
23
.23

Q3) a) Consider six memory partitions of size 100 KB, 300 KB, 50 KB, ic-
16

tat
8.2

200 KB,150 KB and 200 KB. These partitions need to be allocated to

8s

processes of sizes 200 KB, 100 KB, 50 KB in that order. Perform the
.24

3:5
91

allocation of processes using dynamic partitioning algorithms given be-

49

0:2
30

low and comment on internal and external fragmentation- [12]

31
01

i) First Fit Algorithm

02
6/2
GP

ii) Best Fit Algorithm

8/0

iii) Worst Fit Algorithm

CE
80

b) Explain Buddy system memory allocation with suitable example. [5]

.23
16

OR
8.2
.24

P.T.O.
49

[6003]-702 1
Q4) a) Find the number of page faults for the reference string

8
23
6,5,1,2,5,3,5,4,2,3,6,3,2,1,2 using FIFO, LRU and optimal page

ic-
replacement strategies. Consider frame size as 3. [12]

tat
8s
b) Explain Belady’s anomaly with suitable example. [5]

3:5
02 91
0:2
Q5) a) Assume a disk with 200 tracks and the disk request queue has random

0
31
8/0 13
requests in it as follows: 55,58,39,18,90,160,150,38,184. Find the no of
0
tracks traversed and average seek length if
6/2
.23 GP

1) SSTF
E
80

8
2) SCAN
C

23
ic-
3) C-SCAN
16

tat
8.2

8s
Is used and initially head is at track no 100. [12]
.24

3:5
91
b) What are typical operations that may be performed on a directory? [6]
49

0:2
30

OR
31
01
02

Q6) a) What is I/O buffering? Why I/O buffering is needed? State and explain
6/2
GP

different approaches of I/O buffering. [9]

8/0
CE

b) Explain with example any three disk scheduling criteria. [9]

80

8
23
.23

ic-
16

tat
Q7) a) List down the phases of a compiler. Explain with suitable example. [9]
8.2

8s
.24

b) Explain macro call and macro expansion with suitable example. [8]
3:5
91
49

0:2

OR
30
31

Q8) a) Explain with example imperative statement, declarative statement, and

01
02

assembly directive of assembly language programming? [9]

6/2
GP
8/0

b) What is system software explain any four system software in brief? [8]
CE
80
.23
16


8.2
.24
49

[6003]-702 2
Total No. of Questions : 8] SEAT No. :

8
23
P-7618 [Total No. of Pages : 2

ic-
tat
[6180]-138

9s
T.E. (Information Technology)

6:3
02 91
9:4
OPERATING SYSTEMS

0
30
(2019 Pattern) (Semester-I) (314442)
1/1 13
Time : 2½ Hours] [Max. Marks : 70
0
2/2
.23 GP

Instructions to the candidates :

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
E
80

2) Neat diagrams must be drawn wherever necessary.

8
C

23
3) Figures to the right side indicate full marks.

ic-
4) Assume Suitable data if necessary.
16

tat
8.2

9s
Q1) a) Describe in brief the different IPC mechanisms. [9]
.24

6:3
91
b) What is deadlock? Explain the necessary and sufficient conditions for
49

9:4
the occurrence of a deadlock. [9]
30
30

OR
01
02

Q2) a) Explain the following with example [9]

2/2
GP
1/1

i) Mutual Exclusion ii) Synchronization

CE
80

8
iii) Race condition.

23
.23

ic-
b) What is Critical Section Problem? Explain readers-writers problem. [9]
16

tat
8.2

9s

Q3) a) What is page Fault? For the given reference string with 3-page frame
.24

6:3
91

available, determine the number of page faults for FIFO and LRU
49

9:4

algorithms: [9]
30
30

3, 5, 3, 7, 2, 1, 5, 4, 6, 7, 4, 1, 2.
01
02
2/2

b) Explain Demand paging with the help of neat diagram. [8]

GP
1/1

OR
CE
80

Q4) a) Explain Buddy System with the help of neat diagram and example. [9]
.23

b) What is segmentation? How address Translation is performed in

16

segmentation system? [8]

8.2

P.T.O.
.24
49
Q5) a) Describe three methods of record blocking with the help of neat diagrams.

8
23
[9]

ic-
b) Explain the different functions of a file management system. [9]

tat
OR

9s
6:3
Q6) a) Assume a disk with 200 tracks and the disk request queue has random

02 91
9:4
Requests in it as follows: 98,183,37,122,14,124,65,67. [12]

0
30
Find the no of tracks traversed and average seek length if [6]
1/1 13
i) FCFS
0
2/2
.23 GP

ii) SSTF
E

iii) SCAN is used and initially head is at track no 53.

80

8
C

23
b) What is spooling? Explain with suitable diagrams. [6]

ic-
16

tat
8.2

9s
Q7) a) Explain the data structures required for two PASS Assembler in detail.[6]
.24

6:3
91
b) What is Macro? Explain macro call and macro expansion with suitable
49

9:4
example. [6]
30
30

c) Discuss with example what is forward reference problem. [5]

01
02

OR
2/2
GP
1/1

Q8) a) What is Loader? What are the basic functions of loaders? [10]
CE
80

8
b) What is system software? Explain any four system software in brief ? [7]

23
.23

ic-
16

tat

8.2

9s
.24

6:3
91
49

9:4
30
30
01
02
2/2
GP
1/1
CE
80
.23
16
8.2
.24

[6180]-138 2
49
Total No. of Questions : 8] SEAT No. :

8
23
PB3859 [Total No. of Pages : 2

ic-
[6262]-122

tat
T.E. (Information Technology)

2s
OPERATING SYSTEMS

2:4
(2019 Pattern) (Semester-I) (314442)

02 91
9:4
Time : 2½ Hours] [Max. Marks : 70

0
40
8/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
5/2
.23 GP

3) Figures to the right indicate full marks.

4) Assume Suitable data if necessary.
E
81

8
C

23
Q1) a) Explain the following with example [9]

ic-
16

tat
i) Mutual Exclusion
8.2

2s
ii) Synchronization
.24

2:4
91
49

iii) Race condition

9:4
30
40

b) What is Critical Section problem? Explain readers- writers problem.[9]

01
02

OR
5/2
GP

Q2) a) Enlist different IPC techniques. Differentiate between named pipe and
8/0

unnamed pipe with suitable example. [9]

CE
81

8
23
b) What is Critical Section problem? Give semaphore solution for producer-
.23

consumer problem. [9]

ic-
16

tat
8.2

2s
.24

2:4

Q3) a) What is page Fault? For the given reference string with 3- page frame
91
49

9:4

available, determine the number of page faults for FIFO and LRU
30

algorithms: 3,5,7,2,1,5,4,6,7,4,1,2. [9]

40
01
02

b) Explain Demand paging with the help of neat diagram. [8]

5/2
GP

OR
8/0

Q4) a) Explain Buddy System with the help of neat diagram and example. [9]
CE
81

b) What is segmentation? How address Translation is performed in

.23

segmentation system? [8]

16
8.2
.24

P.T.O.
49
Q5) a) Assume a disk with 200 tracks and the disk request queue has random

8
23
requests in it as follows: 55,58,39,18,90,160,150,38,184. [12]

ic-
Find the no of tracks traversed and average seek length if

tat
i) SSTF

2s
2:4
ii) SCAN

02 91
9:4
iii) C-SCAN is used and initially head is at track no 100.

0
40
b) 8/0 13
What are typical operations that may be performed on a directory? [6]
OR
0
5/2
.23 GP

Q6) a) What is I/O buffering? Why I/O buffering is needed? State and explain
different approaches of I/O buffering. [9]
E
81

8
b) Explain with example any three disk scheduling criteria. [9]
C

23
ic-
16

tat
Q7) a) List down the phases of a compiler. Explain with suitable example. [9]
8.2

2s
b) Explain macro call and macro expansion with suitable example. [8]
.24

2:4
OR
91
49

9:4
Q8) a) What is Loader? What are the basic functions of loaders? [10]
30
40

b) What is system software? Explain any four system software in brief?[7]

01
02
5/2
GP
8/0


CE
81

8
23
.23

ic-
16

tat
8.2

2s
.24

2:4
91
49

9:4
30
40
01
02
5/2
GP
8/0
CE
81
.23
16
8.2
.24
49

[6262]-122 2