USN 1 S I S4IS01
Siddaganga Institute of Technology, Tumakuru-572 103
(An Autonomous Institution affiliated to VTU, Belagavi, Approved by AICTE, New Delhi)
Supplementary Semester B.E. Information Science and Engineering Examinations Sept. 2024
Operating System
Time: 3 Hours Max. Marks: 100
Note : 1. Revealing of Identity in any form in the answer book will be treated as malpractice.
2. Answer any five questions choosing one full question from each unit.
Unit - I M BL CO PO PSO
01 a) Compare microkernel approach of system design with layered approach. 6 2 1 1 1
b) Illustrate the services provided by an operating system that are useful to the user. 6 1 1 1 1
c)List the major activities of an operating system in connection with
i) Protection and security
ii) Process management
iii) Storage management 8 2 1 1 1
OR
02 a) What is the purpose of command interpreter? Describe any two ways of
implementing the command interpreter. 6 2 1 1 1
b) Illustrate the working of Solaris operating system with a diagram. 6 1 1 1 1
c) Exemplify having i) Privileged instructions ii) Multi-mode operation iii) Policy
and mechanism iv) System call interface in operating system 8 2 1 1 1
Unit - II
03 a) Is there any relation between Process Control Block (PCB) and context switching?
Justify with diagrams and explanation. 6 3 2 2 1
b) Compare shared memory inter process communication with message parsing
system. Is the shared memory IPC can be used in intercomputer communication?
Justify. 6 2 2 1 1
c) Suppose the following Jobs arrive for processing at the time indicated.
Job Arrival time (ms) Burst time (ms)
1 0.0 6
2 0.3 3
3 0.6 8
4 0.8 2
5 1.0 4
1) Write a Gantt chart to illustrate the execution of these jobs using FCFS and
preemptive SJF scheduling algorithms.
2) What is the turn around time and waiting time of each job for the above
algorithms? Find out the average turn around time and waiting time. 8 3 2 2 1
OR
04 a) Why are the scheduling criteria required? Describe them in detail. 6 2 2 1 1
b) Describe how a child process obtain resources, way of execution and address
space sharing. What is cascading termination? Why is it required? 8 2 2 1 1
c) For the example given below apply non-preemptive and preemptive SJF to calculate
average waiting time.
Process Arrival time (ms) Burst time (ms)
P1 0 6
P2 2 5
P3 3 1
P4 5 4 6 3 2 2 1
-1- Please Turn Over
-2- S4IS01
Unit - III
05 a) Illustrate the benefits of multi threads with an example. Is the user level threads
fast to create and manage? Justify. 6 3 3 2 1
b) What is the main disadvantage of the semaphore? How is it alleviated by using
wait() and signal() semaphores operations. 6 1 3 1 1
c)What is race condition and remedy for it? Illustrate this with bounded buffer
producer-consumer problem with algorithm and example. 8 2 3 2 1
OR
06 a) Illustrate the differences between concurrency and parallelism with an example.
What is data parallelism and why is it required? 6 2 3 2 1
b) Describe the requirements that a solution to critical section problem must satisfy. 6 1 3 1 1
c) Are the test-and-set and swap instructions satisfy mutual exclusion and bounded
waiting? Justify with an example. 8 1 3 1 1
Unit - IV
07 a) Illustrate with an example how resource allocation graph is used to describe a
deadlock. 6 2 4 1 1
b) Consider the following snapshot of a system.
Process Arrival time (ms) Max
A B C A B C
P0 0 2 2 0 0 4
P1 1 0 0 2 0 1
P2 1 3 5 1 3 7
P3 6 0 2 8 4 2
P4 1 4 3 1 5 7
The available resources are A=1, B=0 and C=2.
i) What is the content of matrix NEED?
ii) Is the system in safe state? If so, give the safe sequence. 8 3 4 3 1
c)Illustrate how memory space is protected by, address generated by CPU in user
mode is compared with registers. With a block diagram and an example. 6 2 4 1 1
OR
08 a) Describe dynamic relocation using a relocation register in the context of logical
versus physical address space with an example. Mention the functions of memory
management unit. 6 1 4 1 1
b) Consider the following snapshot of a system.
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0 × × × ×
P2 0 6 3 2 0 6 5 2 × × × ×
P3 0 0 1 4 0 6 5 6 × × × ×
i) Apply relevant algorithm and determine if the system is safe or not.
ii) If a request from process P1 arrives for (0,4,2,0) can the request be
granted immediately? 8 3 4 3 1
c) Describe deadlock recovery methods in detail. 6 1 4 1 1
Contd…
-3- S4IS01
Unit - V
09 a) Illustrate the working of segmentation hardware with its block diagram. 6 1 5 1 1
b) Assume that TLBS page table is present in main memory and its access time is 80
nanoseconds. What would be the effective access time if 75% of all memory
references find their entries in TLB? Assume that TLB access time is 15 nano sec. 4 3 5 3 1
c)Consider the following page reference stream: 0, 1, 2, 3, 1, 0, 0, 4, 2, 3, 1, 4.
Calculate the number of page faults when number of frame is equal to 3 and 4
using LRU, FIFO and optimal replacement algorithms. Do you notice Belady’s
Anomaly? 10 3 5 3 2
OR
10 a) Differentiate between internal and external fragmentation. 4 1 5 1 1
b) Illustrate how TLB improves the performance of a demand paging with the help of
supporting hardware diagram. 8 1 5 1 1
c) How segmentation of memory management scheme supports programmers view
of memory? Describe the scheme with necessary diagram. List the advantages of
demand paging. 8 1 5 1 1
________