Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Which one of the following is correct with respect to short-term scheduling?

This question was previously asked in
UPSC ESE (Prelims) Electronics and Telecommunication Engineering 19 Feb 2023 Official Paper
Download PDF Attempt Online
View all UPSC IES Papers >
  1. The decision as to which available process will be executed by the processor
  2. The decision as to which process's pending I/O request shall be handled by an available I/O device
  3. The decision to add to the pool of processes to be executed
  4. The decision to add to the number of processes that are partially or fully in main memory

Answer (Detailed Solution Below)

Option 1 : The decision as to which available process will be executed by the processor
Free Tests
View all Free tests >
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.3 K Users
20 Questions 40 Marks 24 Mins
Start Now

Detailed Solution

Download Solution PDF

Short term scheduling: It has also known as CPU scheduling, is concerned with selecting a process from the ready queue and allocating the CPU to that process. The goal is to maximize CPU utilization and throughout. 

  • The decision-making process involved in selecting the next process to execute on the CPU from the pool of ready process.

Here, option 1 is correct.

Download Solution PDF
Latest UPSC IES Updates

Last updated on Jun 23, 2025

-> UPSC ESE result 2025 has been released. Candidates can download the ESE prelims result PDF from here.

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

‹‹ Previous Ques
Next Ques ››

More CPU Scheduling Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q3.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q4.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q5.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q6.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Q7.Which of the following does not interrupt a running process?
Q8.The head of a moving head disk with 200 tracks, numbered 0 to 199, has just finished a request at track 125, and currently serving a request at track 143. The queue of requests is given in the FIFO order as 86, 147, 91, 177, 94, 150, 102, 175, 130. What will be the total number of head movements required to satisfy these requests for SCAN algorithm ? 
Q9.Consider the following table of arrival time and burst time for three processes P0, P1, P2: Process arrival time Burst time P0 0 ms 7 P1 1 ms 3 P2 2 ms 7 The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes? 
Q10.Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used? 
Suggested Test Series
View All >
UPSC ESE (IES) Civil Mock Test Series
116 Total Tests with 1 Free Tests
Start Free Test
UPSC ESE (IES) Prelims Paper 1 Mock Test Series
54 Total Tests with   1 Free Tests
Start Free Test

More Operating Systems Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q3.Consider a system with three frames in memory and following memory references in the working set 2 1 2 3 5 4 1 3 4 2 1 How many page fault will be there if we use second chance page replacement algorithm ?
Q4.Which one of the following cannot be scheduled by the kernel ?
Q5.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q6.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q7.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q8.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q9.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q10.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook USA SAT Exam
Testbook USA ACT Exam
US College Admissions Guide
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti octro 3 patti rummy teen patti rich teen patti neta yono teen patti