Qp. No.

Part-A (10 x 2 = 20 Marks)

1. State the objectives of Operating System
1. Is OS a resource Manager? If so justify your answer.
1. What do you mean by cascading termination?
1. Do timesharing differ from multiprogramming? If so how?
1. Define Kernel
1. What is SYSGEN?
1. What is PCB? List out the fields associated with Process Control block.
1. Discuss the differences between Symmetric and Asymmetric Multiprocessing?
1. Do time sharing differ from multi programming? If so, how?
1. Compare Multiprogramming and Multitasking.
2. What is a system call?
2. How does an interrupt differ from a trap?
2. Define operating system.
2. List the steps in instruction execution.
2. What is PCB? List out the fields associated with Process Control block.
2. What is Virtual machine?
2. Differentiate Multiprocessors and Multi-core processors.
2. Differentiate Independent vs Cooperating process
2. Explain warm booting and cold booting.
2. What is Booting?
3. Define Threads. State the advantages of Threads.
3. Compare Process and Thread.
3. What is meant by fork-join model?
3. What is dispatcher and dispatch latency?
3. Difference between Non-preemptive scheduling and Preemptive scheduling.
3. What is difference between user level thread and kernel level threads?
3. Under what circumstances user level threads is better than the kernel level threads? Justify your answer.
3. What is pthread?
3. What is implicit threading?
3. Define Starvation.
4. What is Data Parallelism?
4. What is Task Parallelism?
4. Define Throughput?
4. What are the criteria for scheduling?
4. What is turnaround time?
4. What is Response time?
4. What is Preemptive scheduling and Non-Preemptive scheduling?
4. What is the difference between CPU bound process and I/O bound process.
4. What are the types of Schedulers? Explain.
4. Difference between long term scheduler and short term scheduler.
5. What is Race condition?
5. Define Peterson’s solution.
5. Name some classical problems of process synchronization.
5. What are the requirements must a solution to the critical solution problem satisfy?
5. Define busy waiting and spinlock.
5. List out the classical problems of process synchronization.
5. What is the sequence of operations in which a process utilizes a resource?
5. Define entry section and exit section in CS.
5. Define Peterson’s solution.
5. List out some of the classical problems of Process Synchronization.
6. Define deadlock.
6. What is livelock?
6. What is safe sequence?
6. What is claim edge?
6. Is it possible to prevent the occurrence of deadlock? Under what conditions?
6. Draw a resource allocation graph.
6. How to to prevent the occurrence of deadlock?
6. What is premption? Is it needed for dead lock?
6. Write steps for dead lock recovery.
6. What is hold and Wait?
7. Differentiate between internal and external fragmentation.
7. What is the need for paging?
7. What is Compaction?
7. Why page sizes are always power of 2?
7. What is called as Belady’s Anomaly?
7. What is LRU page replacement?
7. What is Optimal page replacement?
7. Write the structure of Page table.
7. What is the purpose of paging the page table?
7. What is pure demand paging?
8. Differentiate swapper and pager.
8. Define Thrashing and how the system detects it?
8. What is the use of TLB?
8. Write down the formula for effective access time.
8. How will you convert logical address to physical address in segmented memory management?
8. Explain Coalescing.
8. What are the methods for preventing Trashing?
8. Define Thrashing and how the system detects it?
8. Define thrashing.
8. If the average page faults service time of 25 ms and a memory access time of 100ns.Calculate the
effective access time.
9. Define rotational latency and seek time.
9. Define disk bandwidth.
9. What is Directory? What are the operations that can be performed on a directory?
9. Defferentiate between UFD and MFD
9. What are the different accessing methods of a file?
9. Define Seek time.
9. What is rotational latency?
9. Define disk bandwidth.
9. What is Directory? What are the operations that can be performed on a directory?
9. Define UFD and MFD
10. What is a file? List the various file attributes and operations.
10. What are the various attributes of a file?
10. What is a path name? What are the types of path names?
10. What is DMA?
10. What is the information associated with an open file?
10. What is Disk formatting?
10. What do you mean by Disk Reliability.
10. Define DMA and its modes.
10. What is a bus in I/O hardware.
10. What is DMA? What are the modes ?
 Part – B ( 5 x 13 = 65 Marks)
11.a. Explain the basic components of a computer system and instruction execution cycle in detail.
11.a. (i) Explain the basic components of a computer system(7)
(ii) Explain the interrupt processing mechanism in detail.(6)
11.a. Draw the state diagram of a process from its creation to termination, including all transitions, and briefly
illustrate every state and every transition.
11.a. Define Interrupt. Explain how interrupt is handled by Interrupt handler.
11.a. Explain the basic components of a computer system and instruction execution cycle in detail.
11.a. Explain the various types of System Calls with an example for each.
11.a. Explain the purpose and importance of system calls and discuss the types of system calls with examples of each.

11.a. Discuss in detail about various system calls provided by OS.

11.a. Define system call. List and explain the system calls provided by OS.
11.a. What is a system call. List and explain the system calls provided by OS.
11.b. Explain the various types of System calls with an example for each.
11.b. (i)Explain the purpose and importance of system calls and discuss the types of system calls with
examples of each. (7)
(ii) Explain in detail about the functionality of system boot with respect to Operating System. (6)
11.b. Explain in detail about Inter Process communication using shared memory.
11.b. Explain in detail about Inter Process communication using message passing system.
11.b. Explain in detail about Inter Process communication using shared memory and message passing
system.
11.b. What are Interacting processes and Independent Process? Explain in detail about Inter Process
Communication.
11.b. Explain in detail about Inter Process Communication.
11.b. How Inter Process Communication is achieved through shared memory and Message Passing
mechanism.
11.b. Write short notes on shared memory and Message Passing mechanism.
11.b. Explain in detail about Inter Process Communication using shared memory with an example.
12.a. Discuss in detail about threads and various threading models.
12.a. Explain pthreads and windows thread management with examples.
12.a. Write short notes on
(i) Thread cancellation (6)
(ii) fork() and exec() system calls (7)
12.a. Explain in detail about real time scheduling algorithms.
12.a. Explain fork-join with suitable example.
12.a. What is Multithreading? Explain in detail about the multithreading models.
12.a. With a neat diagrma discuss in detail about threads and various threading models.
12.a. Illustrate with examples about various multi-threading models.
12.a. Explain in detail about the different Multithreading models with neat diagram.
12.a. What is a thread? Describe in detail about the different Multithreading models with neat diagram.
12.b. Consider the following process with the CPU burst time given in milliseconds
Process Burst time Priority
P1 5 2
P2 1 1
P3 7 3
P4 1 4
P5 3 2
Processes are arrived in P1,P2,P3,P4,P5 order of all at time 0
i) Draw Gantt charts to show execution using FCFS, SJF (Non Preemption), Priority (Non Preemption)
and RR (Quantum=2ms) Scheduling. (7)
Also calculate the waiting time and Turnaround time. (6)

12.b. Consider the following process with the CPU burst time given in milliseconds
Process Burst time Priority
P1 5 2
P2 1 1
P3 7 3
P4 1 4
P5 3 2

Processes are arrived in P1,P2,P3,P4,P5 order of all at time 0

ii) Draw Gantt charts to show execution using FCFS, SJF (Non Preemption), Priority (Non Preemption)
and RR (Quantum=2ms) Scheduling. (7)
Also calculate the waiting time and Turnaround time. (6)
12.b. For the processes listed below, draw a Gantt chart and find the Waiting time and Turnaround time.
a) FCFS (4)
b) SJF(Preemption and Non Preemption) (3)
c) Priority(Preemption and Non Preemption) (3)
d) RR (Quantum Slice: 3ms) (3)
Process Burst time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

12.b. Explain the FCFS, preemptive and non-preemptive versions of Shortest Job First and Round Robin
(time slice =2) scheduling algorithms with Gantt char for the four processes given. Compare their average turn
around and waiting time.

Process Arrival Time Burst Time

P1 0 10
P2 0 6
P3 2 12
P4 3 15

12.b. For the processes listed below, draw a Gantt chart and find the Waiting time and Turnaround time.
a) FCFS (4)
b) SJF(Preemption and Non Preemption) (3)
c) Priority(Preemption and Non Preemption) (3)
d) RR (Quantum Slice: 4ms) (3)
Process Arrival Time Burst Time Priority
P1 0 10 4
P2 1 6 2
P3 2 12 1
P4 3 15 3

12.b. For the processes listed below, draw a Gantt chart and find the Waiting time and Total arrival time and
waiting time.
a)FCFS (7)
b)SJF (6)
Process Burst time Arrival time
P1 7 0
P2 4 2
P3 1 4
P4 4 5

12.b. Consider the following process with the CPU burst time given in milliseconds
Process Burst time Priority
P1 5 53
P2 1 17
P3 7 68
P4 1 24
Processes are arrived in P1,P2,P3,P4 order of all at time 0
Draw Gantt charts to show execution using FCFS, SJF (Non Preemption), Priority (Non Preemption) and RR
(Quantum=20ms) Scheduling. (7)
(ii) Also calculate the waiting time and Turnaround time. (6)
12.b. Explain the FCFS, preemptive and non-preemptive versions of Shortest Job First and Round Robin
(time slice =2) scheduling algorithms with Grant char for the four processes given. Compare their average turn
around and waiting time.

Process Arrival Time Burst Time

P1 0 10
P2 0 6
P3 2 12
P4 3 15

12.b. Consider the following process with the CPU burst time given in milliseconds
Process Burst time Priority Ariival time
P1 6 2 0
P2 2 2 1
P3 3 4 1
P4 1 1 2
P5 2 3
2
Processes are arrived in P1,P2,P3,P4,P5 order
Draw Gantt charts to show execution using FCFS, SJF (Non Preemption), Priority (Non Preemption) and (7)
(ii) Also calculate the waiting time and Turnaround time. (6)
12.b. For the processes listed below, draw a Gantt chart and find the Waiting time and Turnaround time.
a) FCFS (4)
b) SJF(Preemption and Non Preemption) (3)
c)Priority(Preemption and Non Preemption) (3)
d)RR (Quantum Slice: 4ms) (3)
Process Arrival Time Burst Time Priority
P1 0 10 4
P2 1 6 2
P3 2 12 1
P4 3 15 3

13.a. What are semaphores? How do they implement mutual exclusion?

13.a. Write in detail about Dining philosopher problem and show how monitors are helpful in solving them.
13.a. Explain bounded buffer problem and justify how to solve them from race condition.
13.a. Explain readers and writers problem and justify how to solve them from race condition.
13.a. With a solution discuss bounded buffer problem and justify how to solve them from race condition.
13.a. With a solution write about Dining philosopher problem and show how monitors are helpful in solving
them.
13.a. Explain readers and writers problem and justify how to solve them from race condition.
13.a. What are semaphores? How do they implement mutual exclusion?
13.a. Explain in detail about monitor.
13.a. Explain bounded buffer problem and justify how to solve them from race condition.
13.b. Explain deadlock in detail with the system model and characterization.
13.b. i) Explain about Resource Allocation Graph and state how deadlock detected using RAG along with an
example. (6)
Ii) Explain how deadlock prevention can be done? (7)
13.b. i) Explain about the conditions which will hold a non-deadlock system. (6)
ii) Explain about Resource Allocation Graph and state how deadlock is detected using RAG along with an
example. (7)
13.b.
There exist deadlock in this RAG. Say True or False. If your answer is true write the steps to detect and
recovery from it. If your answer is false, with the help of necessary conditions for a deadlock, explain each
condition.
13.b.

There exist deadlock in this RAG. Say

True or False. If your answer is True
write the steps to detect and recovery
from it. If your answer is false, with
the help of necessary conditions for a
deadlock, explain each condition.
13.b.
Is there exist deadlock in this Graph? write the steps to detect and recovery if Yes. from it. If your answer is
no, with the help of necessary conditions for a deadlock, explain each condition.
13.b. There exist
deadlock in this
RAG. Say True or
False. If your
answer is True write
the steps to detect
and recovery from
it. If your answer is
false, with the help
of necessary
conditions for a deadlock, explain each condition.
13.b.
There exist deadlock in this
RAG. Say True or False. If your
answer is True write the steps to
detect and recovery from it. If
your answer is false, with the
help of necessary conditions for
a deadlock, explain each
condition.

13.b.

There exist deadlock in this RAG. Say True or False. If your answer is True write the steps to detect and
recovery from it. If your answer is false, with the help of necessary conditions for a deadlock, explain each
condition.
13.b.
There exist deadlock in this RAG. Say True or False. If your answer is True write the steps to detect and
recovery from it. If your answer is false, with the help of necessary conditions for a deadlock, explain each
condition.
14.a. Given memory partitions of 100k, 50k,600k,450k,200k,600k
Determine the available space list after allocating the space for the stream of requests consisting of the following
block sizes:
25,100,250,200,100,150
Use i) FIRST FIT ii) BEST FIT and iii) WORST FIT algorithms.
14.a. Explain the concept of Paging with neat diagrams.
14.a. (i)What is fixed partition and Variable Partition memory allocation (6)
(ii) Explain paging and the use of TLB in paging (7)
14.a. (i)What is fixed partition and Variable Partition memory allocation (9)
(ii)Give the differences between: Internal and external fragmentation(4)
14.a. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) how would each of the
first fit, best fit and worst fit algorithms work place processes of 212 K, 417K,112 K and 426 K (in order)?
Which algorithm makes the most efficient use of memory?
14.a. Given memory partitions of 100k, 50k,600k,450k,200k,600k
Determine the available space list after allocating the space for the stream of requests consisting of the following
block sizes:

25,100,250,200,100,150
Use i) FIRST FIT ii) BEST FIT and iii) WORST FIT algorithms.
14.a. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) how would each of the
first fit, best fit and worst fit algorithms work place processes of 212 K, 417K,112 K and 426 K (in order)?
Which algorithm makes the most efficient use of memory?
14.a. Given memory partitions of 200 K, 500 K, 200 K, 300 K and 600 K (in order) how would each of the
first fit, best fit and worst fit algorithms work place processes of 212 K, 417K,112 K and 426 K (in order)?
Which algorithm makes the most efficient use of memory?
14.a. Given memory partitions of 100k, 50k,600k,450k,200k,600k
Determine the available space list after allocating the space for the stream of requests consisting of the following
block sizes:
25,100,250,200,100,150
Use i) FIRST FIT ii) BEST FIT and iii) WORST FIT algorithms.
14.a. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) how would each of the
first fit, best fit and worst fit algorithms work place processes of 212 K, 417K,112 K and 426 K (in order)?
Which algorithm makes the most efficient use of memory?
14.b. Consider the following page reference string: 1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6 . How many page
faults would occur for the FIFO, LRU and optimal page replacement algorithms assuming three and four
frames?
14.b. Consider the page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. How many page faults would
occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3.
14.b. Consider the page reference string: 1,2,3,4,2,5,3,4,2,6,7,8,7,9,7,8,2,5,4 and 9. How many page faults
would occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3 and 4.
14.b. Consider the following page reference string: 1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6 How many page faults
would occur for the FIFO, LRU and optimal page replacement algorithms assuming three and four frames?
14.b. Consider the following page reference string: 2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6 How many page faults
would occur for the FIFO, LRU and optimal page replacement algorithms assuming three and four frames?
14.b. Consider the page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. How many page faults would
occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3.
14.b. Consider the page reference string: 1,2,3,4,2,5,3,4,2,6,7,8,7,9,7,8,2,5,4 and 9. How many page faults
would occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3 and 4.
14.b. Consider the page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. How many page faults would
occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3.
14.b. The page reference string ginven area : 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. How many page faults
would occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 4.
14.b. Consider the page reference string: 1,2,3,4,2,5,3,4,2,6,7,8,7,9,7,8,2,5,4 and 9. How many page faults
would occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3 and 4.
15.a. Define File. What are the various types of files? Discuss in detail about several File Access methods
15.a. What are the attributes of a file? Explain in detail all file Access methods with diagrams.
15.a. Discuss in detail about file Operations with File Access methods
15.a. Write notes on File Access methods with a neat diagram.
15.a. What are the various types of files? Discuss in detail about several file Access methods
15.a. What are the attributes of a file? Discuss all file Access methods with diagrams.
15.a. List out attributes of a file and explain in detail about Access methods with a neat diagram.
15.a. Provide insights into File Access methods, accompanied by a clear diagram
15.a. Describe the differences between a file and a directory. Write in-Depth Exploration of vaious File
Access methods.
15.a. What is a file. Discuss all file Access methods with neat diagrams.
15.b. List out te types of Directory structure and explain in detail about eac wit a neat diagram
15.b. Explain in detail about all 5 directory structures with a neat diagram.
15.b. Write short notes on directory structures.
15.b. Explain the concept of Directory and suggest various types of Directory structures that can be used.
15.b. Discuss in detail about al1 5 types of directory structure wit neat diagrams
15.b. Describe the fundamental concept of directories and propose different types of directory structures.
15.b. Provide an explanation of the fundamental concept of directories and present diverse directory
structures.

15.b. Describe the differences between a file and a directory. Write in-Depth Exploration of 5 Directory
Structures with Diagrams
15.b. Explore the concept of directories and propose different types of directory structures that can be utilized.
15.b. Differntiate a file and directory.Describe the fundamental concept of directories and propose different
types of directory structures.
Part – C ( 1 x 15 = 15 Marks)
16.a. Consider the following snapshot of a system
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 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 question using banker’s algorithm
a)What is the content of the matrix Need? (2)
b)Is the system in a safe state? (8)
c)If a request from process p1 arrives for (0,4,2,0) can the request be granted immediately? (5)
16.a. Examine the current state of the system presented in the following snapshot
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 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 question using banker’s algorithm
a)What is the content of the matrix Need? (2)
b)Is the system in a safe state? (8)
c)If a request from process p1 arrives for (0,4,2,0) can the request be granted immediately? (5)
16.a. Consider the following snapshot of a system
Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(i) Is the system in a safe state?(6)
(ii) What is the content of matrix Need?(4)
(iii) What are the total no.of resources available for each resource type?(2)
(iv) If a request from process P1 arrives for ( 1,2,1) can the request be granted immediately?(3)
16.a. Consider the following snapshot of a system
Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(i) Is the system in a safe state?(6)
 (ii) What is the content of matrix Need?(4)
(iii) What are the total no.of resources available for each resource type?(2)
(iv) If a request from process P1 arrives for ( 1,2,1) can the request be granted immediately?(3)
16.a. Consider the following snapshot of a system
Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(i) Is the system in a safe state?(6)
(ii) What is the content of matrix Need?(4)
(iii) What are the total number of resources available for each resource type?(2)
(iv) If a request from process P1 arrives for ( 1,2,1) can the request be granted immediately?(3)
16.a. Consider the following snapshot of a system
Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(i) Does the current system configuration represent a safe state? (6)
(ii) What is the content of the Need matrix based on the given allocation and maximum matrices? (4)
(iii) What is the total number of available resources for each resource type in the system? (2)
(iv) If process P1 requests additional resources (1, 2, 1), can the request be granted immediately? (3)
16.a. Examine the current state of the system presented in the following snapshot
Allocation Max Available

ABC ABC ABC

P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(v) Is the system in a safe state?(6)
(vi) What is the content of matrix Need?(4)
(vii) What are the total number of resources available for each resource type?(2)
(viii) If a request from process P1 arrives for ( 1,2,1) can the request be granted immediately?(3)
16.a. Analyze the present system state depicted in the provided snapshot
Allocation Max Available
 ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
(v) Is the system in a safe state?(6)
(vi) What is the content of matrix Need?(4)
(vii) What are the total no.of resources available for each resource type?(2)
(viii) If a request from process P1 arrives for ( 1,2,1) can the request be granted immediately?(3)
16.a. Assess the current system state depicted in the provided snapshot
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 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 question using banker’s algorithm
a)What is the content of the matrix Need? (2)
b)Is the system in a safe state? (8)
c)If a request from process p1 arrives for (0,4,2,0) can the request be granted immediately? (5)
16.a. Examine the current state of the system presented in the following snapshot
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 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 question using banker’s algorithm
a)What is the content of the matrix Need? (2)
b)Is the system in a safe state? (8)
c)If a request from process p1 arrives for (0,4,2,0) can the request be granted immediately? (5)
16.b. Suppose that the head of moving head disk with 200 tracks numbered 0 to 199 is currently serving the
request at track 143 and has just finished a request at track 125.If the queue request is kept in FIFO order,86,
147, 91, 177, 94, 150, 102, 175, 130. Identify a better disk scheduling algorithm with the minimum seek time.
16.b. Consider a disk queue with requests for I/O to blocks on cylinders 98,183,37,122,14,124,65,67. If the
disk head is at 53 then find out the total head movement with respect to the various disk scheduling algorithms.
Which algorithm is a good one?
16.b. Consider a disk queue with I/O requests on the following cylinders in their arriving order.
54,97,73,128,15,44,110,34,45. The disk head is assumed to be at cylinder 23. Calculate and show with diagram
the head movement for FCFS,SSTF, SCAN, C-SCAN, LOOK, C-LOOK.
16.b. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. the drive currently services a request
at cylinder 143, and the previous request was at cylinder 125. The queue of pending request in FIFO order is
86,1470,913,1774,948,1509,1022,1750,130
Starting from the current position, what is the total distance (in cylinders) that the disk arm moves to satisfy all
pending requests, for each of the following algorithms i) FCFS ii) SSFT iii) SCAN iv) C-SCAN v) LOOK vi) C
LOOK.
16.b. Suppose that the head of moving head disk with 200 tracks numbered 0 to 199 is currently serving the
request at track 143 and has just finished a request at track 125.If the queue request is kept in FIFO order,86,
147, 91, 177, 94, 150, 102, 175, 130What is the total head movement to satisfy these requests for i) i)FCFS ii)
SSFT iii) SCAN iv) C-SCAN v) LOOK vi)C LOOK disk scheduling algorithm.
16.b. Consider a disk queue with I/O requests on the following cylinders in their arriving order.
54,97,73,128,15,44,110,34,45. The disk head is assumed to be at cylinder 23. Calculate and show with diagram
the head movement for FCFS,SSTF, SCAN, C-SCAN, LOOK, C-LOOK. Find the optimum number of
cylinders.
16.b. Given a disk queue with I/O requests arriving in the order of 54, 97, 73, 128, 15, 44, 110, 34, 45, and
assuming the disk head is initially positioned at cylinder 23, compute and visually represent the head movement
for the following disk scheduling algorithms:

i) First-Come, First-Served (FCFS)

ii) Shortest Seek Time First (SSTF)
iii) SCAN
iv) C-SCAN
v) LOOK
vi) C-LOOK

Additionally, determine the optimum number of cylinders by evaluating the total head movement for each
algorithm. Optimum in this context refers to the configuration that minimizes the total head movement. Provide
calculations and diagrams to illustrate the head movement patterns for each algorithm.
16.b.
Imagine a moving-head disk system with 200 tracks labeled from 0 to 199. The disk head is presently at track
143 after completing a request at track 125. The pending requests are organized in a first-in-first-out (FIFO)
queue: 86, 147, 91, 177, 94, 150, 102, 175, 130. Calculate the total head movement for the following disk
scheduling algorithms:
i) First-Come, First-Served (FCFS)
ii) Shortest Seek Time First (SSTF)
iii) SCAN
iv) C-SCAN
v) LOOK
vi) C-LOOK
For each algorithm, determine the total head movement by considering the absolute differences between
consecutive track positions and, where applicable, the movement direction of the disk head.
16.b. Consider a disk queue with I/O requests on the following cylinders in their arriving order.
54,97,73,128,15,44,110,34,45. The disk head is assumed to be at cylinder 23. Calculate and show with diagram
the head movement for FCFS,SSTF, SCAN, C-SCAN, LOOK, C-LOOK. Find the optimum number of
cylinders.
16.b. Given a disk queue with I/O requests in the order of arrival: 54, 97, 73, 128, 15, 44, 110, 34, 45, and
assuming the disk head is initially at cylinder 23, let's analyze the head movement for various disk scheduling
algorithms, including FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK. The objective is to minimize the
head movement and optimize the disk access.