Operating Systems-18CS43 Qu estion Bank

OPERATING SYSTEMS-15CS64

MODULE 1
1. Define an operating system. Discuss its role with user and system viewpoints
(07Marks,Dec09,Dec08,June09)
2. Give the features of symmetric and asymmetric multiprocessing systems.
(04Marks,June09,Dec09)
3. Briefly explain the common classes of services provided by the various operating systems for helping
the user and for ensuring the efficient operation of the systems for helping the user and for ensuring
the efficient operation of the system. (10Marks,Dec09)
4. List out the different services that an operating system provides. Explain.
(06Marks,Dec08, Jan15,june 2018)
5. Explain the concept of virtual machines. Bring out its advantages. (05Marks,Dec08)
6. Differentiate between a trap and an interrupt. (02Marks,Dec08)
7. Discuss the operating system function
i) That helpful to user. ii) that are meant for ensuring the efficient operation of system.
(09Marks,June09)
8. Explain the following terms:
i)Bootstrap program ii) Caching iii) Trap iv) Job pool v) Symmetric multiprocessing.
(05Marks,May10)
9. Explain two sets of operating system services that are helpful to user as well as efficient
operation of system. (10Marks,May10)
10. Write and explain the sequence of system calls for copying a file to another (new) file.
(10Marks,May10)
11. What is an operating system? Explain the goals of an operating system. (06Marks,Dec10)
12. Define the essential properties of the following operating systems: i) Time sharing operating system
ii) Batch operating system iii) Real time operating system iv) Distributed operating system.
(10Marks,May10,Jan14)
13. Mention the different system structures employed in a modern operating system. Explain the virtual
machine approach. (06Marks,Dec10)
14. Define an operating system. Explain two view points of OS role. (05Marks,Dec10)
15. What are OS operations? Explain. (06Marks,Dec11)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 24

Operating Systems-18CS43 Qu estion Bank

16. Define a virtual machine (VM). With a neat diagram, explain the working of VM. What are
the benefits of a VM? (09Marks,Dec10)
17. Distinguish among the following terminologies associated with the operating system and explain each
of them in detail Multitasking systems, Multiprogramming systems, Multi processors system
(12Marks, June11, Jan15)
18. With the help of an example explain the concept of virtual machines.
(08Marks, June11)
19. What is an operating system? Bring out the requirements of
i) Real Time Operating System
ii) Distributed Operating System (10Marks,June12)
20. What are system calls? Explain different categories of system calls (10Marks,June12, Jan13)
(4 Marks, June 2017)
21. Define operating systems. discuss its role with respect to user and system view points
(06Marks,Dec12)
22. Briefly explain clustered and real time system (04Marks,Dec12)
23. Define virtual machines. with a neat sketch explain its working and what are the benefits of virtual
machines (4 Marks, June 2017)(10Marks,Dec12, Jan14)
24. List the operating system responsibilities in connection , with a process management and memory
management (08Marks,Dec11)
25. Explain graceful degradation and fault tolerance in multiprocessor system (06Marks,Dec11)
26. What is virtual machine? Explain just-in-time (JIT) compiler ,used in java (06Marks,Dec11)
27. What is a distributed OS? What are the advantages of distributed OS? (06Marks,Jan13)
28. Explain the advantage of layered approach with a neat diagram. (06Marks,Jan14)
29. With a diagram, explain the different states of a process. (06Marks,Dec09)
30. Differentiate between long-term and short-term schedulers. (04Marks,Dec09)
31. What is a process? Draw and explain the process state diagram.
(05Marks,Dec08, 05 marks june 2018)
32. Discuss the operations of process creation and process termination in UNIX. (07Marks,Dec08)
33. Describe the implementation of IPC using shared memory and message passing (08Marks,Dec08)
34. What are schedulers? Explain various schedulers, with diagrams. (07Marks,May10)

35. What is inter process communication? Explain. (06 M, June 2017)

36. Define IPC (Inter process communication). What are the different methods used for logical
implementation of a message passing system? Explain any one. (06Marks,Dec10, 06 marks june 2018)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 25

Operating Systems-18CS43 Qu estion Bank

37. Discuss three common ways of establishing relationship between the user thread and kernel
thread. (06Marks,Dec10)

38. What is operating system? Explain multiprogramming and time sharing systems (06 M, June 2017)
39. Explain dual mode operation in OS with a neat block diagram (06 M, June 2017)
40. Why it is important for the scheduler to distinguish I/O bound programs from CPU bound programs?
(02 Marks, June 2017)
41. Distinguish between the following pairs of terms:
i) Symmetric and asymmetric multiprocessor systems
ii) CPU burst and I/O burst jobs
iii) User‟s view and systems view of OS
iv) Batch systems and time sharing systems
v) User mode and kernel mode operations . (10 Marks, Dec 2017)
42. List the three main advantages of multiprocessor systems. Also bring out the difference between
graceful degradation and fault tolerance in this context. . (05 Marks, June 2017)
43. Define operating system, with a neat diagram, explain dual mode operation od operating system
(06 marks, June 2018)
44. Explain layered structure of operating system with neat diagram (06 marks, June 2018)
45. Define the following
a. Virtual machine
b. CPU Scheduler
c. Context switching
d. System call (04 marks, June 2018)

MODULE-2

1. Suppose the following jobs arrive for processing at the times indicated. Each job will run
the listed amount of time.

Job 1 2 3
Arrival time 0.0 0.4 1.0
Burst time 8 4 1

i) Give a Gantt chart illustrating the execution of these jobs, using the non pre-emptive FCFS
and SJF scheduling algorithms.
ii) What is turnaround time and waiting time of each job for the above algorithms?

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 26

Operating Systems-18CS43 Qu estion Bank

iii) Compute average turnaround time if CPU is left idle for the first 1 unit and then SJF is used. (Job1
and Job2 will wait during this time) (10Marks,Dec09,)
2. Discuss various multithreading models with diagram. (06Marks,June09)
3. Consider the following set of processes.
Process Burst time Arrival Time Priority
P1 10 0 2
P2 5 2 1
P3 2 3 0
P4 20 5 3
Draw Grant charts and calculate average waiting time average turnaround time using following CPU
scheduling algorithms.
i) Preemptive shortest Job First.
ii) Non preemptive priority (= HIGH Priority)
(08 Marks,June09, 06 marks, June 2018)
4. What PCB/ enumerate and explain various fields in PCB. (04Marks,May10)
5. What is multithreading? Explain the benefits of multithreaded programming.
(05Marks, May10,(06 marks, June 2018)
6. Consider the following set of processes:
Process Arrival time Burst time
P1 0 1
P2 1 9
P3 2 1
P4 3 9
i) Draw Gantt charts showing the execution of these processes using FCFS, preemptive SJF,
non-preemptive SJF and RR (Quantum – 1) scheduling schemes
ii) Compute the turnaround time and waiting time for each process for each of schemes
above.
iii) Compute the average turnaround time and average waiting time in each scheme and above.
(11Marks,May10)
7. Explain the process state, with the diagram. What is the need for a context switch?
(07Marks,May10, Jan14)
8. Consider the following set of processes, with length of CPU burst in milliseconds.

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 27

Operating Systems-18CS43 Qu estion Bank

Process P1 P2 P3 P4 P5
Arrival time 00 02 03 06 30
Burst time 10 12 14 16 05

i) Draw a Gantt chart that illustrates the execution of these processes using the preemptive
shortest job first (SJF) algorithm. Hence find the average waiting time.

ii) Draw a Gantt chart that illustrate the execution of these processes using preemptive Priority
scheduling algorithm. Given priority of each process P1 + 4, P2 + 3,P3 +5, P4 = 1 and P5 =1.
Also find the average waiting time. (08Marks,Dec10)

9. Consider four jobs with (arrival time, burst time) as (0,5) (0.2,2) (0.6,8) (1.2,4) find the average
turnaround time and waiting time for the jobs using FCFS, SJF, and RP(q=1) scheduling algorithm
(10Marks,June11)
10. What is the difference between user level threads and kernel supported threads.
(05Marks,June12)
11. For the following examples calculate average waiting time and average turnaround time by FCFS,
preemptive SJF, and RR( 1 time unit) CPU scheduling algorithm.
Jobs Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
(08Marks,June12)

12. For the following set of processes. Find the average waiting time and average turnaround time along
with Gant chart illustration for (06Marks,Dec12)
i) Shortest remaining time first ii) preemptive priority scheduling algorithm

Process Burst time Arrival time Priority

P1 6 2.0 5
P2 4 0.0 4
P3 7 1.6 3
P4 2 1.0 1

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 28

Operating Systems-18CS43 Qu estion Bank

P5 1 0.4 2

13. Explain the benefits of multi threading programming (08Marks,Dec11)

14. Explain hard real time system (04Marks,Dec11)
15. Differentiate between a. Process and thread b. Short term and medium term schedules c. Waiting and
Turnaround time. (08Marks,Jan14, Jan15)
16. Discuss various multithreading models, with diagram. (06Marks,Dec09)
17. Explain the three requirements that solution to the critical-section problem, must satisfy.
(04Marks,Dec09(06 marks, June 201)
18. State the dining philosopher‟s problem and give a solution for the same, suing semaphores. Write
the structure of philosopher. (10Marks,Dec09,Jan14,06 marks, june 2018)
19. Consider the following data about processes

Process Arrival Burst Priority

time time
P1 0 7 3
P2 3 2 2
P3 4 3 1
P4 4 1 1
P5 5 3 3
i) Draw charts to illustrate execution using SRTF, preemptive priority and RR (TS = 1
msec).
ii) Compute waiting time in each of the cases.
iii) Which of them provide minimal average waiting time and turnaround time?
Find out the time at which there are maximum numbers of processes in the ready queue in the scenario?
(10Marks,Dec08)
20. Consider a system running 10 I/O bound tasks and one cpu bound task. Assume I/O bound tasks issue
an I/O once for every msecsof CPU computing and that each I/O Operation takes that all processes
are long running tasks. Comment on the CPU utilization for a RR scheduler when TS = 1 msec and
TS = 10msec. (04Marks,Dec08)
21. What are the three requirements to be met by a solution to the critical section Problem? Explain.
(06Marks,June09)
22. Describe the Bounded –buffer problem and give a solution for the same using semaphores. Write the
structure of producer and consumer processes. (08Marks,June09)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 29

Operating Systems-18CS43 Qu estion Bank

23. Describe the following: i) Semaphore ii) Wait () operation iii) Signal () operation.
(06Marks,June09)
24. Define race condition. List the requirements that a solution to critical section problem must satisfy.
(05Marks,May10)
25. What are semaphores? Explain two primitive semaphore operations. What are the advantages of
semaphore? (07Marks,May10)
26. Define the algorithms Test And Set () and swap (). Show that they satisfy mutual exclusion.
(08Marks,May10)
27. Suppose four processes arrive for processing in the order P1, P2 P3, and P4 with burst times and
priorities as given below:

Process P1 P2 P3 P4
Burst time 7 4 3 5
Priority 3 4 2 1
Draw the Gantt charts and
calculate the average waiting time for the following algorithms:

i) First Come First Served ii) Shortest Job First iii) Priority scheduling
(08Marks,Dec10)
28. What is a deadlock? List the necessary conditions for a deadlock to occur. Explain the Banker‟s
algorithm. (12Marks,Dec10,(06 marks, June 2018)
29. What do you mean by binary semaphore and a counting semaphore? Along with the necessary „C‟ –
struct, explain the implementation of wait 0 and signal 0 semaphore operations.
(10Marks,Dec10)
30. Explain the solution the classical dining philosopher‟s problem, using monitor. (06 M, June 17)
31. What is synchronization? Explain synchronization hardware (04Marks,June11)
32. What are semaphores? Explain the solution to procedure- consumer problem using semaphores
(08Marks,June11)
33. What are monitor? Explain it (04Marks,June11,06 marks, June 2018)
34. What is critical section problem? How does a semaphores solve the crtical section problem?
Discuss whether semaphores satisfy the three requirement for a solution to a critical section problem
(08Marks,June12)
35. What are monitors? Explain with an example (08Marks,June12)
36. Define mutual exclusion and critical section problem. write the software solution for 2- process
synchronization (07Marks,Dec12)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 30

Operating Systems-18CS43 Qu estion Bank

37. What is semaphores? Explain how it can be used to solve producer consumer problem .
(07Marks,Dec12)

38. Explain the solution for dining –philosopher problem using monitors(06Marks,Dec12)
39. What is race condition? Explain Reader‟s Writer‟s problem with semaphores (10 Marks, Jan14)
40. Explain test and set instruction and expalin mutual exclusion using test and set instructions
(05Marks,Dec11)

41. Consider the following set of processes, with the length of the CPU burst given in milliseconds.

Process Burst Priority

time
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
i) Draw the Gantt charts for the following scheduling algorithms, FCFS, SJF and RR
(quantum=1)
ii) Find out turn around time and waiting of each process for each of these scheduling algorithm
and also find out average turn around time and average waiting time.
(12 Marks,June17,08 marks, June 2018))
42. Define Semaphore. Explain its usage and implementation (06 Marks,June17)
43. Explain multi process scheduling (04 marks, June 2018)

MODULE-3

1. Define the hardware instructions test and set ( ) and swap ( ). And also give the algorithms for
implementing mutual exclusion with these Instructions. (06Marks,Dec09)
2. Describe the necessary conditions for a deadlock situation to arise, in a system. (04Marks,Dec09)
3. Consider the following snapshot of a system:
Allocation Maximum Available
A B C D A B C D A B C D

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 31

 Operating Systems-18CS43 Qu estion Bank

0 0 1 2 0 0 1 2 1 5 2 0
1 0 0 0 1 7 5 0
2 3 5 4 2 3 5 6
0 6 3 2 0 6 5 2
0 0 1 4 0 6 5 6

Answer the following questions using the Banker‟s algorithm;

i) What is the content of the matrix need?
ii) Is the system in a safe state?
iii) If a request from process P1 arrives for (0, 4, 2, 0) (10Marks,Dec09,Jan14)
4. Define race condition. List the requirements that solution to critical section problem must satisfy.
(04Marks,Dec08)
5. Define the algorithms Test and Set ( ) and Swap (). Show that they satisfy mutual exclusion
(06Marks,Dec08)
6. Consider the following snap shot of resource-allocation at time t1

Allocation request Available

A B C A B C A B C
P00 1 0 0 0 0 0 0 0
P12 0 0 2 0 2
P23 0 3 0 0 0
P32 1 1 1 0 0
P40 0 2 0 0 2
i) Show that the system is not deadlocked by generating one safe sequence.
ii) At instance 12, p2 makes one additional request for instance of type C, Show that the system is
deadlocked if the request is granted.
7. Consider the following snapshot of a system.
Allocation Maximum Available
A B C
P0 0 1 0
P1 2 0 0
P2 3 0 2
P3 2 1 1

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 32

 Operating Systems-18CS43 Qu estion Bank

P4 0 0 2 A B C A B C
7 5 3 3 3 2
3 2 2
9 0 2
2 2 2
4 3 3

Table Q4(a)
Answer following questions using Bankers algorithm.

i) Is the system in a safe state?

ii) If a request from P1 arrives for (1,0,2), can the request be granted immediately?
(09Marks,June09)
8. Discuss the various approaches, used for deadlock recovery. (06Marks,June09, Jan14)
9. Consider the Resource allocation graphs given in fig.Q4(c ) (i)and (ii), Check whether deadlock exists
in the system, if yes, identify the processes involved in deadlock.(05Marks,June09)

Fig.Q4(c) (i) fig. Q4(c) (ii)

10. Explain how resource-allocation graph is used to describe deadlocks. (05Marks,May10)

11. What are the different methods for handling deadlocks? Explain Banker‟s algorithm.
(11Marks,May10)
12. “A safe state in not a deadlock state but a deadlock state is an unsafe state”. Explain
(04Marks,May10)
13. Explain the terms: critical section and mutual exclusion. (05Marks,Dec10)
14. What is a semaphore? Explain the role of a semaphore in solving a critical section problem.
(10Marks,Dec10)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 33

Operating Systems-18CS43 Qu estion Bank

15. What are monitors? Explain its usage and implementation(08 Marks, June17)
16. Define the terms: safe state and safe sequence. Give an algorithm to find whether or not a system is
in a safe state. (10Marks,Dec10)
17. What is dead lock? explain the necessary conditions for its occurrence
(08Marks,June12,June11)
18. Consider the system

Process Allocation Max Available

ABCD ABCD ABCD
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

Answer the following questions using Bankers algorithm

i) What is the content of matrix need?
ii) Is the system in safe state?
iii) If a request from process p arrives for ( 0, 4, 2, 0) can the request be granted immediately?
(10Marks,June11,Dec10)
19. Explain with a example how a resource allocation graph is used to describe deadlocks

(06Marks,June12)
20. System consists of five process (p0,p1,p2,p3,p4) and three resources (R1,R2,R3) resource type R1 has
10 instances , resource type R2 has 5 instances , resource type R3 has 7 instances
the following snap shot of the system has been taken
Allocation Maximum Available
jobs A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 34

Operating Systems-18CS43 Qu estion Bank

Calculate the content for matrix need and find out the safe sequence by using Bankers algorithm

(08Marks,June12)

21. Define the necessary and sufficient conditions for dead lock to occur (04Marks,Dec12)
22. Consider the following snap shot of the system
Process Allocated resources Maximum requirement Total resources
R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8 7 7 10
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
i) What is the content need matrix?
ii) Is the system in safe state?
iii) If the following requests are made , can they be satisfied / granted immediately in the current state :
P1 requests for (1, 1, 0)
P3 requests for ( 0, 1, 0) resource additionality. (10Marks,Dec12)
23. Given the three processes A,B and C , 3 resources X,Y and Z and the following events.
i) A requests X
ii) A requests Y
iii) B requests Y
iv) B requests Z
v) C requests X
vi) C requests Y
vii) C requests Z
Assume the requested resources is always allocated to requesting process if it is available .Draw
the resource allocation graph (RAG) for the sequence (2, 6, 3, 5, 1, 4 and 7) .Also mention if deadlock
occurs. If so, how do you recover from deadlock? (06Marks, Dec12)

24. List any four examples of deadlock that are not related to computer systems.
(08Marks, Dec11)
25. Explain safety algorithm used in Bankers algorithm, with a suitable example.(12Marks, Dec11)
26. What are deadlocks? What are its characteristics? (05 Marks, June 17)

27. Consider the following snapshot of a system:

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 35

Operating Systems-18CS43 Qu estion Bank

Process Allocation Max Available

ABCD ABCD ABCD
Po 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
vi) Find out need matrix
vii) If a request from process P1 arrived for (0,4,2,0) can the request be granted
immediately?
viii) Is the system in a safe state
28. Explain the process of recovery from deadlock. (05 Marks, June 2017)

1. What is paging and swapping? (04Marks,Dec09,Jan14,06 marks, June 2018)

2. With a diagram, discuss the steps involved in handling a page fault. (06Marks,Dec09)
3. Consider the following page reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 . For a memory
with three frames. How many page faults would occur for LRU, FIFO and optimal page replacement
algorithms? Which is the most efficient among them? (10Marks,Dec09)
4. Memory partitions of 100KB, 500KB, 200KB, 300KB, 600KB (in order) are available. How would
first – fit, best – fit and worst – fit algorithms place processes of 212KB, 417KB and 426KB (in
order). Which algorithm makes the most efficient use of memory?
(06Marks,Dec08, Jan14)
5. Differentiate between internal and external fragmentations? How are they overcome?
(04Marks,Dec08)
6. Consider the following page reference stream:1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7,6, 3,2,1, 2, 3, 3. How
May page faults would occur for LRU, FIPO and Optimal replacement algorithms assuming 3 and 5
frames? Which one of the above is most efficient? (10Marks,Dec08)
7. Assume we have a paged memory system with associative registers (TLBs) to hold the most active
page table entiries. If the page table is normally held in memory and memory access time is 1 micro
second, What would be the effective access time if 85% of all memory references find their entires in
the associative registers. Assume that associative registers access time is zero.Give the differences
between: i) internal and external fragmentation ii) paging and segmentation.
(06Marks,June09)
8. Discuss the steps involved in handling page fault, with diagram. (06Marks,June09)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 36

Operating Systems-18CS43 Qu estion Bank

9. Consider the following page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,1,7,0,1. How many page
faults would occur for FIFO page replacement algorithm, assuming three frames?
(04Marks,June09)
10. What do you mean by dynamic storage allocation problem? Explain possible solutions to this
problem. (04Marks,May10)
11. Explain the concept of forward-mapped page table. (04Marks,May10)
12. Consider the following reference string : 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Assuming three
frames, all initially empty, how many page faults would occur for i) LRU ii) FIFO iii) Optimal
page replacement algorithms? Which of the algorithms is most efficient in this case?
(12Marks,May10)
13. What do you mean by a address binding? Explain the necessary steps, the binding of instructions and
data to memory addresses. (08Marks,Dec10)
14. On a system using demand paged memory it takes 0, 12 𝜇s to satisfy a memory request, if the page is
in memory. If the page is ot in memory the request takes 5000 𝜇s. What would the page fault rate
need to be to achieve an effective access time 1000𝜇s? Assume the system is only running a single
process and the CPU is idle during the page swaps.
(08Marks,Dec10)
15. What do you mean by copy-on-write? Where is it used? Explain in brief. (04Marks,Dec10)
16. What is paging? Explain it (07Marks,June11)
17. Explain internal and external fragmentation with a neat diagram (04Marks,June11)
18. Consider the following page reference string:1,2,3,5,2,3,5,7,2,1,2,3,8,6,4,3,2,2,3,6
How many page faults would occur in the case of (08Marks,June11)
i) LRU
ii) FIFO
iii) Optimal algorithm.
Assuming 3 frames note that initially all frames are empty
19. Distinguish between
i) Logical address space and physical address space
ii) Internal and external fragmentation (02 Marks, June 2017)
iii) Paging and segmentation (09Marks,June12)
20. Explain the multistep processing of a user program with a neat block diagram. (05 Marks, June 2017)
21. Explain segmentation with an example. (06 Marks, June 2017)
22. Consider the following segment table:

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 37

Operating Systems-18CS43 Qu estion Bank

Segment Base Length

0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96

What are the physical addresses for the following logical addresses?
i) 0,430 ii) 1,10 iii) 2,500 iv) 3,400 v) 4,112

MODULE-4

1. Explain with the help of supporting hardware diagram how the TLB improves the performance of
demand paging (10Marks,June12, Jan14)
2. Given memory partitions of 100k ,500k,200k, 300k and 600k( in order) how would each of first fit ,
best fit and worst fit algorithms work place process of 212k,417k,112k, and 426k ( in order)? Which
algorithm makes the most efficient use of memory ?(09Marks,June12,06marks, June 2018)
3. Explain with illustrations, the external and internal fragmentation problem encountered in contiguous
memory allocation. (09Marks,Dec12)
4. Explain the concept of forward – mapped page table. (09Marks,Dec12)
5. Consider the following sequence of memory reference form a 460 word program.
10,11,104,170,73,309,185,245,246,434,458,364 show the reference string assuming page size of 100
words find page fault rate for the above reference string assuming 200 words of primary memory
available and FIFO and LRU replacement algorithms. (10Marks, Dec12)
6. What is dynamic storage allocation? Explain the commonly used strategies for dynamic storage
allocation (09Marks,Dec12)
7. Explain the buddy-system , used for managing free memory assigned to kernel process
(06Marks, Dec11)
8. Explain the following page replacement algorithms : (06Marks, Dec11)
i) Optimal
ii) LRU
9. To reference string 1,0,7,1,0,3,1,3,2,0,3,2,4,0,3,2,1,0,7 find how many page faults would occur for
these algorithms, if number of frames is 3. (10Marks,Dec10,06 marks, June 2018) )

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 38

Operating Systems-18CS43 Qu estion Bank

10. Explain the segmentation memory management. Describe the hardware support that is required for
its implementation (10Marks,Dec10)

1. Explain the following:

i) File types
ii) File operation.
iii) File attributes (12Marks,Dec09, Jan14,(06 marks, June 2018))
2. Explain the methods used for implementing directories. (08Marks,Dec09, Jan14)
3. What is file? Describe the different access methods on files. . (06 Marks, June 2017)
4. What is file mounting? Explain.(04Marks,Dec08)
5. Draw a neat diagram and explain finked file allocation. Is FAT linked allocation? Discuss.
(09Marks,Dec08)
6. Discuss the following in brief: i) File Attributes ii) File types iii) Sequential File Access iv) Tree
structured Directories. (12Marks,Dec08,13)
7. Explain contiguous, linked and indexed methods of allocating disk space. (08Marks,Dec10)
8. What is meant by „consistency semantics‟? Explain the consistency semantics as implemented in a
modern O.S.(07Marks,May10)
9. With the help of neat diagram, describe:
i) Tree-structured directory ii) Acylic- graph directory. (06Marks,May10, 13,14)
10. Explain virtual file system (VFS) (09Marks,May10)
11. Explain any two file allocation methods with their merits and demerits. (08Marks,Dec10, Jan14)
12. Explain the following disk scheduling algorithms:
i) SSTF ii) SCAN iii) LOOK (10Marks,Dec10)

13. What are the different file access methods? Explain briefly. (05Marks,Dec10)
14. What do mean by a free space list? With suitable examples, explain any two methods of
implementation of a free space list. (08Marks,Dec10, Jan14)
15. What are the major methods used for allocating a disk space? Explain each, with suitable examples.
(12Marks,Dec10)
16. Explain different file access methods. (05Marks,June11)
17. Explain various directory structures (07Marks,June11)
18. Explain different disk space allocation methods with an example.
(08Marks,June11,14,(06 marks, June 2018))
19. Explain different types of files. (05Marks,June12)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 39

Operating Systems-18CS43 Qu estion Bank

20. Name the different allocation methods. Explain the linked allocation of file implementation with
merits and demerits (08Marks,June12). (08 Marks, June 2017)
21. Define file system explain different directory structure (07Marks,June12)
22. Describe the different access methods on files (09 Marks,Dec12)
23. Explain the concept of file mounting (05 Marks,Dec12)
24. With neat sketch, explain the linked file allocation and indexing file allocation methods.
(05Marks,Dec11, 13)
25. List the common file types along with its extension and functions (10Marks,Dec11)
26. How do the modern operating systems concurrently support multiplies types of file system? Explain
its implementation (10Marks,Dec11)
27. Explain the various operations performed on files. . (07 Marks, June 2017)
28. Point out and explain briefly the problems with RAID .(05 Marks, June 2017)
29. Explain Access matrix method of system protection. .(05 Marks, June 2017)

MODULE-5
1. A disk drive has 200 cylinders numbered from 0 to 199. The disk head is initially at cylinder 53. The
queue of pending requests in FIFO order is: 98, 183, 37, 122, 14, 124, 65, 67. Starting from the
current head position, what is the total distance traveled (in cylinders ) by Illustrate with figures in
each case. (12Marks,Dec09, Jan 14)
2. Describe the access matrix model used for protection purpose.
(08Marks,Dec09,Dec10,Dec08)
3. A drive has 5000cylinders numbered 0 to 4999. The drive is currently serving a request at cylinder
143 and the previous request was at cylinder 125. The queue of pending requests in FIFO order is :
86, 1470, 913, 1773, 948, 1509, 1022, 1750, 130. Starting from the current head position, what is the
total distance travelled (in cylinders) by the disk arm to satisfy the requests using algorithms FCFS,
SSTF, SCAN, LOOK. Illustrate with figures in each case.
(10Marks,Dec12,June11,Dec08,May11,June09)
4. Explain the following disk scheduling algorithms in brief with examples.
i) FCFS Scheduling ii) S S T F Scheduling iii) S C A N Scheduling
(12Marks,June11). (10 Marks, June 2017)(06 marks, June 2018)
5. Suppose the position of cylinder is at 53. Sketch the graphical representation for the queue of
pending requests in the order -98, 183, 37, 122, 14, 124, 65, 67, for FCFS, SSTF and LOOK
scheduling schemes. Give your comment on this scenario for the above schemes.

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 40

Operating Systems-18CS43 Qu estion Bank

(12Marks,June09, July 14)

6. Explain briefly various types of program threats and system threats. (10Marks,Dec10)
7. Discuss the steps in handling a page fault, with the help of neat diagram. (10Marks,Dec10)
8. Given the page reference string: 0 9 0 1 8 1 8 7 8 7 1 2 8 2 7 8 2 3 8 3 Three frames allocate for the
program in the main memory. Determine the number of page faults using i) LRU policy ii) Optimal
Replacement policy. (10Marks,Dec12)
9. Explain access matrix with an example (05Marks,June11)
10. Explain domain of protection (05Marks,June11)
11. What is disk scheduling? Explain any 3 disk Scheduling methods with examples.
(10Marks,June12,13)
12. What is swap space management? Explain. (05Marks,June12, Jan14)
13. What is access matrix ?explain access matrix with domain as objects (05Marks,June12, Jan14)
14. Explain sector slipping with an example (04Marks,Dec11)
15. Assume the disk queue, with request fun I/O to block on cylinders as 80, 30,15,100,125,90,45, and
10. If the disk head is initially at cylinder 35, illustrate the disk movements using the SSTF
scheduling algorithm. Also calculate the total head movement (08Marks,Dec11)
16. Explain various questions that arise in revocation of access rights (08Marks,Dec11)
17. Discuss the directory implementation using
i) Linear list ii) Hash table (10Marks,Dec10)
18. What are the components that the kernel module support under Linux? Explain in detail.
(10Marks Dec10, Jan 14)
19. Explain different system components in LINUX operating system.
(10Marks,Dec12, July 14,(06 marks, June 2018)
20. Discuss inter process communication in LINUX operation system.
(10Marks,Dec12,(06 marks, June 2018)
21. Distinguish between fork ( ) and clone ( ) system calls. Also customize clone() system call to fork
functionality with suitable modification/settings (08Marks,Dec11)
22. What do you mean by cloning? How it is achieved by Linux OS? (06 Marks, Jan14)
23. Explain the LINUX device drive the block structure (12Marks,Dec11)
24. Explain process scheduling in a linuxsystem . (06 Marks, June 2017)
25. Explain file systems implementation in linux . (08 Marks, June 2017)

By: Dr. Karthik S A, Dept. of ISE, BMSIT&M Page 41