Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the following statements are true?I....
Start Learning for Free
Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
- a)I only
- b)I and III only
- c)II and III only
- d)I, II and III
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Which of the following statements are true?I. Shortest remaining time ...
I) Shortest remaining time first scheduling is a pre-emptive version of shortest job scheduling. In SRTF, job with the shortest CPU burst will be scheduled first. Because of this process, It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU.
II) Pre-emptive just means a process before completing its execution is stopped and other process can start execution. The stopped process can later come back and continue from where it was stopped. In pre-emptive scheduling, suppose process P1 is executing in CPU and after some time process P2 with high priority then P1 will arrive in ready queue then p1 is pre-empted and p2 will brought into CPU for execution. In this way if process which is arriving in ready queue is of higher priority then p1, then p1 is always pre-empted and it may possible that it suffer from starvation.
III) round robin will give better response time then FCFS ,in FCFS when process is executing ,it executed up to its complete burst time, but in round robin it will execute up to time quantum. So Round Robin Scheduling improves response time as all processes get CPU after a specified time. So, I,II,III are true which is option (D). Option (D) is correct answer.
II) Pre-emptive just means a process before completing its execution is stopped and other process can start execution. The stopped process can later come back and continue from where it was stopped. In pre-emptive scheduling, suppose process P1 is executing in CPU and after some time process P2 with high priority then P1 will arrive in ready queue then p1 is pre-empted and p2 will brought into CPU for execution. In this way if process which is arriving in ready queue is of higher priority then p1, then p1 is always pre-empted and it may possible that it suffer from starvation.
III) round robin will give better response time then FCFS ,in FCFS when process is executing ,it executed up to its complete burst time, but in round robin it will execute up to time quantum. So Round Robin Scheduling improves response time as all processes get CPU after a specified time. So, I,II,III are true which is option (D). Option (D) is correct answer.
Most Upvoted Answer
Which of the following statements are true?I. Shortest remaining time ...
Shortest remaining time first scheduling may cause starvation:
- Shortest remaining time first (SRTF) scheduling is a preemptive scheduling algorithm where the process with the shortest remaining burst time is executed first.
- If there is a continuous arrival of new processes with short burst times, the longer processes may never get a chance to execute, causing starvation.
Preemptive scheduling may cause starvation:
- Preemptive scheduling allows a running process to be interrupted and another process to be executed.
- If a high-priority process keeps arriving continuously, the lower priority processes may never get a chance to execute, causing starvation.
Round robin is better than FCFS in terms of response time:
- First come first serve (FCFS) scheduling algorithm executes the processes in the order in which they arrive.
- Round robin (RR) scheduling algorithm executes the processes for a fixed time slice and then moves on to the next process in the queue.
- RR scheduling ensures that every process gets a chance to execute, reducing the waiting time and improving the response time compared to FCFS.
Therefore, all three statements are true, and option D is the correct answer.
- Shortest remaining time first (SRTF) scheduling is a preemptive scheduling algorithm where the process with the shortest remaining burst time is executed first.
- If there is a continuous arrival of new processes with short burst times, the longer processes may never get a chance to execute, causing starvation.
Preemptive scheduling may cause starvation:
- Preemptive scheduling allows a running process to be interrupted and another process to be executed.
- If a high-priority process keeps arriving continuously, the lower priority processes may never get a chance to execute, causing starvation.
Round robin is better than FCFS in terms of response time:
- First come first serve (FCFS) scheduling algorithm executes the processes in the order in which they arrive.
- Round robin (RR) scheduling algorithm executes the processes for a fixed time slice and then moves on to the next process in the queue.
- RR scheduling ensures that every process gets a chance to execute, reducing the waiting time and improving the response time compared to FCFS.
Therefore, all three statements are true, and option D is the correct answer.
Free Test
FREE
| Start Free Test |
Community Answer
Which of the following statements are true?I. Shortest remaining time ...
Correct ans is d...
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
Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer?
Question Description
Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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 Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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 Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer?.
Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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 Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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 Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer?.
Solutions for Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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 Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer?, a detailed solution for Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer? has been provided alongside types of Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. Round robin is better than FCFS in terms of response timea)I onlyb)I and III onlyc)II and III onlyd)I, II and IIICorrect 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
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup