Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider three processes (process id 0, 1, 2 ...
Start Learning for Free
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:
- a)13 units
- b)14 units
- c)15 units
- d)16 units
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider three processes (process id 0, 1, 2 respectively) with comput...
Let the processes be p0, p1 and p2. These processes will be executed in following order.
Turn around time of a process is total time between submission of the process and its completion. Turn around time of p0 = 12 (12-0) Turn around time of p1 = 13 (13-0) Turn around time of p2 = 14 (14-0) Average turn around time is (12+13+14)/3 = 13.
Most Upvoted Answer
Consider three processes (process id 0, 1, 2 respectively) with comput...
Longest Remaining Time First (LRTF) Scheduling Algorithm
The Longest Remaining Time First (LRTF) scheduling algorithm is a non-preemptive scheduling algorithm that selects the process with the longest remaining burst time to execute next. In case of ties, the process with the lowest process id is given priority.
Given Information:
- Process 0 has a burst time of 2 units.
- Process 1 has a burst time of 4 units.
- Process 2 has a burst time of 8 units.
- All processes arrive at time zero.
Step-by-Step Execution:
1. At time zero, all three processes are available.
2. Since process 2 has the longest remaining burst time of 8 units, it is selected to be executed first.
3. Process 2 executes for 8 units of time, leaving behind process 0 and process 1.
4. Now, the remaining burst times are:
- Process 0: 2 units
- Process 1: 4 units
5. Since process 1 has the longest remaining burst time of 4 units, it is selected to be executed next.
6. Process 1 executes for 4 units of time, leaving behind process 0.
7. Now, the remaining burst time is:
- Process 0: 2 units
8. Process 0 is the only process remaining, so it is executed for the remaining 2 units of time.
9. All processes have completed their execution.
Calculating Turnaround Time:
The turnaround time for each process is the total time taken from arrival to completion.
- Process 2: 8 units (executed from time 0 to time 8)
- Process 1: 8 units (executed from time 8 to time 12)
- Process 0: 10 units (executed from time 12 to time 14)
Average Turnaround Time:
To calculate the average turnaround time, we sum up the turnaround times of all processes and divide by the number of processes.
Average Turnaround Time = (8 + 8 + 10) / 3 = 26 / 3 = 8.67 units
Therefore, the correct answer is option 'A' - 13 units.
The Longest Remaining Time First (LRTF) scheduling algorithm is a non-preemptive scheduling algorithm that selects the process with the longest remaining burst time to execute next. In case of ties, the process with the lowest process id is given priority.
Given Information:
- Process 0 has a burst time of 2 units.
- Process 1 has a burst time of 4 units.
- Process 2 has a burst time of 8 units.
- All processes arrive at time zero.
Step-by-Step Execution:
1. At time zero, all three processes are available.
2. Since process 2 has the longest remaining burst time of 8 units, it is selected to be executed first.
3. Process 2 executes for 8 units of time, leaving behind process 0 and process 1.
4. Now, the remaining burst times are:
- Process 0: 2 units
- Process 1: 4 units
5. Since process 1 has the longest remaining burst time of 4 units, it is selected to be executed next.
6. Process 1 executes for 4 units of time, leaving behind process 0.
7. Now, the remaining burst time is:
- Process 0: 2 units
8. Process 0 is the only process remaining, so it is executed for the remaining 2 units of time.
9. All processes have completed their execution.
Calculating Turnaround Time:
The turnaround time for each process is the total time taken from arrival to completion.
- Process 2: 8 units (executed from time 0 to time 8)
- Process 1: 8 units (executed from time 8 to time 12)
- Process 0: 10 units (executed from time 12 to time 14)
Average Turnaround Time:
To calculate the average turnaround time, we sum up the turnaround times of all processes and divide by the number of processes.
Average Turnaround Time = (8 + 8 + 10) / 3 = 26 / 3 = 8.67 units
Therefore, the correct answer is option 'A' - 13 units.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
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 processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer?
Question Description
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. 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 three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. 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 three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer?.
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. 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 three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. 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 three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer?.
Solutions for Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. 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 processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:a)13 unitsb)14 unitsc)15 unitsd)16unitsCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup