Gate 2007 pyq C Programming | Consider the C program given below :int main (){int sum = 0, maxsum

[@satveerkaur3706]

Loops revised fully sir along with arrays. Thanks Sir

[@GateCsTOW]

Most welcome

[@yugalsahu9396]

Consider a set of n tasks with known runtimes r1, r2, …. rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? (A) Round-Robin (B) Shortest-Job-First (C) Highest-Response-Ratio-Next (D) First-Come-First-Served Gate cse 2001 sir please explain this question with proper reason why answer sjb is preferred here?

[@GateCsTOW]

Sjf is preffered because it has highest efficiency Or throughput. Sjf will pick smallest jobs hence in very less time(in starting ) a lot of jobs will be completed so the throughput will increase in begining. And i may not be answer entire questions in comment section I'm sorry in advance, os will be started only when programming and CN is done. Good day

[@yugalsahu9396]

@@GateCsTOW thanku sir. Waiting for os lectures sir.