ISRO Scientist or Engineer Computer Science 2007 Question 11

Question 11

Consider a set of n tasks with known runtimes $$r_{1} r_{2}....... r_{n}$$, to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?



Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free

Comments

Register with

OR

Boost your Prep!

Download App