Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider four processes P1, P2, P3, and P4. T...

Join the Discussion on the App

Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?

Correct answer is '3'. Can you explain this answer?

FREE This question is part of

Practice Test: Computer Science Engineering (CSE) - 5

Attempt Test

Attempt this Test

Verified Answer

Consider four processes P1, P2, P3, and P4. The arrival time and the b...

Concept:

In the ready state, the process is waiting to be assigned to a processor. In running state, instructions are being executed. While the processes are in running state it may ask for i/o thus the process goes into waiting state instead of the ready state.

Calculation:

Gantt chart for SRTF:

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):Process Arrival Time Burst Time P1 0 12 P2 2 4 P3 3 6 P4 8 5The average waiting time (in milliseconds) of the processes is _________.

View answer

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:These processes are run on a single processor using preemptive shortest remaining time first scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is ________. Correct answer is '2'. Can you explain this answer?

View answer

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 illisecond, then the value of Z is ________. Correct answer is '2'. Can you explain this answer?

View answer

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.

View answer

Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling algorithm and schedules a new process either when the running process gets blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage of time does the CPU remain idle?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Share with a Friend

Answer this doubt

Question Description
Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer?.

Solutions for Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer?, a detailed solution for Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? has been provided alongside types of Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider four processes P1, P2, P3, and P4. The arrival time and the burst time for each process are given in the table below. Find the maximum number of processes present in the waiting state if the operating system implements a shortest remaining time first scheduling algorithm?Correct answer is '3'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam