Operating Systems

A _____ process is moved to the ready state when its time quantum expires.

Which of the following is also called job scheduler?

Compaction is used to solve the problem of

Which process can be affected by other processes executing in the system?

What is the drawback of banker's algorithm?

An I/O port typically consists of four registers- status, control, _____ and _____ registers.

The address loaded into the memory address register of the memory is referred to as

Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

The Trap mode bit changes from 0 to 1 when _____ mode switches to _____ mode.

Waiting Time is calculated as

Define Thread? List some of the benefits of multithreading. Demonstrate the three methods to implement Threads.

Assume the following workload in a system:

Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum = 3:
(i) Average Turn Around Time
(ii) Average Waiting Time

Differentiate between:
(i) User level Thread and Kernel level Thread
(ii) Contiguous and Indexed allocation method
(iii) Preemptive scheduling and Non-preemptive scheduling

How is a process different from a program? With an example explain why Process synchronization is necessary in multiprocessing operating system?

Describe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.

Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

What is the difference between fixed partition and variable partition also explains the need of compaction.

What is virtual memory? How is it implemented? Explain TLB in virtual memory with neat diagram.

What is Reader-Writer problem? Explain how Semaphore is used to resolve the problem of process synchronization.

What is Belady's Anomaly? Why LRU and Optimal Page Replacement algorithm doesn't suffer from this problem.

Compare and contrast Deadlock Prevention and Deadlock Avoidance. Can a system be in a state that is neither deadlock nor safe? If so, give an example. If not, prove that all states are either deadlock or safe.

Consider the following page reference string: 3, 4, 2, 1, 5, 5, 6, 2, 1, 2, 3, 7, 6, 3, 3, 2, 1, 2, 3, 6. Compare the page faults occur for the following replacement algorithms using four frames? Assume, initially all the frames are empty.
(i) LRU replacement
(ii) FIFO Replacement

A _____ process is moved to the ready state when its time quantum expires.

Which of the following is also called job scheduler?

Compaction is used to solve the problem of

Which process can be affected by other processes executing in the system?

What is the drawback of banker's algorithm?

An I/O port typically consists of four registers- status, control, _____ and _____ registers.

The address loaded into the memory address register of the memory is referred to as

Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

The Trap mode bit changes from 0 to 1 when _____ mode switches to _____ mode.

Waiting Time is calculated as

Define Thread? List some of the benefits of multithreading. Demonstrate the three methods to implement Threads.

Assume the following workload in a system:

Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum = 3:
(i) Average Turn Around Time
(ii) Average Waiting Time

Differentiate between:
(i) User level Thread and Kernel level Thread
(ii) Contiguous and Indexed allocation method
(iii) Preemptive scheduling and Non-preemptive scheduling

How is a process different from a program? With an example explain why Process synchronization is necessary in multiprocessing operating system?

Describe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.

Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?

What is the difference between fixed partition and variable partition also explains the need of compaction.

What is virtual memory? How is it implemented? Explain TLB in virtual memory with neat diagram.

What is Reader-Writer problem? Explain how Semaphore is used to resolve the problem of process synchronization.

What is Belady's Anomaly? Why LRU and Optimal Page Replacement algorithm doesn't suffer from this problem.

Compare and contrast Deadlock Prevention and Deadlock Avoidance. Can a system be in a state that is neither deadlock nor safe? If so, give an example. If not, prove that all states are either deadlock or safe.

Consider the following page reference string: 3, 4, 2, 1, 5, 5, 6, 2, 1, 2, 3, 7, 6, 3, 3, 2, 1, 2, 3, 6. Compare the page faults occur for the following replacement algorithms using four frames? Assume, initially all the frames are empty.
(i) LRU replacement
(ii) FIFO Replacement

A computer system has 9 tape drives, with $ n $ processes competing for them. Each process may need 3 tape drives. The maximum value of $ n $ for which the system is guaranteed to be deadlock free is

Which of the following page replacement algorithms suffers from Belady's anomaly?

Scheduling a process from ready Queue to CPU is done by

The time to move the disk arm to the desired cylinder in hard disk is known as

Compaction is used to solve the problem of

__________ is a technique of improving the priority of process waiting in queue for CPU allocation.

The CPU utilization is low when the system is

When a process waits indefinitely for some resources which are being used by other processes, it is called

Fork is used to

Which one of the following is the deadlock avoidance algorithm?

Explain the concept of a process. With the help of a state transition diagram, discuss the various process states.

Describe the differences among short term, medium-term, and long-term scheduling.

What are the various allocation policies in variable partition multiprogramming? Explain the differences between internal and external fragmentations.

What do you understand by address binding? Explain the various address binding schemes.

What are the differences between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?

What resources are used when a thread is created? How do they differ from those used when a process is created?

Describe the actions taken by a kernel to context switch between kernel-level threads.

What do you understand by deadlock? Discuss the methods to avoid deadlock.

State and explain the necessary and sufficient conditions for a deadlock.

Consider the following process with the given table:

Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.

What do you mean by critical section problem? Discuss Peterson's solution for critical section problem.

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
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

Suppose a disk drive has 300 cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.

Compare and contrast between linked and indexed disk allocation strategies.

I-node

Segmentation

Thrashing

Process Control Block

A computer system has 9 tape drives, with $ n $ processes competing for them. Each process may need 3 tape drives. The maximum value of $ n $ for which the system is guaranteed to be deadlock free is

Which of the following page replacement algorithms suffers from Belady's anomaly?

Scheduling a process from ready Queue to CPU is done by

The time to move the disk arm to the desired cylinder in hard disk is known as

Compaction is used to solve the problem of

__________ is a technique of improving the priority of process waiting in queue for CPU allocation.

The CPU utilization is low when the system is

When a process waits indefinitely for some resources which are being used by other processes, it is called

Fork is used to

Which one of the following is the deadlock avoidance algorithm?

Explain the concept of a process. With the help of a state transition diagram, discuss the various process states.

Describe the differences among short term, medium-term, and long-term scheduling.

What are the various allocation policies in variable partition multiprogramming? Explain the differences between internal and external fragmentations.

What do you understand by address binding? Explain the various address binding schemes.

What are the differences between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?

What resources are used when a thread is created? How do they differ from those used when a process is created?

Describe the actions taken by a kernel to context switch between kernel-level threads.

What do you understand by deadlock? Discuss the methods to avoid deadlock.

State and explain the necessary and sufficient conditions for a deadlock.

Consider the following process with the given table:

Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.

What do you mean by critical section problem? Discuss Peterson's solution for critical section problem.

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
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

Suppose a disk drive has 300 cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.

Compare and contrast between linked and indexed disk allocation strategies.

I-node

Segmentation

Thrashing

Process Control Block

What is the difference between a multiprocessor and a multicore system?

What is multiprogramming?

Define jacketing.

What operations can be performed on a semaphore?

What is the difference between a page and a frame?

In contiguous memory allocation

If the size of logical address space is 2 to the power of $ m $, and a page size is 2 to the power of $ n $ addressing units, then the high order ___ bits of a logical address designate the page number, and the ___ low order bits designate the page offset.

If the wait for graph contains a cycle, then

When the event for which a thread is blocked occurs?

An I/O port typically consists of four registers status, control, ___ and ___ registers.

What is the purpose of interrupts? What are the differences between a trap and an interrupt? Can traps be generated intentionally by a user program? If so, for what purpose?

Answer the following with full justifications:
Does swapping improve or degrade the efficiency of system utilization?
Can swapping be used in a multiprogramming system?

Including the initial parent process, how many processes are created by the program shown below?
#include<stdio.h>
#include<unistd.h>
int main()
{
/* fork a child process */
fork();
/* fork another child process */
fork();
/* and fork another */
fork();
return 0;
}

Describe the differences among short-term, medium-term, and long-term scheduling.

An airline reservation system, using a centralized database service, user requests concurrently. Is it preferable to use threads rather than processes in this system? Give reasons for your answer.

Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context-switching overhead is 0.1 millisecond and that all processes are long-running tasks. Describe the CPU utilization for a round-robin scheduler when-
(i) the time quantum is 1 millisecond;
(ii) the time quantum is 10 milliseconds.

Clearly justify why deadlocks cannot arise in a bounded buffer producers-consumers system.

Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock-free.

Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6 and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 1, 4 and 2, respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the waiting time for each process and the average waiting for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound:
(a) Priority scheduling
(b) FCFS (run in order 15, 9, 3, 6 and 12)
(c) Shortest job first

A bridge on a busy highway is damaged by a flood. One-way traffic is to be instituted on the bridge by permitting vehicles traveling in opposite directions to use the bridge alternately. The following rules are formulated for use of the bridge:
(a) At any time, the bridge is used by vehicle(s) traveling in one direction only.
(b) If vehicles are waiting to cross the bridge at both ends, only one vehicle from one end is allowed to cross the bridge before a vehicle from the other end starts crossing the bridge.
(c) If no vehicles are waiting at one end, then any numbers of vehicles from the other end are permitted to cross the bridge.
Develop a concurrent system to implement these rules.

Consider a simple paging system with the following parameters:
• $ 232 $ bytes of physical memory
• Page size of $ 210 $ bytes
• $ 216 $ pages of logical address space
(i) How many bits are in a logical address?
(ii) How many bytes are in a frame?
(iii) How many bits in the physical address specify the frame?
(iv) How many entries are in the page table?

Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order). How would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes the most efficient use of memory?

Consider a demand paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 80 percent of the accesses are in the associative memory and that of those remaining 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time?

The open file table is used to maintain information about files that are currently open. Should the operating system maintain a separate table for each user or just maintain one table that contains references to files that are currently being accessed by all users? If the same file is being accessed by two different programs or users, should there be separate entries in the open-file table?

What is the difference between a multiprocessor and a multicore system?

What is multiprogramming?

Define jacketing.

What operations can be performed on a semaphore?

What is the difference between a page and a frame?

In contiguous memory allocation

If the size of logical address space is 2 to the power of $ m $, and a page size is 2 to the power of $ n $ addressing units, then the high order ___ bits of a logical address designate the page number, and the ___ low order bits designate the page offset.

If the wait for graph contains a cycle, then

When the event for which a thread is blocked occurs?

An I/O port typically consists of four registers status, control, ___ and ___ registers.

What is the purpose of interrupts? What are the differences between a trap and an interrupt? Can traps be generated intentionally by a user program? If so, for what purpose?

Answer the following with full justifications:
Does swapping improve or degrade the efficiency of system utilization?
Can swapping be used in a multiprogramming system?

Including the initial parent process, how many processes are created by the program shown below?
#include<stdio.h>
#include<unistd.h>
int main()
{
/* fork a child process */
fork();
/* fork another child process */
fork();
/* and fork another */
fork();
return 0;
}

Describe the differences among short-term, medium-term, and long-term scheduling.

An airline reservation system, using a centralized database service, user requests concurrently. Is it preferable to use threads rather than processes in this system? Give reasons for your answer.

Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context-switching overhead is 0.1 millisecond and that all processes are long-running tasks. Describe the CPU utilization for a round-robin scheduler when-
(i) the time quantum is 1 millisecond;
(ii) the time quantum is 10 milliseconds.

Clearly justify why deadlocks cannot arise in a bounded buffer producers-consumers system.

Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock-free.

Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6 and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 1, 4 and 2, respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the waiting time for each process and the average waiting for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound:
(a) Priority scheduling
(b) FCFS (run in order 15, 9, 3, 6 and 12)
(c) Shortest job first

A bridge on a busy highway is damaged by a flood. One-way traffic is to be instituted on the bridge by permitting vehicles traveling in opposite directions to use the bridge alternately. The following rules are formulated for use of the bridge:
(a) At any time, the bridge is used by vehicle(s) traveling in one direction only.
(b) If vehicles are waiting to cross the bridge at both ends, only one vehicle from one end is allowed to cross the bridge before a vehicle from the other end starts crossing the bridge.
(c) If no vehicles are waiting at one end, then any numbers of vehicles from the other end are permitted to cross the bridge.
Develop a concurrent system to implement these rules.

Consider a simple paging system with the following parameters:
• $ 232 $ bytes of physical memory
• Page size of $ 210 $ bytes
• $ 216 $ pages of logical address space
(i) How many bits are in a logical address?
(ii) How many bytes are in a frame?
(iii) How many bits in the physical address specify the frame?
(iv) How many entries are in the page table?

Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order). How would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes the most efficient use of memory?

Consider a demand paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 80 percent of the accesses are in the associative memory and that of those remaining 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time?

The open file table is used to maintain information about files that are currently open. Should the operating system maintain a separate table for each user or just maintain one table that contains references to files that are currently being accessed by all users? If the same file is being accessed by two different programs or users, should there be separate entries in the open-file table?

What is operating system?

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

Which of the following conditions is required for deadlock to be possible?

Which one of the following is the deadlock avoidance algorithm?

Physical memory is broken into fixed-sized blocks called

What is process control block? Explain it. Discuss the difference among short-term, medium-term and long-term scheduling.

Consider the following process :

Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.

What do you understand by race condition? Give few example of arising of race condition in concurrent processing.

Define semaphore. Give a scheme for implementation of semaphore primitives.

What do you mean by critical section problem? What is the solution to the critical section problem?

What is a thread?

How is thread different from a process?

What resources are used when a thread is created?

How many page faults would occur for the following reference string for four page frames and three page frames using LRU and FIFO algorithms :

1, 2, 3, 4, 5, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.

Define deadlock. List four necessary conditions for occurrence of deadlock. A system contains six units of resource, and $n$ processes that use the resource. What is the maximum value of $n$ for which the system will be deadlock free if the maximum requirement of each process is 3?

Explain shortest-seek-time-first (SSTF) disk scheduling. Why SSTF scheduling tends to favour middle cylinders over the innermost and outermost cylinders?

Choose the correct option (any seven) :

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Write short notes on the following :

Choose the correct answer (any seven) :

Answer the following:

Consider the following set of processes with the length of CPU burst time in milliseconds : Process | Burst Time (ms) | Priority P1 | 10 | 3 P2 | 1 | 1 P3 | 2 | 3 P4 | 1 | 4 P5 | 5 | 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 and all at time 0.

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Suppose that a disk drive has 5000 cylinders, 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, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms?

Answer the following:

Choose the correct answer for any seven of the following :

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Choose the correct answer (any seven) :

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Choose the correct answer (any seven) :

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

Answer the following:

An operating system is a type of —— software.

A process is

An operating system having rigid time requirements is known as

—— is a technique of improving the priority of process waiting in queue for CPU allocation.

Kernel mode of operation is also called

Interval between the time of submission and completion of the job is called

A software generated interrupt is called

In which of the following page replacement policies Belady's anomaly occurs?

LRU page replacement algorithm stands for

Memory management scheme having no external fragmentation is called

Explain the duties of operating system.

How is a process different from a program? Explain the importance and need for process control block.

Explain the use of resource allocation graph.

What is thread? Explain the benefits of using thread.

What do you understand by deadlock? Discuss the methods to avoid deadlock.

What is thrashing? How can it be controlled?

Explain the various address binding schemes.

Explain the segmentation technique with the help of a diagram.

Explain the following terms :
(i) Turnaround time
(ii) Waiting time
(iii) Response time
(iv) Throughput

Consider the following page replacement string :
0, 7, 1, 2, 0, 3, 7, 4, 2, 3, 0, 3, 2, 1, 0, 7, 1, 7, 0, 1
Find the number of page faults using the following algorithms for a memory of 4 frames :
(i) FIFO algorithm
(ii) Optimal algorithm

Explain the use of TLB in paging hardware and its benefits.

Explain the role of different types of scheduler.

What is Belady's anomaly? Explain the steps for page replacement.

Explain the options for allocation of frames among various processes.

Explain the working of LOOK and C-LOOK scheduling algorithms.

Explain Dining-Philosophers problem.

Define operating system. What are the duties performed by an operating system?

What are the main advantages of time sharing systems?

What are system calls? Explain their importance.

Differentiate between a file and a Directory. Justify for the need of file system.

Explain the main features of general graph directory structure.

What do you understand by deadlock? Discuss the methods to avoid deadlock in an operating system.

Explain the working of resource allocation graph.

What is the difference between physical and logical address space?

What are semaphores? How can they be used to handle the process synchronization problem?

What are the benefits of segmentation?

Explain the segmentation technique with the help of a diagram.

Explain the following terms:
(i) Turnaround time
(ii) Waiting time
(iii) Response time
(iv) Throughput

Consider the following page replacement string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Find the number of page faults using the following algorithms for a memory of three frames:
(i) FIFO algorithm
(ii) LRU algorithm

What do you understand by fragmentation? Explain the difference between external and internal fragmentations.

What is a thread? Explain the benefits of using threads.

What do you understand by address binding? Explain the various address binding schemes.

Explain the importance of virtual memory.

What do you understand by disk scheduling? Describe seek time and rotational latency.

Describe SCAN scheduling. How is C-SCAN different from SCAN?

Micro kernel

Bankers Algorithm

Process control block

Paging

Indexed allocation

Define operating system. What are the duties performed by an operating system?

What are the main advantages of time sharing systems?

What are system calls? Explain their importance.

Differentiate between a file and a Directory. Justify for the need of file system.

Explain the main features of general graph directory structure.

What do you understand by deadlock? Discuss the methods to avoid deadlock in an operating system.

Explain the working of resource allocation graph.

What is the difference between physical and logical address space?

What are semaphores? How can they be used to handle the process synchronization problem?

What are the benefits of segmentation?

Explain the segmentation technique with the help of a diagram.

Explain the following terms:
(i) Turnaround time
(ii) Waiting time
(iii) Response time
(iv) Throughput

Consider the following page replacement string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Find the number of page faults using the following algorithms for a memory of three frames:
(i) FIFO algorithm
(ii) LRU algorithm

What do you understand by fragmentation? Explain the difference between external and internal fragmentations.

What is a thread? Explain the benefits of using threads.

What do you understand by address binding? Explain the various address binding schemes.

Explain the importance of virtual memory.

What do you understand by disk scheduling? Describe seek time and rotational latency.

Describe SCAN scheduling. How is C-SCAN different from SCAN?

Micro kernel

Bankers Algorithm

Process control block

Paging

Indexed allocation