Scribd
Upload
11 views3 pages

Assignment 1 Process Scheduling-1

The document is an assignment for an Operating Systems course that includes 15 numerical questions on various process scheduling algorithms, such as FCFS, SJF, Priority, and Round Robin. Each question requires calculations of turnaround time and waiting time for given processes with specified arrival and burst times. Students must submit a handwritten solution in PDF format by April 2, 2025.

Uploaded by

sdey45873
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

Assignment 1 Process Scheduling-1

The document is an assignment for an Operating Systems course that includes 15 numerical questions on various process scheduling algorithms, such as FCFS, SJF, Priority, and Round Robin. Each question requires calculations of turnaround time and waiting time for given processes with specified arrival and burst times. Students must submit a handwritten solution in PDF format by April 2, 2025.

Uploaded by

sdey45873
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

OPERATING SYSTEM

Assignment 1
Here are 15 numerical questions involving process scheduling algorithms (FCFS, SJF, Priority, RR). Each question
includes processes represented in a table format with arrival time, burst time, and priority (where applicable). The
tasks are to calculate the total turnaround time and waiting time of each process and average waiting time for
each scenario:
Note : Soft-copy of the solution to be upload in Operating System assignment section of DIGIICAMPUS and must be
handwritten, PDF file name (Yourname_Section). Sumit it by 2nd April 2025.
1. FCFS Scheduling

Process Arrival Time (ms) Burst Time (ms)


P1 0 5
P2 2 3
P3 4 7
P4 6 4

2. SJF Scheduling (Non-preemptive)

Process Arrival Time (ms) Burst Time (ms)


P1 0 6
P2 3 2
P3 5 8
P4 7 4

3. Priority Scheduling

Process Arrival Time (ms) Burst Time (ms) Priority


P1 1 4 3
P2 0 5 1
P3 2 6 2
P4 3 3 4

4. Round Robin Scheduling (Quantum = 4 ms)

Process Arrival Time (ms) Burst Time (ms)


P1 0 9
P2 1 5
P3 2 7
P4 3 6

5. FCFS Scheduling

Process Arrival Time (ms) Burst Time (ms)


P1 0 10
P2 1 4
P3 5 3
P4 6 2

HEMANT KUMAR MAHATO 1


OPERATING SYSTEM

6. SJF Scheduling (Preemptive)

Process Arrival Time (ms) Burst Time (ms)


P1 0 7
P2 1 3
P3 2 4
P4 3 5

7. Priority Scheduling

Process Arrival Time (ms) Burst Time (ms) Priority


P1 0 8 2
P2 1 6 1
P3 3 3 3
P4 4 5 4

8. Round Robin Scheduling (Quantum = 5 ms)

Process Arrival Time (ms) Burst Time (ms)


P1 0 12
P2 1 6
P3 2 8
P4 3 4

9. FCFS Scheduling

Process Arrival Time (ms) Burst Time (ms)


P1 0 3
P2 2 9
P3 5 2
P4 7 1

10. SJF Scheduling (Non-preemptive)

Process Arrival Time (ms) Burst Time (ms)


P1 0 5
P2 2 7
P3 4 1
P4 6 3

11. Priority Scheduling

Process Arrival Time (ms) Burst Time (ms) Priority


P1 0 5 1
P2 1 9 3
P3 2 6 2
P4 3 8 4

HEMANT KUMAR MAHATO 2


OPERATING SYSTEM

12. Round Robin Scheduling (Quantum = 3 ms)

Process Arrival Time (ms) Burst Time (ms)


P1 0 15
P2 1 10
P3 2 8
P4 3 12

13. FCFS Scheduling

Process Arrival Time (ms) Burst Time (ms)


P1 0 6
P2 1 4
P3 3 2
P4 5 8

14. SJF Scheduling (Non-preemptive)

Process Arrival Time (ms) Burst Time (ms)


P1 0 4
P2 2 5
P3 3 3
P4 4 2

15. Priority Scheduling

Process Arrival Time (ms) Burst Time (ms) Priority


P1 0 7 2
P2 1 4 1
P3 2 9 3
P4 3 5 4

HEMANT KUMAR MAHATO 3

You might also like