Document 2B: Operating System – Process
Management Notes
1. Introduction
A process is a program in execution. It includes program counter, registers, variables, and
resources.
2. Process States
New Ready Running Waiting Terminated
(Include diagram with arrows showing state transitions)
3. Process Control Block (PCB)
Process ID
Program Counter
CPU Registers
Memory Management Info
I/O Status
4. CPU Scheduling Algorithms
FCFS (First Come First Serve) – Non-preemptive, simple queue
SJF (Shortest Job First) – Minimum burst time first
Round Robin (RR) – Time quantum based, fair for all
Priority Scheduling – Higher priority executes first
Multilevel Queue – Multiple queues with fixed priorities
5. Context Switching
Saving current process state and loading new process
Overhead but essential for multitasking
6. Interprocess Communication (IPC)
Shared Memory
Message Passing (Pipes, Message Queues, Sockets)
7. Deadlock Basics
Four conditions: Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait
Deadlock prevention and avoidance (Banker’s Algorithm)