Question Detail Which among following scheduling algorithms give minimum average waiting time FCFSSJFRound robinOn priority Answer: Option B Similar Questions : 1. Multiprogramming systems Are easier to develop than single programming systems Execute each job fasterExecute more jobs in the same time Are used only on large main frame computers Answer: Option C 2. Which one is true The linkage editor is used to edit programs which have to later link togetherThe linkage editor links object module during compilingThe linkage editor links objects modules and resolves external references between them before loadingnone of above Answer: Option C 3. In which scheduling policies, context switching never takes place FCFSround robinShortest job firstPre-empitive Answer: Option A 4. A public key encryption system Allows only the correct sender to decode the dataAllows only the correct receiver to decode the dataAllows anyone to decode the datanone of above Answer: Option B 5. Shortest Job First executes first the job with the least processor needsthat first entered the queuethat has been in the queue for the longestthat last entered the queue Answer: Option A Read more from - Operating System Questions Answers - Chapter 1