Program for Priority Scheduling | Set 1- Operating System – Priority scheduling is a non-preemptive algorithm and one of the most common scheduling
CS Subjects
28 Articles
28
Round Robin scheduling- Operating System – Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.
Shortest Job First (or SJF) scheduling | Set 1 (Non- preemptive) – Operating System – Shortest job first (SJF) or shortest job next
FCFS Scheduling | Set 2 – Operating System – We have already discussed FCFS Scheduling of processes with same arrival time. In this post, scenario
FCFS Scheduling | Set 1 – Operating System – Given n processes with their burst times, the task is to find average waiting time and average turn around
Process Scheduler – Operating System – It bring the new process to the ‘Ready State’. It controls Degree of Multi-programming
CPU Scheduling – Operating System – A typical process involves both I/O time and CPU time. In a uniprogramming system like MS-DOS
Process | (Introduction and different state – Operating System – A process is a program in execution. For example, when we write a program in C or C++
Compiler Design – Lexical Analysis – Lexical Analysis is the first phase of compiler also known as scanner. It converts the input program into a sequence
Multiplexers | Digital Electronics- Digital Electronic-It is a combinational circuit which have many data inputs and single output depending on control.