With round robin scheduling algorithm in a time shared system ____________(a) using very large time slices converts it into First come First served scheduling algorithm(b) using very small time slices converts it into First come First served scheduling algorithm(c) using extremely small time slices increases performance(d) using very small time slices converts it into Shortest Job First algorithmThe question was posed to me in quiz.This key question is from CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System

With round robin scheduling algorithm in a time shared system ________

1.	With round robin scheduling algorithm in a time shared system ____________(a) using very large time slices converts it into First come First served scheduling algorithm(b) using very small time slices converts it into First come First served scheduling algorithm(c) using extremely small time slices increases performance(d) using very small time slices converts it into Shortest Job First algorithmThe question was posed to me in quiz.This key question is from CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System
Answer» The correct option is (a) USING very LARGE TIME slices converts it into First come First SERVED scheduling algorithm Best explanation: All the processes will be able to get COMPLETED.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following scheduling algorithms gives minimum average waiting time?(a) FCFS(b) SJF(c) Round – robin(d) PriorityThe question was asked in a job interview.The question is from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System
A solution to the problem of indefinite blockage of low – priority processes is ____________(a) Starvation(b) Wait queue(c) Ready queue(d) AgingThe question was asked in class test.My query is from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System
What is ‘Aging’?(a) keeping track of cache contents(b) keeping track of what pages are currently residing in memory(c) keeping track of how many times a given page is referenced(d) increasing the priority of jobs to ensure termination in a finite timeI got this question during an interview.The question is from CPU Scheduling Algorithms-2 topic in portion CPU Scheduling of Operating System
Choose one of the disadvantages of the priority scheduling algorithm?(a) it schedules in a very complex manner(b) its scheduling takes up a lot of time(c) it can lead to some low priority process waiting indefinitely for the CPU(d) none of the mentionedThis question was posed to me in an international level competition.Origin of the question is CPU Scheduling Algorithms-2 topic in division CPU Scheduling of Operating System
An SJF algorithm is simply a priority algorithm where the priority is ____________(a) the predicted next CPU burst(b) the inverse of the predicted next CPU burst(c) the current CPU burst(d) anything the user wantsThis question was addressed to me during an internship interview.I'm obligated to ask this question of CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System
Preemptive Shortest Job First scheduling is sometimes called ____________(a) Fast SJF scheduling(b) EDF scheduling – Earliest Deadline First(c) HRRN scheduling – Highest Response Ratio Next(d) SRTN scheduling – Shortest Remaining Time NextThe question was asked in an interview.My doubt stems from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System
The FCFS algorithm is particularly troublesome for ____________(a) time sharing systems(b) multiprogramming systems(c) multiprocessor systems(d) operating systemsI have been asked this question in unit test.This intriguing question originated from CPU Scheduling Algorithms-2 in section CPU Scheduling of Operating System
The real difficulty with SJF in short term scheduling is ____________(a) it is too good an algorithm(b) knowing the length of the next CPU request(c) it is too complex to understand(d) none of the mentionedI had been asked this question during an internship interview.I'd like to ask this question from CPU Scheduling Algorithms-2 topic in division CPU Scheduling of Operating System
Which is the most optimal scheduling algorithm?(a) FCFS – First come First served(b) SJF – Shortest Job First(c) RR – Round Robin(d) None of the mentionedI have been asked this question by my school principal while I was bunking the class.The question is from CPU Scheduling Algorithms-2 topic in section CPU Scheduling of Operating System
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________(a) Lengthened; Shortened(b) Shortened; Lengthened(c) Shortened; Shortened(d) Shortened; UnchangedThe question was asked in class test.I want to ask this question from CPU Scheduling Algorithms-1 in chapter CPU Scheduling of Operating System

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment