Discussion
The SJF algorithm executes first the job
Answer: D
Correct answer: with the least processor needs
Shortest job first selects the ready process with the smallest expected processor burst. That minimises the average waiting time - provably so - but it needs an estimate of each burst in advance and can starve long jobs indefinitely if short ones keep arriving.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development