532(S)
March 2021
OPERATING SYSTEMS
Time Allowed: 3 Hours Full Marks: 70
Answer to Question No.1 is compulsory and Answer any five questions from the rest.
1. A. Choose the correct answer from the given alternatives: 1x10
i) Which of the following components of program state are shared across threads in a
multithreaded process? – (a) Register values (b) Heap memory (c) Global variables
(d) Stack memory.
ii) Semaphore is a – (a) function (b) variable (c) macro (d) none of these.
iii) Seek time related to – (a) CPU scheduling (b) Disk scheduling (c) Page fault (d) Memory
management.
iv) Which is a non-preemptive scheduling algorithm? – (a) Round Robin (b) FCFS (c) Priority
based scheduling (d) None of these.
v) The optimal scheduling algorithm is – (a) RR (b) FCFS (c) SJF (d) None of these.
vi) The mechanism that brings a page into memory only when it is needed is called –
(a) Segmentation (b) Fragmentation (c) Demand Paging (d) Page Replacement.
vii) If the initial value of a counting semaphore is 5, number of processes that are allowed in
the critical section is – (a) 1 (b) 4 (c) 5 (d) 6.
viii) Which is not a layer of operating system? – (a) Kernel (b) Shell (c) Application program
(d) Critical section.
ix) In_________ mode, a machine executes operating system instructions. (a) user (b) system
(c) safe (d) normal.
x) Which is not a valid process state? – (a) new (b) ready (c) running (d) loaded.
B. Answer the following questions: 5x2
i) Define dispatch latency.
ii) Define Turnaround Time.
iii) What is race condition?
iv) What is medium term scheduler?
v) What is context switch?
2. a) Define Kernel. Distinguish between Microkernel and Microkernel with proper diagram.
b) Describe the concept of Fragmentation (Internal & external) & Compaction. (2+3)+5
3. a) Give difference between the followings:
i) Preemptive scheduling and Non preemptive scheduling
ii) Long term scheduler and Short term scheduler
b) What is interrupt? List three types of interrupt. 4+3+3
1
4. a) What do you mean by process scheduling? Explain Round Robin scheduling with an Example.
b) Describe Segmentation briefly. Define paging with TLB briefly with suitable diagram. 5+5
5. a) How to analyse a malware and protect it?
b) Discuss the methods for intrusion detection and virus protections. 4+6
6. a) What are the various components of operating – system structure explain the simple and layered
approach of operating system in details.
b) What is a system call? Explain how a user application invoking the open () system call is
handled. 5+(2+3)
7. a) Explain the resource – allocation graph algorithm for deadlock detection with relevant diagram.
b) State and explain the steps involved in safety algorithm.
c) Illustrate Banker’s algorithm with proper example. 2+3+5
8. a) Describe the necessary conditions for deadlock. Define safe state.
b) Describe C-SCAN disk scheduling algorithm with example. 5+5
9. a) Write down the performance criteria of Scheduling [Link] is Context Switch?
b) Describe file attributes, file operations and two level directory structure with suitable
diagram. (4+2)+4
____________________