FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -The full form of FCFS Scheduling is First Come First Serve Scheduling. FCFS Scheduling algorithm automatically executes the queued processes and requests in the order of their arrival. It allocates the job that first arrived in the queue to the CPU, then allocates the second one, and so on.

Detailed explanation-2: -Non-preemptive Scheduling is a CPU scheduling technique the process takes the resource (CPU time) and holds it till the process gets terminated or is pushed to the waiting state. No process is interrupted until it is completed, and after that processor switches to another process.

Detailed explanation-3: -First In, First Out (FIFO) is an accounting method in which assets purchased or acquired first are disposed of first. FIFO assumes that the remaining inventory consists of items purchased last. An alternative to FIFO, LIFO is an accounting method in which assets purchased or acquired last are disposed of first.

Detailed explanation-4: -In Priority Preemptive Scheduling, the tasks are mostly assigned with their priorities. In Priority Non-preemptive scheduling method, the CPU has been allocated to a specific process. Processes are executed on the basis of priority so high priority does not need to wait for long which saves time.