An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. 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 > An operating system uses Shortest Job first (...

Join the Discussion on the App

An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:

What is the average response time (in milliseconds)?

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

FREE This question is part of

Practice Test: Computer Science Engineering (CSE) - 7

Attempt Test

Attempt this Test

Verified Answer

An operating system uses Shortest Job first (SJF) process scheduling a...

Gantt chart:

Response time is the amount of time from when a request was submitted until the first response is produced.

Response time = submission time – Arrival time

Response time of process P1 = 8 – 0 = 8

Response time of process P2 = 0 – 0 = 0

Response time of process P3 = 5 – 1 = 4

Response time of process P4 = 16 – 3 = 13

Average response time =

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

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 TimeP1 0 12P2 2 4P3 3 6P4 8 5Q.The average waiting time (in milliseconds) of the processes is _________.

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

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

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

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. 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 An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. 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 An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer?.

Solutions for An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. 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 An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer?, a detailed solution for An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer? has been provided alongside types of An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice An operating system uses Shortest Job first (SJF) process scheduling algorithm. Consider the arrival times and execution times (in milliseconds) for the following processes:What is the average response time (in milliseconds)?Correct answer is '6.25'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam