Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > A uni-processor computer system only has two ...
Start Learning for Free
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?
- a)First come first served scheduling
- b)Shortest remaining time first scheduling
- c)Static priority scheduling with different priorities for the two processes
- d)Round robin scheduling with a time quantum of 5 ms
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
A uni-processor computer system only has two processes, both of which ...
When Round Robin scheduling is used We are given that the time slice is 5ms. Consider process P and Q. Say P utilizes 5ms of CPU and then Q utilizes 5ms of CPU. Hence after 15ms P starts with I/O And after 20ms Q also starts with I/O. Since I/O can be done in parallel, P finishes IO at 105th ms (15 + 90) and Q finishes its IO at 110th ms (20 + 90). Therefore we can see that CPU remains idle from 20th to 105th ms. That is when Round Robin scheduling is used, Idle time of CPU = 85ms CPU Utilization = 20/105 = 19.05% When First Come First Served scheduling scheduling or Shortest Remaining Time First is used Say P utilizes 10ms of CPU and then starts its I/O. At 11th ms Q starts processing. Q utilizes 10ms of CPU. P completes its I/O at 100ms (10 + 90) Q completes its I/O at 110ms (20 + 90) At 101th ms P again utilizes CPU. Hence, Idle time of CPU = 80ms CPU Utilization = 20/100 = 20% Since only two processes are involved and IO time is much more than CPU time, "Static priority scheduling with different priorities" for the two processes reduces to FCFS or Shortest remaining time first. Therefore, Round robin will result in least CPU utilization.
Most Upvoted Answer
A uni-processor computer system only has two processes, both of which ...
Round Robin Scheduling with a Time Quantum of 5 ms
Round robin scheduling is a pre-emptive algorithm that allocates a fixed time slice to each process in a circular queue. Here's why it will result in the least CPU utilization for the given system:
- Equal Time Allocation: With a time quantum of 5 ms, each process will get an equal share of CPU time before being preempted. This ensures fair scheduling and prevents any process from monopolizing the CPU.
- Context Switching: The short time quantum allows for frequent context switching between processes, which can help in reducing the waiting time for each process and overall system response time.
- Handling I/O Bursts: Since both processes have I/O bursts, the CPU can switch to another process while one is waiting for I/O, maximizing CPU utilization.
- Preventing Starvation: Round robin scheduling ensures that every process gets a chance to execute, preventing any process from being starved of CPU time in the long run.
Overall, in a system with processes alternating between CPU and I/O bursts, round robin scheduling with a small time quantum is an efficient strategy to ensure fair CPU utilization and optimal system performance.
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
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer?
Question Description
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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 A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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 A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer?.
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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 A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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 A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer?.
Solutions for A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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 A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer?, a detailed solution for A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer? has been provided alongside types of A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?a)First come first served schedulingb)Shortest remaining time first schedulingc)Static priority scheduling with different priorities for the two processesd)Round robin scheduling with a time quantum of 5 msCorrect answer is option 'D'. 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