OS Assignment from Dr.

Kalpana Saha (Roy)

Submit positively within 7th Nov, 2019 with doc or docx file, not pdf file

R1. Consider the following set of processes with corresponding bursts times given in
milliseconds

Process Arrival time(units) CPU Burst time(units)

P1 0 6
P2 3 10
P3 5 8
P4 7 5
P5 10 6
Draw the Gnatt chart considering Round Robin scheduling policy with time quantum=4 and 2
units. Calculate individual turnaround time and average waiting time

R2 Describe the solution of bounded buffer problem with Monitor

R3 What is context switching/ why is it considered to be overhead? What are the difference
between process and thread? Differentiate process switching and context switching. What is the
difference between content switching and mode switching?

R4 Describe different free space management techniques

R5 Describe thrashing elaborately. How does the system detect thrashing?

R6 What are the two major differences between segmentation and paging? With suitable
illustrative diagram explain how logical to physical address translation takes place in a system
that employs segmentation with paging.

R7 Explain the demand paging in memory management technique

R8 Merits and demerits of kernel level and user level thread. Difference between process and
thread

R9 Linked file allocation technique

R10 What is and Merits and demerits of virtual memory

R11. Describe segmentation with suitable example and explain Demand paging

R12 Virus vs worm. Explain about security of OS

R13 Explain Working set theory

R14.What are the disadvantages of segmentation memory management technique? How can
these disadvantages be avoided if segmentation with paging is used? Explain how paging is
implemented in hardware?

R15. Explain Producer and consumer semaphore and Reader writer semaphore

R16.Describe File access method

R18. In case of contiguous memory allocation how can we solve dynamic storage allocation
problem? Compare between external and external fragmentation? What is Compaction?

R19 Explain swapping method elaborately. What are the operation of scheduler and dispatcher?
What is PCB? Mention its contents

R20 Explain the operation of multilevel scheduling. What advantage is there in having different
quantum sizes on different levels of a multilevel queuing system

R21 Given memory partition of 100k,300k,200k,300k600k(in order).How each of the First Fit,
Best fit worst fit algorithm place process of 212k,417k,112k,426k(in order). Which algorithm
make most efficient use of memory

R23.Explain producer –consumer problem. Explain Dining Philosopher problem

R24. Describe process control block with proper explanation. What is the process of system
calls? Mention one characteristic each of time sharing system and batch processing system

R25. Describe with differences multiprogramming system, time sharing system and batch
processing system

R26 Describe with example FCFS, Priority, Preemptive scheduling with waiting and turn around
time

R27 Describe with example SJF ,SRTF, RR based scheduling with waiting and turn around time

R28 What is direct Memory Access(DMA)? How is it performed? What are its benefits

R29. Explain different file accessing methods with advantages and disadvantages

R30 What is the cause of thrashing? How does the system detect thrashing? Once it detects
thrashing, what can the system do to eliminate this problem? Given memory partitions of
100KB, 500KB 300KB and 600KB (in order)

R31 “All unsafe state state may not lead to dead lock” Why or why not?

R32. Given the following queue -- 95, 180, 34, 119, 11, 123, 62, 64 with the Read-write head
 initially at the track 50 and the tail track being at 199.Calculate with total head movement
of all disk scheduling algorithms with graphical representation

R34 Discuss Necessary condition for deadlock and recovery technique

R35.

Proces Current Allocation Maximum Available

s Allocation
A B C D A B C D A B C D
P0 1 0 0 2 2 3 5 3 1 2 2 3
P1 0 0 2 0 2 1 3 5
P2 1 0 3 0 1 2 3 2
P3 1 2 3 4 2 3 3 6
P4 1 0 0 3 2 4 5 6
P5 0 1 3 2 3 5 7 8

Answer the following questions using Banker’s Algorithm

(a) What is Need Matrix?
(b) Is the system in safe state? If yes what is safe sequence?
(c) If a request can be process P1 arrives for (5,2,7,9) can the request be granted
immediately

R37. Explain Belady’s anamoly. Explain what is Contiguous Allocation of the file space on
disk. What are the advantage and disadvantage of contiguous allocation

R39. Consider the following page reference string

0,9,0,1,8,1,8,7,8,7,1,2,8,2,7

How many page faults would occur for the following replacement algorithms assuming 3 frames
are available. Also assume that initially none of pages in main memory

(i) Optimal replacement

(ii) FIFO replacement
(iii) LRU
c)Is this system currently in a safe state ? justify your answer
If a request from P3 arrives for(0,1,0,0) can that request be safely granted immediately.

R40 What is a message ? what is a message based solution for producer-Consumer problem with
bounded buffer.

R41 What is seek time? What is rotational latency? What are the advantages of scan disk
scheduling technique over circular scan disk scheduling technique. Explain the working of
shortest Seek Time First (SSTF) disk scheduling policy. What are its advantages and
disadvantages?

L1 Suppose a disk drive has 300 cylinders, numbered 0 to 299. The current position of the desk
arm is 90. The queue of pending request in FIFO order 36,79,15,120,199,270,89,170. Calculate
the average movements for the following algorithms FCFS and SSTF

L2 What is segmentation? How can segmentation be combined with paging? What advantages
would result through this combination? With suitable illustrative diagram explain how logical to
physical address translation takes place in a system that employs segmentation with paging. How
can the address translation process be made faster by using an associative table

L3.Differentiate between starvation and deadlock. What is “response time”? With the help of a
state transition diagram, explain various state ofa process. What is critical section? How we can
avoid the critical section -explain

L4 Suppose a disk drive has 300 cylinders, numbered 0 to 299. The current position of the desk
arm is 90. The queue of pending request in FIFO order 36,79,15,120,199,270,89,170. Calculate
the average movements for the following algorithms LOOK and CSCAN,CLOOK

L5 Explain the demand paging in memory management technique? Why are the page sizes
always power of 2

L7.Write down the Reader-writer algorithm using semaphore

L8 What is the deference between logical and physical address? How does perform address
binding? What is advantage time address binding over load time address binding? In case of
contiguous memory allocation how can we solve dynamic storage allocation problem? Compare
between external and external fragmentation?

2016 R22 What is mutex? Explain elaborately. What is semaphore? How can semaphore be
used to enforce mutual exclusion? Explain producer –consumer problem. Explain Dining
Philosopher problem

2016 R4 Describe the differences between short term, medium term am long term scheduling.
What is semaphore ? How can semaphore be used to enforce Mutex