Question

Draw four Gantt charts illustrating the execution of these processes using FCFS, SRTN, SJF and Round Robin (quantum=2) scheduling.

16 Sep 2022
Answer :
Word Count : 399

Image ignouassignments-ignouacademy-com--p-execution-42218

FCFS (First-Come, First-Served) Scheduling:
Assume we have four processes P1, P2, P3, and P4, with the following execution times:
P1: 8 units
P2: 4 units
P3: 9 units
P4: 5 units
The Gantt chart for FCFS scheduling would look like:

| P1 | P2 | P3 | P4 |
0 8 12 21 26

SRTN (Shortest Remaining Time Next) Scheduling:
Assuming the same four processes with their execution times mentioned above, the Gantt chart for SRTN scheduling would be:
| P2 | P4 | P1 | _________ _______ ____ __________ ______ ___.
_______ ________ ___ ______ _____ _____.
______ _______ ____ ______ ____ ____ ________ __________ ___.
__________ _______ _______ ______ _________ _________.
______ ________ ____ ______ ______ ________ __________.
___ ____ ___ ____ _________ _____ __________ __________ ______ _________ _________.
__________ ____ ____ ____ ___.
___ __________ ______ ___ __________ _____ ___ ________ ___.
_______ _____ ______ _______ ___ _____ ___ _____ ________ ____.
______ ________ ___ ___ ____ ___ _____ ____ __________ __________ ______.
__________ __________ _________ ________ ______ _____.
____ ______ ________ _______ _______ _____ __________ _______ _______.
____ _____ ______ ___ ____ ________ ___ ___ ___ ______ ________.
_________ _____ _____ ________ __________ __________.
__________ _____ _______ ______ _______ _________ __________ __________.
______ ______ ___ ________ ____ _____ ______ _______ ________ ___.
__________ ____ ______ ______ _________ ___ __________ ______ _____ _________ ________ _______.
____ _________ ___ __________ _________ ___.
_______ _____ ___ _________ _________ ________ __________ ___ __________ __________.
____ ______ _______ _____ ____ _______ ____ _____ ______.
___ _______ _____ ____ ______ _________ ___ ___ __________.
____ __________ ______ _________ __________.
________ _________ _________ ___ ___ _________ ___ ___ _________ ____.
________ _______ ________ __________ ______ __________ ________.
_________ ________ ___ ____ ________ ______ ___ ________ _____ ______ ___.
_____ ___ ______ ___ ______.
____ _______ ____ ___ _______ __________ __________ ___.
___ ______ ___ _____ _________ _________ _______ ________ ____ ___ ____.
_________ __________ ____ _____ ____ ____ _____ _____ _________.
___ ______ ____ _______ ____ ____.
_____ ________ __________ _________ ________ ___ ____ ______ _____ ______.
___ _____ ___ ______ ____ ___ _________ ______ __________ __________ _______ _______.
_________ ___ _________ ____ _________ ________ __________ ____.
_________ ____ _________ ________ __________ __________ __________ ______.
________ ____ ____ _________ _______ ________ _______ ______ ____ _______ ______ ______.
______ ____.
Get Full Answer on WhatsApp

Related Questions

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.

Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.

How many page faults would occur for the following replacement algorithms, assuming four frames? Remember all frames are initially empty. a. FIFO replacement b. Least Recently Used replacement c. Optimal d. Least Frequently Used

Mention the merits and demerits of each of the above algorithms.

Which of the schedules in (a) results in minimal average waiting time (overall processes)?

Draw four Gantt charts illustrating the execution of these processes using FCFS, SRTN, SJF and Round Robin (quantum=2) scheduling.

What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?

On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at track 345 and head is moving to track 0. The queue in FIFO order contains requests for the following tracks: 123, 874,692, 475, 105, 376. Perform the computation for the following disk scheduling algorithms:

(a) FIFO (b) SSTF (c) SCAN (d) LOOK

Consider the following set of processes, with the length of the CPU burst time given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5, all at time 0.

Process

Burst time

P1

5

P2

3

P3

4

P4

7

P5

6
IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers
Login Cart
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance Draw four Gantt charts illustrating the execution of these processes u
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→