Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider three CPU intensive processes, which...
Start Learning for Free
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored
- a)1
- b)2
- c)3
- d)4
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
Consider three CPU intensive processes, which require 10, 20, 30 units...
Let three process be P0, P1 and P2 with arrival times 0, 2 and 6 respectively and CPU burst times 10, 20 and 30 respectively. At time 0, P0 is the only available process so it runs. At time 2, P1 arrives, but P0 has the shortest remaining time, so it continues. At time 6, P2 also arrives, but P0 still has the shortest remaining time, so it continues. At time 10, P1 is scheduled as it is the shortest remaining time process. At time 30, P2 is scheduled.
Most Upvoted Answer
Consider three CPU intensive processes, which require 10, 20, 30 units...
Shortest Remaining Time First (SRTF)
In the Shortest Remaining Time First (SRTF) scheduling algorithm, the process with the shortest remaining burst time is executed first. This algorithm preemptively switches between processes based on their remaining burst time.
Given Information:
- Three CPU intensive processes
- Arrival times: 0, 2, 6
- CPU burst times: 10, 20, 30
Step 1: Sorting the processes based on arrival times:
To apply the SRTF algorithm, we first need to sort the processes based on their arrival times in ascending order. This gives us the following order: P1, P2, P3.
Step 2: Executing the processes:
- At time 0, P1 arrives. Since it is the only process, it starts executing.
- At time 2, P2 arrives. However, P1 still has 8 units of burst time remaining, which is shorter than P2's burst time of 20 units. Hence, there is no context switch at this point.
- At time 6, P3 arrives. Again, P1 still has 2 units of burst time remaining, which is shorter than P3's burst time of 30 units. Therefore, there is no context switch.
Step 3: Preemption and context switches:
- At time 10, P1 completes its burst time. Now, P2 has the shortest remaining burst time, so a context switch occurs from P1 to P2.
- At time 12, P2 resumes execution after the context switch.
- At time 30, P2 completes its burst time. Now, P3 has the shortest remaining burst time, so a context switch occurs from P2 to P3.
Total Context Switches:
In this scenario, a total of 3 context switches occur:
1. At time 10, from P1 to P2.
2. At time 12, from P1 to P2.
3. At time 30, from P2 to P3.
Therefore, the correct answer is option 'C' (3 context switches).
In the Shortest Remaining Time First (SRTF) scheduling algorithm, the process with the shortest remaining burst time is executed first. This algorithm preemptively switches between processes based on their remaining burst time.
Given Information:
- Three CPU intensive processes
- Arrival times: 0, 2, 6
- CPU burst times: 10, 20, 30
Step 1: Sorting the processes based on arrival times:
To apply the SRTF algorithm, we first need to sort the processes based on their arrival times in ascending order. This gives us the following order: P1, P2, P3.
Step 2: Executing the processes:
- At time 0, P1 arrives. Since it is the only process, it starts executing.
- At time 2, P2 arrives. However, P1 still has 8 units of burst time remaining, which is shorter than P2's burst time of 20 units. Hence, there is no context switch at this point.
- At time 6, P3 arrives. Again, P1 still has 2 units of burst time remaining, which is shorter than P3's burst time of 30 units. Therefore, there is no context switch.
Step 3: Preemption and context switches:
- At time 10, P1 completes its burst time. Now, P2 has the shortest remaining burst time, so a context switch occurs from P1 to P2.
- At time 12, P2 resumes execution after the context switch.
- At time 30, P2 completes its burst time. Now, P3 has the shortest remaining burst time, so a context switch occurs from P2 to P3.
Total Context Switches:
In this scenario, a total of 3 context switches occur:
1. At time 10, from P1 to P2.
2. At time 12, from P1 to P2.
3. At time 30, from P2 to P3.
Therefore, the correct answer is option 'C' (3 context switches).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer?
Question Description
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer?.
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer?.
Solutions for Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. 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 three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignoreda)1b)2c)3d)4Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup