USN 1 S I 3RCS04

Siddaganga Institute of Technology, Tumakuru – 572 103

(An Autonomous Institution affiliated to VTU, Belagavi, Approved by AICTE, New Delhi)

Third Semester B.E. Computer Science & Engg. Examinations Mar. 2021
Operating Systems
Time: 3 Hours Max. Marks: 100
Note : Answer any five questions choosing one full question from each unit.

Unit - I
01 a) Discuss the role of operating system from USER and SYSTEM viewpoints. 7
BL: 1 CO: 1 PO: 1 PSO: 1

b) What is meant by Kernel mode of operation? Explain how operating system protects itself and
user programs from malicious programs using privileged instructions. 7
BL: 2 CO: 1 PO: 1 PSO: 1

c) What is the purpose of command interpreter? Explain two general ways of implementing
command interpreter. 6
BL: 2 CO: 1 PO: 1 PSO: 1

OR
02 a) Discuss the operating system functions,
i) That are helpful to users
ii) That are meant for ensuring the efficient operation of system. 8
BL: 1 CO: 1 PO: 1 PSO: 1

b) Describe the structure of the following operating systems with a neat diagram.
i) Apple Mac OS X ii) ios 8
BL: 2 CO: 1 PO: 1 PSO: 1

c) What are the major activities of an operating system in connection with File management and
Process management? 4
BL: 2 CO: 1 PO: 1 PSO: 1

Unit – II
03 a) Consider the following set of processes with a length of the CPU burst time given in
milliseconds.
Process Burst Time Arrival Time
P0 7 0
P1 2 3
P2 3 4
P3 1 4
P4 3 5
i) Draw Gantt charts illustrating the execution of these processes using Round Robin
scheduling with a Time quantum of 1ms.
ii) Find the Waiting Time (WT) for each process and calculate the average WT.
iii) Find the Turn Around Time (TAT) for each process and calculate the average TAT. 8
BL: 3 CO: 3 PO: 2 PSO: 1

b) When load balancing is necessary in symmetric multiprocessing? Discuss the two general
approaches used for load balancing in SMP. 6
BL: 1 CO: 3 PO: 2 PSO: 1

c) Describe the different methods used for logical implementations of communication link in
message passing systems. 6
BL: 2 CO: 2 PO: 2 PSO: 1
 -1- Please Turn Over

-2- 3RCS04
OR
04 a) With a neat queuing diagram, explain the movement of processes from one queue to another. 6
BL: 2 CO: 2 PO: 2 PSO: 1

b) “Long term scheduler must select a good mixture of CPU bound and I/O bound processes” –
Justify. 6
BL: 5 CO: 3 PO: 2 PSO: 1

c) State Amdahl’s law and discuss the areas that present challenges in programming for multicore
systems. 8
BL: 2 CO: 1 PO: 1 PSO: 1

Unit – III
05 a) Consider the following snap shot of a system:
Process Allocation Max
A B C D A B C D
P0 3 0 1 4 5 1 1 7
P1 2 2 1 0 3 2 1 1
P2 3 1 2 1 3 3 2 1
P3 0 5 1 0 4 6 1 2
P4 4 2 1 2 6 3 2 5
Using the banker’s algorithm, determine whether or not each of the following state is unsafe. If
the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate
why the state is unsafe.
i) Available = (0, 3, 0, 1)
ii) Available = (1, 0, 0, 2) 8
BL: 4 CO: 4 PO: 1 PSO: 1

b) Explain the Petersons solution to the critical section problem. 8

BL: 2 CO: 5 PO: 2 PSO: 1

c) What is wait for graph? Describe with an example. 4

BL: 2 CO: 4 PO: 1 PSO: 1

OR
06 a) What is meant by Race condition? Along with the necessary C structure, explain the
implementation of bounded buffer problem using semaphores. 8
BL: 3 CO: 5 PO: 2 PSO: 1

b) Explain in detail how deadlocks can be prevented by denying Circular wait and No pre-emption. 8
BL: 2 CO: 4 PO: 1 PSO: 1

c) Differentiate between first readers-writers and second readers-writers problem. 4

BL: 4 CO: 5 PO: 2 PSO: 1

Unit – IV
07 a) With a neat diagram, describe the address protection hardware with base and limit registers. 8
BL: 2 CO: 6 PO: 2 PSO: 1

b) Differentiate between external and internal fragmentation. 4

BL: 2 CO: 6 PO: 2 PSO: 1
 c) Define File. Discuss the attributes of the file. 8
BL: 1 CO: 1 PO: 1 PSO: 1

Contd…

-3- 3RCS04
OR
08 a) Explain any two techniques used for structuring the page table. 8
BL: 2 CO: 6 PO: 2 PSO: 1

b) What is segmentation? With a diagram, explain segmentation hardware. 8

BL: 2 CO: 6 PO: 2 PSO: 1

c) Explain the following file access methods. i) Sequential Access ii) Direct Access 4
BL: 2 CO: 1 PO: 1 PSO: 1

Unit – V
09 a) Consider the following page reference string 0123012301234567. How many page faults would
occur in case of frame size of 3. i) LRU ii) Optimal iii) FIFO 9
BL: 3 CO: 6 PO: 2 PSO: 1

b) What is meant by thrashing? Explain the causes of thrashing. 5

BL: 2 CO: 6 PO: 2 PSO: 1

c) With a diagram explain the slab allocation strategy adopted by Linux for allocating kernel
memory. 6
BL: 2 CO: 1 PO: 1 PSO: 1

OR
10 a) Describe the meaning of four ordered pairs used in Enhanced second chance page replacement
algorithm. 6
BL: 2 CO: 6 PO: 2 PSO: 1

b) What are the process context parts in Linux operating system? Explain. 6
BL: 2 CO: 1 PO: 1 PSO: 1

c) What is meant by page fault? Describe the sequence of operations to be performed to service the
page fault. 8
BL: 2 CO: 6 PO: 2 PSO: 1

________