A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 these
Answer:knowing the length of the next CPU request
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

“Throughput” of a system is
Which is non pre-emptive
The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________ .
Interval between the time of submission and completion of the job is called
What is a medium-term scheduler ?
Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm :
The main function of the dispatcher (the portion of the process scheduler) is
Which among following scheduling algorithms give minimum average waiting time
The most optimal scheduling algorithm is :
FIFO scheduling is ________.
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.