Class 10 Computer Science and Entrepreneurship Chapter No.1 – 1.3 Process Management in Operating System MCQs based quiz for Exam preparation of all Punjab Boards. We follow new Book Published by PECTAA in April 2026. So it best platform for Annual Exam 2027 preparation. This Chapter and Quiz is both for Group Tech and Non Tech Computer science students studying in 10 class, New Syllabus 2026 Punjab Boards.
1.3 Process Management in Operating System (OS)
The operating system is responsible for managing all the programs that run on a computer. In this context, these running programs are called processes. Process management ensures that each process gets the resources it needs, even when multiple processes are active. Process management is one of the most important jobs of an operating system because it ensures all processes run smoothly without disturbing each other.
1.3.1 Process Life Cycle
A process goes through several stages during its life cycle:
- Creation: This happens when you start any program (like MS Word).
The OS loads the program into memory and gives it the resources (like CPU time and memory) it needs. - Execution: The process is actively running and performing tasks effectively.
- Termination: The process finishes its task and is closed by the user or the system.
The OS frees the resources so they can be used by other processes.
Example: Process Lifecycle of opening a Web Browser on your mobile computer like Google Chrome.
- Creation: Begins when the user clicks the browser icon. The operating system loads the program into memory and allocates the required resources.
- Execution: The browser performs tasks such as loading web pages, displaying media, and responding to user actions.
- Termination: Occurs when the browser is closed. The operating system stops the process and releases its resources for other uses.
1.3.2 Multitasking and Concurrency
Modern operating systems can manage many processes so efficiently that it appears they
Multitasking: The operating system allows more than one program to be open and usable by a single user at the same time. You can easily switch between them whenever you need.
Example: You can listen to music, keep a document open, and browse the internet, moving between them as needed.
Concurrency: More than one process is active at the same time in an OS, but the CPU processes them one by one in extremely fast cycles.
Example: Like a chef preparing three dishes, working on one for a short time, then moving to the next, and repeating, the CPU switches between processes so rapidly that the user does not notice any delay.
1.3.3 Process Scheduling Concepts
We learned that many processes can be in progress during the same time period, but the CPU works on them one at a time in very fast turns. Since the CPU cannot run all processes at the same time, the operating system must decide:
- Which process should run first?
- How long each process should run.
This process is called scheduling. There are different scheduling methods used by operating systems. But in this chapter, we will explore only one of the simplest scheduling techniques, First Come, First Served (FCFS).
In the FCFS method, the CPU processes tasks in the exact order they arrive. The first process to arrive is completed first, and the next process starts only after the previous one finishes.
Example: Like a queue at a shop counter, the first customer in line is served first, then the next, and so on.
Numerical Example: Let us use some simple data to see how FCFS scheduling works in practice.
| Process ID | Arrival Time | Time needed |
|---|---|---|
| P1 | 0 Seconds | 5 Seconds |
| P2 | 1 Seconds | 3 Seconds |
| P3 | 2 Seconds | 2 Seconds |
Step-by-Step Explanation:
- At 0 seconds:
P1 arrives first, so it starts running immediately.
It requires 5 seconds to finish.
It runs from 0s to 5s.
2. At 1 seconds
P2 arrives while P1 is still running, so P2 waits
3. At 2 seconds:
P3 arrives, but P1 is still running and P2 is already waiting.
In FCFS, P3 will also wait until both P1 and P2 have completed.
4. At 5 seconds:
P1 finishes.
The CPU now starts P2, which needs 3 seconds to complete.
P2 runs from 5s to 8s.
5. At 8 seconds:
P2 finishes.
The CPU now starts P3, which needs 2 seconds.
P3 starts and runs from 8s to 10s.
Execution Timeline:
[P1: 0-5] –> [P2: 5-8] –> [P3: 8-10]
0 5 8 10
| P1 | P2 | P3 |
P1: 0s – 5s (finish at 5)
P2: 5s – 8s (finish at 8)
P3 : 8s – 10s (finish at 10)
Observation:
Even though P3 has the shortest duration (only 2 seconds), it must still wait until P1 and P2 have finished because they arrived earlier. This is one of the main characteristics of FCFS; shorter tasks can be delayed if they arrive after longer ones.
Advantages and Disadvantages of FCFS:
Although FCFS is a simple and fair scheduling method, it has both advantages and disadvantages:
Advantages: Easy to understand and implement, as processes are served in the exact order they arrive. No process is skipped. Disadvantages: Short processes may have to wait a long time if they are queued behind longer processes (known as the “convoy effect”)
Complete 10th Class Chapter 1 OS New Syllabus 2026 MCQs with Answers
1.1 Introduction to Operating System
1.2 Architecture of Operating System
1.3 Process Management in Operating System
