OS Menu9>
- OS Home
- Introduction
- CPU Scheduling
- What is Process?
- Process Lifecyle
- Process Control Block
- Process Scheduling
- Context Switching
- CPU Scheduling
- FCFS Scheduling
- SJF (non-preemptive)
- SJF (Preemptive - SRTF)
- Round Robin
- Priority Scheduling
- Convoy Effect
- Scheduler Vs Dispatcher
- Preemptive Vs non
- Preemptive scheduling
- Non preemptive scheduling
- Process Synchronization
- Deadlock
- Popular Algorithms
- Memory Management
- Memory Management Introduction
- Partition Allocation Method
- First Fit
- First Fit (Intro)
- First Fit in C
- First Fit in C++
- First Fit in Python
- First Fit in Java
- Best Fit
- Best Fit (Intro)
- Best Fit in C
- Best Fit in C++
- Best Fit in Java
- Worst Fit
- Worst Fit (Intro)
- Worst Fit in C++
- Worst Fit in C
- Worst Fit in Java
- Worst Fit in Python
- Next Fit
- First fit best fit worst fit (Example)
- Memory Management 2
- Memory Management 3
- Page Replacement Algorithms
- LRU (Intro)
- LRU in C++
- LRU in Java
- LRU in Python
- FIFO
- Optimal Page Replacement algorithm
- Optimal Page Replacement (Intro)
- Optimal Page Replacement Algo in C
- Optimal Page Replacement Algo in C++
- Optimal Page Replacement Algo in Java
- Optimal Page Replacement Algo in Python
- Thrashing
- Belady’s Anomaly
- Static vs Dynamic Loading
- Static vs Dynamic Linking
- Swapping
- Translational Look Aside Buffer
- Process Address Space
- Difference between Segmentation and Paging
- File System
- Off-campus Drive Updates
- Get Hiring Updates
- Contact us
PREPINSTA PRIME
Process Life Cycle in Operating System
Process Life Cycle in Operating System (OS)
Process Life Cycle in Operating System is one of the five states in which a process can be starting from the time it has been submitted for execution, till the time when it has been executed by the system. Here we will learn detailed explanation about each states.
Think of it like a human life – you’re born, you grow, do tasks, take breaks, and eventually reach the end.

Stages of a Process in Life Cycle
A process can be in any of the following states –
- New state
- Ready state
- Running state
- Waiting state
- Terminated
- Imagine a unit process that executes a simple addition operation and prints it.

New State
- Process it submitted to the process queue, it in turns acknowledges submission.
- Once submission is acknowledged, the process is given new status.

Ready State
- It then goes to Ready State, at this moment the process is waiting to be assigned a processor by the OS

Prepare for Interview with us:
Running State
- Once the Processor is assigned, the process is being executed and turns in Running State.

Wait and Termination State
- Now the process can follow the following transitions –
- The process may have all resources it needs and may get directly executed and goes to Termination State.
- Process may need to go to waiting state any of the following
- Access to Input/Output device (Asking user the values that are required to be added) via console
- Process maybe intentionally interrupted by OS, as a higher priority operation maybe required, to be completed first
- A resource or memory access that maybe locked by another process, so current process goes to waiting state and waits for the resource to get free.
- Once requirements are completed i.e. either it gets back the priority to executed or requested locked resources are available to use, the process will go to running state again where, it may directly go to termination state or may be required to wait again for a possible required input/resource/priority interrupt.
- Termination

Process Cycle 1 | New State |
Process Cycle 2 | Read State |
Process Cycle 3 | Running State |
Process Cycle 4 | Waiting State |
Process Cycle 4 | Terminated State |
Summary
- New – New Process Created
- Ready – Process Ready for Processor/computing power allocation
- Running – Process getting executing
- Wait – Process waiting for signal
- Terminated – Process execution completed
Apart from the above some new systems also propose 2 more states of process which are –
- Suspended Ready – There maybe no possibility to add a new process in the queue. In such cases its can be said to be suspended ready state.
- Suspended Block – If the waiting queue is full

Final Thoughts
Understanding the process life cycle helps us know how the operating system manages different tasks running on a computer. Every process goes through stages like new, ready, running, waiting, and terminated – just like steps in a journey.
These stages make sure that the system runs smoothly, handles multiple tasks at once, and gives each process a fair chance to use the CPU.
In simple words, the process life cycle is the reason your computer can open apps, play music, and run programs all at the same time without getting confused.
FAQs
Yes, if the CPU needs to switch to another process (like in multitasking), the current running process goes back to the ready state and waits for its next turn.
The process is paused and waiting for something to happen — like reading a file, getting user input, or waiting for data. It will go back to ready once it’s done waiting.
The main states are:
- New (just created),
- Ready (waiting to run),
- Running (being executed),
- Waiting (paused for input/output),
- Terminated (finished or stopped).
It helps the operating system manage many tasks at once. By tracking each process’s stage, the system ensures everything runs smoothly without crashing or slowing down.
Login/Signup to comment